Slow stochastic Hebbian learning of classes of stimuli in a recurrent neural network
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We study unsupervised Hebbian learning in a recurrent network in which synapses have a finite number of stable states. Stimuli received by the network are drawn at random at each presentation from a set of classes. Each class is defined as a cluster in stimulus space, centred on the class prototype. The presentation protocol is chosen to mimic the protocols of visual memory experiments in which a set of stimuli is presented repeatedly in a random way. The statistics of the input stream may be stationary, or changing. Each stimulus induces, in a stochastic way, transitions between stable synaptic states. Learning dynamics is studied analytically in the slow learning limit, in which a given stimulus has to be presented many times before it is memorized, i.e. before synaptic modifications enable a pattern of activity correlated with the stimulus to become an attractor of the recurrent network. We show that in this limit the synaptic matrix becomes more correlated with the class prototypes than with any of the instances of the class. We also show that the number of classes that can be learned increases sharply when the coding level decreases, and determine the speeds of learning and forgetting of classes in the case of changes in the statistics of the input stream.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
The Organization of Behavior; A Neuropsychological Theory.
Attneave, F., B., M., & Hebb, D. O. (1950) · The American Journal of Psychology · doi:10.2307/1418888 · Cited by 5,146
Bienenstock, E., Cooper, L., & Munro, P. (1982) · The Journal of Neuroscience · doi:10.1523/jneurosci.02-01-00032.1982 · Cited by 2,896 · cited 1×
“…of learning `rules', specifying how activity and training experience change synaptice cacies, have been proposed (Hebb 1949, Sejnowski 1977, Bienenstock et al 1982), and suchlearning rules have been essential for the construction of most models of associative memory(Hop eld 1982, Amit…”
BackgroundSimple memory: a theory for archicortex
Marr, D. (1971) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1971.0078 · Cited by 2,771 · cited 1×
“For example, it has beenhypothesized that hippocampus serves as a short-, or intermediate- term memory storage(e.g. Marr 1971, Rolls 1990).”
BackgroundNon-Holographic Associative Memory
WILLSHAW, D. J., BUNEMAN, O. P., & LONGUET-HIGGINS, H. C. (1969) · Nature · doi:10.1038/222960a0 · Cited by 979 · cited 3×
“If q f the system becomes useless as a memory device since most synapses will become potentiated, as in the Willshaw model above its critical capacity ( Willshaw et al 1969 ).”
BackgroundInfluentialStoring covariance with nonlinearly interacting neurons
Sejnowski, T. J. (1977) · Journal of Mathematical Biology · doi:10.1007/bf00275079 · Cited by 546
Cited by
Brunel, N., & Wang, X.-J. (2001) · Journal of Computational Neuroscience · doi:10.1023/a:1011204814320 · Cited by 620
Self-citationBrunel, N., & Wang, X.-J. (2014) · Journal of Computational Neuroscience · doi:10.1007/s10827-014-0506-8 · Cited by 536
Self-citationLearning Real-World Stimuli in a Neural Network with Spike-Driven Synaptic Dynamics
Brader, J. M., Senn, W., & Fusi, S. (2007) · Neural Computation · doi:10.1162/neco.2007.19.11.2881 · Cited by 371
Self-citationFusi, S., Asaad, W. F., Miller, E. K., & Wang, X.-J. (2007) · Neuron · doi:10.1016/j.neuron.2007.03.017 · Cited by 199
Self-citationZhang, Y., Li, P., Jin, Y., & Choe, Y. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2388544 · Cited by 178
Metadata
- Authors
- Brunel, N., Carusi, F., & Fusi, S.
- Venue
- Network: Computation in Neural Systems
- Publisher
- Informa UK Limited
- Published
- 1998-02-01
- Volume
- 9
- Issue
- 1
- Pages
- 123-152
- ISSN
- 0954-898X (ISSN-L)
- 1361-6536
- OpenAlex
- W2002249797
- Cited by
- 78
- References
- 6
- FWCI
- 5.69
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Slow stochastic Hebbian learning of classes of stimuli in a recurrent neural network. https://app.cochat.ai/papers/10.1088/0954-898x/9/1/007
- The paper
- Brunel, N., Carusi, F., & Fusi, S. (1998). Slow stochastic Hebbian learning of classes of stimuli in a recurrent neural network. Network: Computation in Neural Systems. https://doi.org/10.1088/0954-898x/9/1/007
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.