Autoassociative memory retrieval and spontaneous activity bumps in small-world networks of integrate-and-fire neurons
- PMID: 17320359
- DOI: 10.1016/j.jphysparis.2007.01.004
Autoassociative memory retrieval and spontaneous activity bumps in small-world networks of integrate-and-fire neurons
Abstract
The metric structure of synaptic connections is obviously an important factor in shaping the properties of neural networks, in particular the capacity to retrieve memories, with which are endowed autoassociative nets operating via attractor dynamics. Qualitatively, some real networks in the brain could be characterized as 'small worlds', in the sense that the structure of their connections is intermediate between the extremes of an orderly geometric arrangement and of a geometry-independent random mesh. Small worlds can be defined more precisely in terms of their mean path length and clustering coefficient; but is such a precise description useful for a better understanding of how the type of connectivity affects memory retrieval? We have simulated an autoassociative memory network of integrate-and-fire units, positioned on a ring, with the network connectivity varied parametrically between ordered and random. We find that the network retrieves previously stored memory patterns when the connectivity is close to random, and displays the characteristic behavior of ordered nets (localized 'bumps' of activity) when the connectivity is close to ordered. Recent analytical work shows that these two behaviors can coexist in a network of simple threshold-linear units, leading to localized retrieval states. We find that they tend to be mutually exclusive behaviors, however, with our integrate-and-fire units. Moreover, the transition between the two occurs for values of the connectivity parameter which are not simply related to the notion of small worlds.
Similar articles
-
Mean-driven and fluctuation-driven persistent activity in recurrent networks.Neural Comput. 2007 Jan;19(1):1-46. doi: 10.1162/neco.2007.19.1.1. Neural Comput. 2007. PMID: 17134316
-
Network capacity analysis for latent attractor computation.Network. 2003 May;14(2):273-302. Network. 2003. PMID: 12790185
-
Information and topology in attractor neural networks.Neural Comput. 2007 Apr;19(4):956-73. doi: 10.1162/neco.2007.19.4.956. Neural Comput. 2007. PMID: 17348769
-
A model of cortical associative memory based on a horizontal network of connected columns.Network. 1998 May;9(2):235-64. Network. 1998. PMID: 9861988 Review.
-
Memory capacities for synaptic and structural plasticity.Neural Comput. 2010 Feb;22(2):289-341. doi: 10.1162/neco.2009.08-07-588. Neural Comput. 2010. PMID: 19925281 Review.
Cited by
-
A simplified computational memory model from information processing.Sci Rep. 2016 Nov 23;6:37470. doi: 10.1038/srep37470. Sci Rep. 2016. PMID: 27876847 Free PMC article.
-
Clustering predicts memory performance in networks of spiking and non-spiking neurons.Front Comput Neurosci. 2011 Mar 30;5:14. doi: 10.3389/fncom.2011.00014. eCollection 2011. Front Comput Neurosci. 2011. PMID: 21519373 Free PMC article.
-
Representing where along with what information in a model of a cortical patch.PLoS Comput Biol. 2008 Mar 21;4(3):e1000012. doi: 10.1371/journal.pcbi.1000012. PLoS Comput Biol. 2008. PMID: 18369416 Free PMC article.
-
A mismatch-based model for memory reconsolidation and extinction in attractor networks.PLoS One. 2011;6(8):e23113. doi: 10.1371/journal.pone.0023113. Epub 2011 Aug 3. PLoS One. 2011. PMID: 21826231 Free PMC article.
-
Topology Universality and Dissimilarity in a Class of Scale-Free Networks.PLoS One. 2016 Aug 25;11(8):e0161653. doi: 10.1371/journal.pone.0161653. eCollection 2016. PLoS One. 2016. PMID: 27560938 Free PMC article.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Medical