Paper · 2018-02-21 · cs.LG, q-bio.NC, stat.ML

Continual Lifelong Learning with Neural Networks: A Review

German I. Parisi, Ronald Kemker, Jose L. Part et al.

Review of catastrophic forgetting in neural networks and of biological lifelong learning. Groups fixes into regularization (LwF, EWC, SI), dynamic architectures (progressive networks, growing self-organizing maps) and replay with complementary memories. No new experiments; headline comparisons are qualitative and taken from cited work.

Continual learning Experience replay Dynamic network expansion Transfer learningcontinual-learningcatastrophic-forgettingsurveyregularizationdynamic-architecturesexperience-replay

arXiv PDF Markdown8 min read

AI-compiled by claude-haiku-5-5 on 2026-10-24, not yet reviewed by a human. Every claim cites its source; check it when a detail matters.

In plain words

Neural networks forget. Train one on a task, then train it on another, and the second round often wipes out much of what the first one taught it. Researchers call this catastrophic forgetting. People and animals keep learning new skills throughout life without this kind of collapse, so closing that gap matters for AI systems that must learn from a continuous stream of data.

This review surveys how researchers have tried. The ideas fall into a few families. Some protect the weights that mattered for an old task, so changing them costs more. Some grow the network when new information arrives, adding capacity instead of overwriting it. Some keep a memory of past experience, either stored examples or generated ones, and replay it while learning something new. Several of these ideas are borrowed from how the brain consolidates memories: a fast store that learns individual episodes and a slow store that learns general structure.

The paper is a review, so it runs no new experiments of its own. Its value is the map of approaches, the comparisons it collects, and its argument that today's methods, mostly trained on labelled data, are still far from what autonomous agents need.

TL;DR

Review, with no new experiments, of catastrophic forgetting in neural networks and of the biological mechanisms that inspire lifelong learning. It groups existing fixes into regularization (LwF, EWC, SI), dynamic architectures (progressive networks, growing self-organizing maps) and replay with complementary memories §3.2–3.4. The comparisons it reports are qualitative and come from cited work. It concludes that benchmarks and metrics lack consensus and that current methods are mostly supervised and not yet suited to autonomous agents §3.5 §5.

Problem

Models trained on a non-stationary stream overwrite earlier knowledge. The performance on old tasks can drop abruptly, and in the worst case the old knowledge is completely overwritten §1.
Retraining from scratch on all data avoids forgetting but is inefficient and blocks learning in real time §1.
The number of tasks and samples cannot be known in advance, so a fixed network size is hard to choose without strong assumptions about the input §3.1.
Replay methods need explicit storage of old data, which raises memory use. Growing networks raises computation and can scale poorly §3.1.
Most surveyed methods assume supervised learning on annotated, finite datasets. Unsupervised lifelong learning is mostly done with self-organizing networks §1.

Method

The paper proposes no new algorithm. It organises existing approaches into families and writes the update rules of the ones it discusses. Biological sections are background; the implementable parts are §3.2 to §3.4.

Neuro-inspired plasticity (background). Plain Hebbian learning updates a weight from pre- and post-synaptic activity. A modulatory signal can gate the update §2.2 eq. 1 eq. 2. Homeostatic feedback must be fast relative to the Hebbian dynamics it stabilises §2.2.

$\Delta w = x \cdot y \cdot \eta$ eq. 1

$\Delta w = m \cdot x \cdot y \cdot \eta$ eq. 2
Complementary learning systems (background). A fast, sparse, episodic store, the hippocampus, feeds a slow, overlapping, general store, the neocortex. Replay from the fast store consolidates into the slow one §2.3 fig. 1.
Regularization (§3.2). Penalise changes to the network's function or weights that matter for old tasks.
- Learning without Forgetting (LwF). Keep the old-task outputs on new data close to their recorded values, using a distillation-style term. The objective is given in eq. 3. The review notes the cost grows with the number of tasks and that the method needs persistent data per task §3.2.
  
  $\theta^*_s,\theta^*_o,\theta^*_n \leftarrow \arg\min_{\hat\theta_s,\hat\theta_o,\hat\theta_n} \left( \lambda_o \mathcal{L}_{old}(Y_o,\hat{Y}_o) + \mathcal{L}_{new}(Y_n,\hat{Y}_n) + \mathcal{R}(\hat\theta_s,\hat\theta_o,\hat\theta_n) \right)$ eq. 3
- Elastic Weight Consolidation (EWC). Approximate the posterior over old weights as a Gaussian with mean θ*_A and diagonal precision F, the diagonal Fisher information §3.2. The start is the Bayes decomposition in eq. 4. The resulting loss is eq. 5. The review says the Fisher diagonal is computed offline and that this limits use to low-dimensional outputs §3.2.
  
  $\log p(\theta \mid \mathcal{D}) = \log p(\mathcal{D}_B \mid \theta) + \log p(\theta \mid \mathcal{D}_A) - \log p(\mathcal{D}_B)$ eq. 4
  
  $\mathcal{L}(\theta) = \mathcal{L}_B(\theta) + \sum_i \frac{\lambda}{2} F_i (\theta_i - \theta^*_{A,i})^2$ eq. 5
  Pseudocode
```
# EWC training on task B (quadratic penalty)  [§3.2] [eq. 5]
# Input:  params (θ), old_params (θ*_A), fisher (diagonal F),
#         batches of task-B data, penalty strength lam (λ)
# Output: params trained on task B

def train_task_b(params, old_params, fisher, batches, lam):
    for batch in batches:
        # Loss on the new task only; no old data is replayed  [§3.2]
        new_loss = task_loss(params, batch)
        # Penalise moving weights that mattered for task A  [§3.2] [eq. 5]
        penalty = sum(
            lam / 2 * f * (p - p_old) ** 2
            for p, p_old, f in zip(params, old_params, fisher)
        )
        params = gradient_step(params, new_loss + penalty)
    return params
```
- Synaptic Intelligence (SI, Zenke et al.). Each synapse estimates its own importance online over the whole learning trajectory. The modified loss is eq. 6 §3.2.
  
  $\mathcal{L}^*_n = \mathcal{L}_n + c \sum_k \Omega^n_k (\theta^*_k - \theta_k)^2$ eq. 6
Dynamic architectures (§3.3). Add capacity for new knowledge and freeze what was learned.
- Progressive networks. Freeze the networks of earlier tasks and add a new sub-network per task with lateral connections to the old ones §3.3.
- Growing self-organizing networks (GWR-style, Parisi et al.). Find the best matching unit with eq. 7 and update it with eq. 8. New neurons are inserted when a habituated neuron's activity falls below a threshold. The habituation counter h_i scales the update, so well-learned units change less §3.3.
  
  $b = \arg\min_{j\in N} \left( \alpha_0 \Vert \mathbf{x}(t) - \mathbf{w}_j \Vert^2 + \sum_{k=1}^{K} \alpha_k \Vert \mathbf{C}_k(t) - \mathbf{c}_{j,k} \Vert^2 \right)$ eq. 7
  
  $\Delta \mathbf{w}_i = \epsilon_i \cdot h_i \cdot (\mathbf{x}(t) - \mathbf{w}_i)$ eq. 8
- Other entries are described in prose only: dynamically expanding networks with group-sparse selection of new units, denoising autoencoders that add and merge neurons, and ART-style models with a vigilance parameter §3.3.
Replay and complementary memories (§3.4). Interleave old knowledge with new data.
- Rehearsal. Store raw old examples and mix them into new training §3.1 §3.4.
- Pseudo-rehearsal. Draw pseudo-samples from a generative model instead of storing data. Shin et al. use a deep generative model plus a task solver §3.4.
- Dual-memory models. Fast episodic and slow semantic modules. Examples are GeppNet+STM §3.4, FearNet §3.4, and a dual-memory self-organizing architecture for video §3.4.
Evaluation protocols (§3.5). Three benchmark experiments from Kemker et al.: data permutation, incremental class learning and multimodal learning §3.5. Forward and backward transfer are defined as the influence of an earlier task on a later one, and the reverse, with sign indicating positive or negative transfer §3.5.

The review also describes the CORe50 scenarios: new instances (NI), new classes (NC), and new instances plus classes (NIC) §3.5 fig. 3.

Hyperparameters

The review states no training settings of its own. The entries below are the method-level parameters it names, with their values as stated.

Name	Value	Where	Notes
λ_o (LwF old-task weight)	not stated	§3.2 eq. 3	"balances new/old tasks"; no value
λ (EWC penalty strength)	not stated	§3.2 eq. 5	no value or selection rule
c (SI weight)	not stated	§3.2 eq. 6	no value
Ω^n_k (SI importance)	not stated	§3.2 eq. 6	"computed online"; update rule not given
Fisher diagonal F	not stated	§3.2 eq. 5	how it is estimated is not described
α_0 … α_K (GWR/SOM weights)	constant, values not stated	§3.3 eq. 7	modulate input vs context
ε_i (GWR learning rate)	constant, value not stated	§3.3 eq. 8
GWR activation threshold	not stated	§3.3	sets when new neurons are inserted
ART vigilance	not stated	§3.3	sets granularity of memories
Benchmark training settings	not stated	§3.5	not in this review; in the cited experiments

Results

Reported by the review from cited work; author-reported. The review contains no numeric tables and reports no new experiments. All comparisons are qualitative. Setup: MNIST, CUB-200, AudioSet (Kemker et al. benchmarks), CORe50, and iCIFAR-100, with baselines as listed in the table §3.5 fig. 4.

Setting	Metric	Baseline	Reported result	Source
Data permutation (MNIST, CUB-200, AudioSet)	accuracy, qualitative	MLP, EWC, PathNet, GeppNet, GeppNet+STM, FEL	Best: PathNet, then EWC §3.5	§3.5
Multimodal (image then audio)	accuracy, qualitative	same as above	EWC does better than PathNet, attributed to separating dissimilar data §3.5	§3.5
Incremental class learning (MNIST, CUB-200, AudioSet)	mean-class test accuracy	same as above	Best: GeppNet+STM; curves in fig. 4	§3.5 fig. 4
CORe50 NI / NC / NIC	accuracy	NI as reference	EWC and LwF do significantly worse in NC and NIC than NI	§3.5
CORe50 and iCIFAR-100 (AR1)	forgetting, qualitative	LwF, EWC, SI	AR1 forgets less and outperforms all three; cited from Lomonaco et al.	§3.2
CORe50, three incremental tasks	qualitative	prior lifelong learning methods	Self-organizing dual-memory model significantly outperforms them	§3.4
Weizmann and KTH action benchmarks	qualitative	batch learning	Growing self-organizing network is competitive with batch learning	§3.3
Additive neurogenesis vs static net, same neuron count	qualitative	static network	Neurogenesis performs better	§3.3
Permutation tasks, GeppNet+STM vs EWC	qualitative	EWC	GeppNet+STM performs significantly worse	§3.4

Paper vs code

No official code. The paper links no repository or project page. Searches: the arXiv source for URLs (none); a GitHub repository search for the title words (no results); a GitHub search within the authors' lab organisation (knowledgetechnologyuhh, no results). It is a review, so there is no implementation to compare with.

Pitfalls

No numbers in the text. Every result is qualitative or sits in figures (Fig. 4) and in the cited works. An implementer must go to the original papers for values, settings and seeds.
Wrong cross-references in the introduction. The introduction points to the complementary learning systems in "Section 2.4" §1. The subsection is 2.3 §2.3; §2.4 is learning without forgetting. The plasticity reference "Sec. 2.2 and 2.3" §1 matches §2.2 and §2.3.
Equations are the review's notation. Eq. 3 leaves the old-task loss L_old and the regularizer R unspecified §3.2. Eq. 4 is a Bayes decomposition, and the Gaussian approximation step is described in prose only §3.2. Eq. 6 uses Ω without giving how it is computed §3.2.
EWC's Fisher estimate is not stated. The review only says it is diagonal, taken offline, and limits EWC to low-dimensional outputs §3.2. Estimation details must come from the EWC paper, which this card does not cover.
The GWR update reuses the modulated-Hebbian form. Eq. 8 uses h_i as the modulatory factor "see Eq. 2" §3.3. The review gives no learning rate, no activation threshold and no insertion rule beyond the prose description.
Ranking statements are benchmark-specific. The review notes that EWC and PathNet change order between data-permutation and multimodal experiments §3.5. Do not generalise either ranking.
Rehearsal versus pseudo-rehearsal. The review's best incremental result uses rehearsal with storage of raw examples, yet it recommends pseudo-rehearsal for future work §3.5. This is a recommendation, not a measured result.
Some claims are about neuroscience. The biological sections cite experiments on infants, animals and adults §2. This card does not verify them.
Figures 1, 3 and 4 are credited to other papers ("adapted with permission" in their captions) fig. 1 fig. 3 fig. 4. Under the licensing rules, figures are not used here.

Lineage

Builds on: earlier surveys of catastrophic forgetting in connectionist models (French 1999; Goodfellow et al. 2013; Soltoggio et al. 2017). This review adds recent experimental comparisons and evaluation guidelines §1.
Compared against: LwF, EWC, SI, PathNet, progressive networks, FEL, GeppNet and GeppNet+STM, GEM, FearNet, AR1, and the author's GWR and dual-memory models §3.2–3.5.
Superseded by: not applicable (no later version in this wiki).

Source and license

Adapted from “Continual Lifelong Learning with Neural Networks: A Review” by German I. Parisi, Ronald Kemker, Jose L. Part, Christopher Kanan, Stefan Wermter (arXiv:1802.07569), used under CC BY-SA 4.0. Changes: condensed and restructured for implementation, with tables, equations and algorithms taken from the paper and its code, each cited to its source. Not affiliated with or endorsed by the authors. This page is licensed under CC BY-SA 4.0.