Continual / Methods
verifiedExperience Replay
Keep a small sample of old data and mix it into every batch. It is the least clever method in continual learning and the one that usually wins, which is worth sitting with rather than explaining away. A few percent of the original data recovers most of what would otherwise be lost.
It also assumes you are allowed to store the data, which privacy and licensing frequently forbid — and that constraint, not accuracy, is why the other families exist. Generative replay substitutes samples from a model of the old data and inherits that model's failures, which compound over a long sequence in the same way synthetic data does.
Minimise the new task's loss plus the loss on a stored subset, which is a sampled approximation to the joint objective the problem actually wants. Because it approximates the true objective directly rather than through a proxy on parameters, its error falls with buffer size in a way regularisation penalties have no equivalent of — which is the cleanest explanation for why it wins.
replayed holds 13% of the budget; rest holds the remaining 87%.
Stored examples from earlier tasks against new-task examples in the batch, in examples. Drag the replay up to watch forgetting stop — and note how far left it can sit and still work.
Reviewed by opendroid · 2026-08-18
- arXiv:1706.08840 — Gradient Episodic Memory for Continual Learning