CoChat

Catastrophic Forgetting and the Pseudorehearsal Solution in Hopfield-type Networks

Open access
ROBINS, ANTHONY, McCALLUM, SIMON · 1998 · Connection Science
Cited by 46

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/095400998116530

Cites

18 of 18 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 18 references

Cited by

See all 46

Metadata

Authors
ROBINS, A., & McCALLUM, S.
Venue
Connection Science
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.