Associative content-addressable networks with exponentially many robust stable states
The brain must robustly store a large number of memories, corresponding to the many events encountered over a lifetime. However, the number of memory states in existing neural network models either grows weakly with network size or recall fails catastrophically with vanishingly little noise. We cons...
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 | Chaudhuri, Rishidev Fiete, Ila |
description | The brain must robustly store a large number of memories, corresponding to
the many events encountered over a lifetime. However, the number of memory
states in existing neural network models either grows weakly with network size
or recall fails catastrophically with vanishingly little noise. We construct an
associative content-addressable memory with exponentially many stable states
and robust error-correction. The network possesses expander graph connectivity
on a restricted Boltzmann machine architecture. The expansion property allows
simple neural network dynamics to perform at par with modern error-correcting
codes. Appropriate networks can be constructed with sparse random connections,
glomerular nodes, and associative learning using low dynamic-range weights.
Thus, sparse quasi-random structures---characteristic of important
error-correcting codes---may provide for high-performance computation in
artificial neural networks and the brain. |
doi_str_mv | 10.48550/arxiv.1704.02019 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1704_02019</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1704_02019</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-61125e892e222e8d131adc4355a3abba06ce95d730478728c504e5abf7a2836f3</originalsourceid><addsrcrecordid>eNotj7tOwzAUQL0woMIHMOEfSPAjjp2xqnhJlVjaObqOb4RFale2aZu_pwSmsxwd6RDywFndGKXYE6SLP9Vcs6ZmgvHuluzXOcfBQ_EnpEMMBUOpwLmEOYOdkAYs55i-Mj378knxcozhqniYppkeIMw0RfudC81l0a8omO_IzQhTxvt_rsju5Xm3eau2H6_vm_W2glZ3Vcu5UGg6gUIINI5LDm5opFIgwVpg7YCdclqyRhstzKBYgwrsqEEY2Y5yRR7_sstXf0z-AGnuf__65U_-AA3nTK0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Associative content-addressable networks with exponentially many robust stable states</title><source>arXiv.org</source><creator>Chaudhuri, Rishidev ; Fiete, Ila</creator><creatorcontrib>Chaudhuri, Rishidev ; Fiete, Ila</creatorcontrib><description>The brain must robustly store a large number of memories, corresponding to
the many events encountered over a lifetime. However, the number of memory
states in existing neural network models either grows weakly with network size
or recall fails catastrophically with vanishingly little noise. We construct an
associative content-addressable memory with exponentially many stable states
and robust error-correction. The network possesses expander graph connectivity
on a restricted Boltzmann machine architecture. The expansion property allows
simple neural network dynamics to perform at par with modern error-correcting
codes. Appropriate networks can be constructed with sparse random connections,
glomerular nodes, and associative learning using low dynamic-range weights.
Thus, sparse quasi-random structures---characteristic of important
error-correcting codes---may provide for high-performance computation in
artificial neural networks and the brain.</description><identifier>DOI: 10.48550/arxiv.1704.02019</identifier><language>eng</language><subject>Computer Science - Neural and Evolutionary Computing ; Quantitative Biology - Neurons and Cognition</subject><creationdate>2017-04</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/1704.02019$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1704.02019$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chaudhuri, Rishidev</creatorcontrib><creatorcontrib>Fiete, Ila</creatorcontrib><title>Associative content-addressable networks with exponentially many robust stable states</title><description>The brain must robustly store a large number of memories, corresponding to
the many events encountered over a lifetime. However, the number of memory
states in existing neural network models either grows weakly with network size
or recall fails catastrophically with vanishingly little noise. We construct an
associative content-addressable memory with exponentially many stable states
and robust error-correction. The network possesses expander graph connectivity
on a restricted Boltzmann machine architecture. The expansion property allows
simple neural network dynamics to perform at par with modern error-correcting
codes. Appropriate networks can be constructed with sparse random connections,
glomerular nodes, and associative learning using low dynamic-range weights.
Thus, sparse quasi-random structures---characteristic of important
error-correcting codes---may provide for high-performance computation in
artificial neural networks and the brain.</description><subject>Computer Science - Neural and Evolutionary Computing</subject><subject>Quantitative Biology - Neurons and Cognition</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7tOwzAUQL0woMIHMOEfSPAjjp2xqnhJlVjaObqOb4RFale2aZu_pwSmsxwd6RDywFndGKXYE6SLP9Vcs6ZmgvHuluzXOcfBQ_EnpEMMBUOpwLmEOYOdkAYs55i-Mj378knxcozhqniYppkeIMw0RfudC81l0a8omO_IzQhTxvt_rsju5Xm3eau2H6_vm_W2glZ3Vcu5UGg6gUIINI5LDm5opFIgwVpg7YCdclqyRhstzKBYgwrsqEEY2Y5yRR7_sstXf0z-AGnuf__65U_-AA3nTK0</recordid><startdate>20170406</startdate><enddate>20170406</enddate><creator>Chaudhuri, Rishidev</creator><creator>Fiete, Ila</creator><scope>AKY</scope><scope>ALC</scope><scope>GOX</scope></search><sort><creationdate>20170406</creationdate><title>Associative content-addressable networks with exponentially many robust stable states</title><author>Chaudhuri, Rishidev ; Fiete, Ila</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-61125e892e222e8d131adc4355a3abba06ce95d730478728c504e5abf7a2836f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Neural and Evolutionary Computing</topic><topic>Quantitative Biology - Neurons and Cognition</topic><toplevel>online_resources</toplevel><creatorcontrib>Chaudhuri, Rishidev</creatorcontrib><creatorcontrib>Fiete, Ila</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Quantitative Biology</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chaudhuri, Rishidev</au><au>Fiete, Ila</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Associative content-addressable networks with exponentially many robust stable states</atitle><date>2017-04-06</date><risdate>2017</risdate><abstract>The brain must robustly store a large number of memories, corresponding to
the many events encountered over a lifetime. However, the number of memory
states in existing neural network models either grows weakly with network size
or recall fails catastrophically with vanishingly little noise. We construct an
associative content-addressable memory with exponentially many stable states
and robust error-correction. The network possesses expander graph connectivity
on a restricted Boltzmann machine architecture. The expansion property allows
simple neural network dynamics to perform at par with modern error-correcting
codes. Appropriate networks can be constructed with sparse random connections,
glomerular nodes, and associative learning using low dynamic-range weights.
Thus, sparse quasi-random structures---characteristic of important
error-correcting codes---may provide for high-performance computation in
artificial neural networks and the brain.</abstract><doi>10.48550/arxiv.1704.02019</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1704.02019 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1704_02019 |
source | arXiv.org |
subjects | Computer Science - Neural and Evolutionary Computing Quantitative Biology - Neurons and Cognition |
title | Associative content-addressable networks with exponentially many robust stable states |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T12%3A50%3A04IST&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=Associative%20content-addressable%20networks%20with%20exponentially%20many%20robust%20stable%20states&rft.au=Chaudhuri,%20Rishidev&rft.date=2017-04-06&rft_id=info:doi/10.48550/arxiv.1704.02019&rft_dat=%3Carxiv_GOX%3E1704_02019%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 |