Mutual exclusivity as a challenge for deep neural networks
Strong inductive biases allow children to learn in fast and adaptable ways. Children use the mutual exclusivity (ME) bias to help disambiguate how words map to referents, assuming that if an object has one label then it does not need another. In this paper, we investigate whether or not standard neu...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Gandhi, Kanishk Lake, Brenden M |
description | Strong inductive biases allow children to learn in fast and adaptable ways.
Children use the mutual exclusivity (ME) bias to help disambiguate how words
map to referents, assuming that if an object has one label then it does not
need another. In this paper, we investigate whether or not standard neural
architectures have an ME bias, demonstrating that they lack this learning
assumption. Moreover, we show that their inductive biases are poorly matched to
lifelong learning formulations of classification and translation. We
demonstrate that there is a compelling case for designing neural networks that
reason by mutual exclusivity, which remains an open challenge. |
doi_str_mv | 10.48550/arxiv.1906.10197 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1906_10197</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1906_10197</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-61fae60706b50d6cb5b7b779aec94897cc663febc94f5e6b15ba5fd3948146b43</originalsourceid><addsrcrecordid>eNotj8tuwjAURL1hUUE_oKv6B5LaSnwds0OIPiQqNuyja-e6jWoS5Dwa_r4BuhqNZjSaw9iTFGleKCVeME71mEojIJVCGv3A1p9DP2DgNLkwdPVY9xeOHUfuvjEEar6I-zbyiujMGxriXG2o_23jT7diC4-ho8d_XbLj6-64fU_2h7eP7WafIGidgPRIILQAq0QFziqrrdYGyZm8MNo5gMyTnZ1XBFYqi8pX2RzKHGyeLdnzffZ2vjzH-oTxUl4hyhtE9geAIUJE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Mutual exclusivity as a challenge for deep neural networks</title><source>arXiv.org</source><creator>Gandhi, Kanishk ; Lake, Brenden M</creator><creatorcontrib>Gandhi, Kanishk ; Lake, Brenden M</creatorcontrib><description>Strong inductive biases allow children to learn in fast and adaptable ways.
Children use the mutual exclusivity (ME) bias to help disambiguate how words
map to referents, assuming that if an object has one label then it does not
need another. In this paper, we investigate whether or not standard neural
architectures have an ME bias, demonstrating that they lack this learning
assumption. Moreover, we show that their inductive biases are poorly matched to
lifelong learning formulations of classification and translation. We
demonstrate that there is a compelling case for designing neural networks that
reason by mutual exclusivity, which remains an open challenge.</description><identifier>DOI: 10.48550/arxiv.1906.10197</identifier><language>eng</language><subject>Computer Science - Computation and Language ; Computer Science - Learning</subject><creationdate>2019-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1906.10197$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1906.10197$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gandhi, Kanishk</creatorcontrib><creatorcontrib>Lake, Brenden M</creatorcontrib><title>Mutual exclusivity as a challenge for deep neural networks</title><description>Strong inductive biases allow children to learn in fast and adaptable ways.
Children use the mutual exclusivity (ME) bias to help disambiguate how words
map to referents, assuming that if an object has one label then it does not
need another. In this paper, we investigate whether or not standard neural
architectures have an ME bias, demonstrating that they lack this learning
assumption. Moreover, we show that their inductive biases are poorly matched to
lifelong learning formulations of classification and translation. We
demonstrate that there is a compelling case for designing neural networks that
reason by mutual exclusivity, which remains an open challenge.</description><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tuwjAURL1hUUE_oKv6B5LaSnwds0OIPiQqNuyja-e6jWoS5Dwa_r4BuhqNZjSaw9iTFGleKCVeME71mEojIJVCGv3A1p9DP2DgNLkwdPVY9xeOHUfuvjEEar6I-zbyiujMGxriXG2o_23jT7diC4-ho8d_XbLj6-64fU_2h7eP7WafIGidgPRIILQAq0QFziqrrdYGyZm8MNo5gMyTnZ1XBFYqi8pX2RzKHGyeLdnzffZ2vjzH-oTxUl4hyhtE9geAIUJE</recordid><startdate>20190624</startdate><enddate>20190624</enddate><creator>Gandhi, Kanishk</creator><creator>Lake, Brenden M</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20190624</creationdate><title>Mutual exclusivity as a challenge for deep neural networks</title><author>Gandhi, Kanishk ; Lake, Brenden M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-61fae60706b50d6cb5b7b779aec94897cc663febc94f5e6b15ba5fd3948146b43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Gandhi, Kanishk</creatorcontrib><creatorcontrib>Lake, Brenden M</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gandhi, Kanishk</au><au>Lake, Brenden M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mutual exclusivity as a challenge for deep neural networks</atitle><date>2019-06-24</date><risdate>2019</risdate><abstract>Strong inductive biases allow children to learn in fast and adaptable ways.
Children use the mutual exclusivity (ME) bias to help disambiguate how words
map to referents, assuming that if an object has one label then it does not
need another. In this paper, we investigate whether or not standard neural
architectures have an ME bias, demonstrating that they lack this learning
assumption. Moreover, we show that their inductive biases are poorly matched to
lifelong learning formulations of classification and translation. We
demonstrate that there is a compelling case for designing neural networks that
reason by mutual exclusivity, which remains an open challenge.</abstract><doi>10.48550/arxiv.1906.10197</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1906.10197 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1906_10197 |
source | arXiv.org |
subjects | Computer Science - Computation and Language Computer Science - Learning |
title | Mutual exclusivity as a challenge for deep neural networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A53%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Mutual%20exclusivity%20as%20a%20challenge%20for%20deep%20neural%20networks&rft.au=Gandhi,%20Kanishk&rft.date=2019-06-24&rft_id=info:doi/10.48550/arxiv.1906.10197&rft_dat=%3Carxiv_GOX%3E1906_10197%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |