Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Curti, E.
Right arrow Articles by Amit, D. J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Curti, E.
Right arrow Articles by Amit, D. J.
(Neural Computation. 2004;16:2597-2637.)
© 2004 The MIT Press


Letter

Mean Field and Capacity in Realistic Networks of Spiking Neurons Storing Sparsely Coded Random Memories

Emanuele Curti

curti{at}titanus.roma1.infn.it, INFM, Dipartimento di Fisica, Universitá di Roma La Sapienza, 00185 Rome, Italy

Gianluigi Mongillo

mongillo{at}surete3.roma1.infn.it, Dipartimento di Fisiologia Umana, Universitá di Roma La Sapienza, 00185 Rome, Italy

Giancarlo La Camera

lacamera{at}cns.unibe.ch, Institute of Physiology, University of Bern, 3012 Bern, Switzerland

Daniel J. Amit

daniel.amit{at}roma1.infn.it, INFM, Dipartimento di Fisica, Universitá di Roma La Sapienza, 00185 Rome, Italy, and Racah Institute of Physics, Hebrew University, Jerusalem, Israel

Mean-field (MF) theory is extended to realistic networks of spiking neurons storing in synaptic couplings of randomly chosen stimuli of a given low coding level. The underlying synaptic matrix is the result of a generic, slow, long-term synaptic plasticity of two-state synapses, upon repeated presentation of the fixed set of the stimuli to be stored. The neural populations subtending the MF description are classified by the number of stimuli to which their neurons are responsive (multiplicity). This involves 2p+1 populations for a network storing p memories. The computational complexity of the MF description is then significantly reduced by observing that at low coding levels (f), only a few populations remain relevant: the population of mean multiplicity – pf and those of multiplicity of order around the mean.

The theory is used to produce (predict) bifurcation diagrams (the onset of selective delay activity and the rates in its various stationary states) and to compute the storage capacity of the network (the maximal number of single items used in training for each of which the network can sustain a persistent, selective activity state). This is done in various regions of the space of constitutive parameters for the neurons and for the learning process. The capacity is computed in MF versus potentiation amplitude, ratio of potentiation to depression probability and coding level f. The MF results compare well with recordings of delay activity rate distributions in simulations of the underlying microscopic network of 10,000 neurons.




This article has been cited by other articles:


Home page
Learn. Mem.Home page
L. de Almeida, M. Idiart, and J. E. Lisman
Memory retrieval time and memory capacity of the CA3 network: Role of gamma frequency oscillations
Learn. Mem., November 15, 2007; 14(11): 795 - 806.
[Abstract] [Full Text] [PDF]


Home page
Cereb CortexHome page
M. R. Warden and E. K. Miller
The Representation of Multiple Objects in Prefrontal Neuronal Delay Activity
Cereb Cortex, September 1, 2007; 17(suppl_1): i41 - i50.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2004 by The MIT Press.