Full solution for the storage of correlated memories in an autoassociative memory
| dc.creator | Kropff, Emilio | |
| dc.date | 2007-07-20 | |
| dc.date.accessioned | 2026-07-07T08:19:24Z | |
| dc.date.available | 2026-07-07T08:19:24Z | |
| dc.description | We complement our previous work [arxiv: 0707.0565] with the full (non diluted) solution describing the stable states of an attractor network that stores correlated patterns of activity. The new solution provides a good fit of simulations of a network storing the feature norms of McRae and colleagues [McRae et al, 2005], experimentally obtained combinations of features representing concepts in semantic memory. We discuss three ways to improve the storage capacity of the network: adding uninformative neurons, removing informative neurons and introducing popularity-modulated hebbian learning. We show that if the strength of synapses is modulated by an exponential decay of the popularity of the pre-synaptic neuron, any distribution of patterns can be stored and retrieved with approximately an optimal storage capacity - i.e, C ~ I.p, the minimum number of connections per neuron needed to sustain the retrieval of a pattern is proportional to the information content of the pattern multiplied by the number of patterns stored in the network. | |
| dc.description | Manuscript to appear in the proceedings of the international meeting "Closing the gap between neurophysiology and behaviour: A computational modelling approach", Birmingham, March 2007 | |
| dc.identifier | https://arxiv.org/abs/0707.3066 | |
| dc.identifier | http://arxiv.org/abs/0707.3066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134748 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Other Condensed Matter | |
| dc.title | Full solution for the storage of correlated memories in an autoassociative memory | |
| dc.type | text |