Continual learning

Retention and adaptation remain active researchEvidence checked

Subjects: Machine learning

Collections: Learning and intelligence

Reading depth

The problem

A digit reader learns handwriting, then trains on printed digits. Will it still read handwriting after the update? In an invented test, it gets 18 of 20 handwritten digits right before the update and 14 afterward, while getting 16 of 20 printed digits right. New learning and lost old skill are different measurements. Continual learning asks how to acquire new abilities while keeping useful earlier ones, with limits on stored examples, model size and computation. A method that stores and repeatedly studies its entire history avoids one resource constraint by spending more resources.[1]

Scope

Retention and adaptation across changing task or data streams, with stated limits on replay storage, model growth and training cost.

What remains open

Methods work in particular settings; dependable retention and adaptation across specified changes remain incomplete.[1]

Why it matters

A reader that learns new fonts but loses familiar handwriting makes each update a tradeoff for its users. Keeping every past example and retraining from the beginning also becomes costly as the history grows. Understanding retention would let an updating system accumulate useful skills within a stated budget, and reveal when an apparent improvement simply spends more memory or computation.[1]

Definitions

2 terms
Replay

Saving some earlier training examples and using them again during later updates. Storage and repeated training cost count toward the continual-learning budget.[1]

Catastrophic forgetting

A severe decline in performance on earlier tasks after learning later ones. Retention must be assessed on a specified earlier task population, separately from success on the new task.[1] [2]

Sources

Partial results
Hossein Taheri, Avishek Ghosh and Arya Mazumdar

Bounds on forgetting under a specified learning model Scope: A one-hidden-layer quadratic network learning structured Gaussian-cluster tasks.

The assumptions do not cover arbitrary task streams or contemporary large models.

Source date: 2026-07Refereed theoretical analysis with numerical experiments.Read the source ↗
  1. A Comprehensive Survey of Continual Learning: Theory, Method and Application Liyuan Wang, Xingxing Zhang, Hang Su and Jun Zhu · 2023-01-31
    Notes on A Comprehensive Survey of Continual Learning: Theory, Method and Application

    Selected survey definitions cover task streams, retention measures, replay and resource costs.

  2. On the Theory of Continual Learning with Gradient Descent for Neural Networks Hossein Taheri, Avishek Ghosh and Arya Mazumdar · 2026-07
    Notes on On the Theory of Continual Learning with Gradient Descent for Neural Networks

    Published abstract and separately read author preprint give restricted architecture and task assumptions; no universal guarantee.

Suggest a correction