Catastrophic Forgetting and the Pseudorehearsal Solution in Hopfield-type Networks
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Pseudorehearsal is a mechanism proposed by Robins which alleviates catastrophic forgetting in multi-layer perceptron networks. In this paper, we extend the exploration of pseudorehearsal to a Hopfield-type net. The same general principles apply: old information can be rehearsed if it is available, and if it is not available, then generating and rehearsing approximations of old information that 'map' the behaviour of the network can also be effective at preserving the actual old information itself. The details of the pseudorehearsal mechanism, however, benefit from being adapted to the dynamics of Hopfield nets so as to exploit the extra attractors created in state space during learning. These attractors are usually described as 'spurious' or 'cross-talk', and regarded as undesirable, interfering with the retention of the trained population items. Our simulations have shown that, in another sense, such attractors can in fact be useful in preserving the learned population. In general terms, a solution to the catastrophic forgetting problem enables the on-going or sequential learning of information in artificial neural networks, and consequently also provides a framework for the modelling of lifelong learning/developmental effects in cognition.
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 · cited 4×
“The relaxation of a Hopfield network that has been trained with Hebbian learning, and therefore has a symmetric weight matrix, can be shown to follow the Lyapunov, or energy, function (Hopfield, 1982; Kühn, Bös, and van Hemmen, 1991):”
BackgroundMethodInfluentialA logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem
McCloskey, M., & Cohen, N. J. (1989) · Psychology of Learning and Motivation · doi:10.1016/s0079-7421(08)60536-8 · Cited by 3,770
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Catastrophic forgetting in connectionist networks
French, R. (1999) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(99)01294-2 · Cited by 2,311
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Competitive learning: From interactive activation to adaptive resonance
Grossberg, S. (1987) · Cognitive Science · doi:10.1111/j.1551-6708.1987.tb00862.x · Cited by 1,471 · cited 2×
“One consequence of a failure to address the `stability/plasticity dilemma’ (Carpenter & Grossberg, 1988; Grossberg, 1987 ) in many neural networks is excessive plasticity, usually called `catastrophic forgetting’ (or `catastrophic interference’ or the `serial learning problem’).”
BackgroundAbel, T., Nguyen, P. V., Barad, M., Deuel, T. A. S., Kandel, E. R., & Bourtchouladze, R. (1997) · Cell · doi:10.1016/s0092-8674(00)81904-2 · Cited by 1,217
Non-Holographic Associative Memory
WILLSHAW, D. J., BUNEMAN, O. P., & LONGUET-HIGGINS, H. C. (1969) · Nature · doi:10.1038/222960a0 · Cited by 979
Cited by
Catastrophic forgetting in connectionist networks
French, R. (1999) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(99)01294-2 · Cited by 2,311
Replay in Deep Learning: Current Approaches and Missing Biological Elements
Hayes, T. L., Krishnan, G. P., Bazhenov, M., Siegelmann, H. T., Sejnowski, T. J., & Kanan, C. (2021) · Neural Computation · doi:10.1162/neco_a_01433 · Cited by 106
“This mechanism is the basis of replay in computational models of attractor networks (Crick & Mitchison, 1983; Robins & McCallum, 1998, 1999).”
Long-Term Memory Stabilized by Noise-Induced Rehearsal
Wei, Y., & Koulakov, A. A. (2014) · The Journal of Neuroscience · doi:10.1523/jneurosci.3929-12.2014 · Cited by 29
Pseudopatterns and dual-network memory models: Advantages and shortcomings
French, R. M., Ans, B., & Rousset, S. (2001) · Perspectives in Neural Computing · doi:10.1007/978-1-4471-0281-6_2 · Cited by 25
Metadata
- Authors
- ROBINS, A., & McCALLUM, S.
- Venue
- Connection Science
- Publisher
- Informa UK Limited
- Published
- 1998-06
- Volume
- 10
- Issue
- 2
- Pages
- 121-135
- ISSN
- 0954-0091 (ISSN-L)
- 1360-0494
- OpenAlex
- W2128687162
- Cited by
- 46
- References
- 18
- FWCI
- 3.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Catastrophic Forgetting and the Pseudorehearsal Solution in Hopfield-type Networks. https://app.cochat.ai/papers/10.1080/095400998116530
- The paper
- ROBINS, A., & McCALLUM, S. (1998). Catastrophic Forgetting and the Pseudorehearsal Solution in Hopfield-type Networks. Connection Science. https://doi.org/10.1080/095400998116530
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.