The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
The stability-plasticity dilemma: investigating the continuum from catastrophic forgetting to age-limited learning effects
Open accessAbstract
The stability-plasticity dilemma is a well-know constraint for artificial and biological neural systems. The basic idea is that learning in a parallel and distributed system requires plasticity for the integration of new knowledge, but also stability in order to prevent the forgetting of previous knowledge. Too much plasticity will result in previously encoded data being constantly forgotten, whereas too much stability will impede the efficient coding of this data at the level of the synapses. However, for the most part, neural computation has addressed the problems related to excessive plasticity or excessive stability as two different fields in the literature.
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
A distributed, developmental model of word recognition and naming.
Seidenberg, M. S., & McClelland, J. L. (1989) · Psychological Review · doi:10.1037/0033-295x.96.4.523 · Cited by 3,909
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
Understanding normal and impaired word reading: Computational principles in quasi-regular domains.
Plaut, D. C., McClelland, J. L., Seidenberg, M. S., & Patterson, K. (1996) · Psychological Review · doi:10.1037/0033-295x.103.1.56 · Cited by 2,698 · cited 1×
“In these connectionist models, lexical frequency is encoded in the strength of the connections between the different types of representations which are involved in recognizing and producing words (Seidenberg and McClelland, 1989; Plaut et al., 1996).”
BackgroundCatastrophic forgetting in connectionist networks
French, R. (1999) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(99)01294-2 · Cited by 2,311
Ratcliff, R. (1990) · Psychological Review · doi:10.1037//0033-295x.97.2.285 · Cited by 941
Catastrophic forgetting, rehearsal and pseudorehearsal
ROBINS, A. (1995) · Connection Science · doi:10.1080/09540099550039318 · Cited by 833 · cited 2×
“There are a number of ways of overcoming this difficulty, for instance by manipulating the orthogonality or the sparseness of the input-output patterns (French, 1992; Robins, 1995).”
BackgroundFast-learning variations on back propagation: an empirical study.
Fahlman, S. E. (1989) · Medical Entomology and Zoology · Cited by 725
Ellis, A. W., & Lambon Ralph, M. A. (2000) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037//0278-7393.26.5.1103 · Cited by 406
Age of Acquisition Effects in Word Reading and Other Tasks
Zevin, J. D., & Seidenberg, M. S. (2002) · Journal of Memory and Language · doi:10.1006/jmla.2001.2834 · Cited by 374
Age-of-Acquisition Effects in Word and Picture Identification.
Juhasz, B. J. (2005) · Psychological Bulletin · doi:10.1037/0033-2909.131.5.684 · Cited by 365
Cited by
Continual lifelong learning with neural networks: A review
Parisi, G. I., Kemker, R., Part, J. L., Kanan, C., & Wermter, S. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.01.012 · Cited by 3,117
Class-Incremental Learning: Survey and Performance Evaluation on Image Classification
Masana, M., Liu, X., Twardowski, B., Menta, M., Bagdanov, A. D., & van de Weijer, J. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3213473 · Cited by 740
The Now-or-Never bottleneck: A fundamental constraint on language
Christiansen, M. H., & Chater, N. (2016) · Behavioral and Brain Sciences · doi:10.1017/s0140525x1500031x · Cited by 733
Lesort, T., Lomonaco, V., Stoian, A., Maltoni, D., Filliat, D., & Díaz-Rodríguez, N. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.12.004 · Cited by 506
Online continual learning in image classification: An empirical survey
Mai, Z., Li, R., Jeong, J., Quispe, D., Kim, H., & Sanner, S. (2022) · Neurocomputing · doi:10.1016/j.neucom.2021.10.021 · Cited by 410
Škrjanc, I., Iglesias, J. A., Sanchis, A., Leite, D., Lughofer, E., & Gomide, F. (2019) · Information Sciences · doi:10.1016/j.ins.2019.03.060 · Cited by 330
Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“…in theory be solved with meta-learning and neuromodulation is catastrophic forgetting, a phenomenon wherein neural networks are unable to continuously learn because they learn each newly encountered task by overwriting their knowledge of how to solve all previously learned tasks [47, 111, 48].”
BackgroundMultimodal Parameter-Efficient Few-Shot Class Incremental Learning
D’Alessandro, M., Alonso, A., Calabrés, E., & Galar, M. (2023) · 2023 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW) · doi:10.1109/iccvw60793.2023.00364 · Cited by 40
Data Augmented Flatness-aware Gradient Projection for Continual Learning
Yang, E., Shen, L., Wang, Z., Liu, S., Guo, G., & Wang, X. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00518 · Cited by 18
Rudroff, T., Rainio, O., & Klén, R. (2024) · Brain Sciences · doi:10.3390/brainsci14111111 · Cited by 11
Metadata
- Authors
- Mermillod, M., Bugaiska, A., & Bonin, P.
- Venue
- Frontiers in Psychology
- Publisher
- Frontiers Media SA
- Published
- 2013
- Volume
- 4
- Pages
- 504-504
- ISSN
- 1664-1078 (ISSN-L)
- OpenAlex
- W2037979274
- Cited by
- 424
- References
- 25
- FWCI
- 1.85
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.