Forget Forgetting: Continual Learning in a World of Abundant Memory
Dongkyu Cho, Taesup Moon, Rumi Chunara, Kyunghyun Cho, Sungmin Cha
TL;DR
This work argues that in real-world continual learning, exemplar memory is no longer the primary bottleneck; GPU time dominates, motivating a regime of abundant-but-not-exhaustive memory. It shows that while increased memory reduces forgetting (stability), it simultaneously reduces plasticity due to gradient reuse, necessitating cost-efficient interventions. The authors introduce Weight Space Consolidation, a lightweight method that combines rank-based parameter resets with weight averaging to restore plasticity while preserving stability, without storing per-task models. Empirical results across class-incremental image benchmarks and continual instruction tuning for LLMs demonstrate strong accuracy with replay-like costs and substantial reductions (3–4×) compared with expansion-based methods. Altogether, the paper challenges traditional CL assumptions and provides a practical baseline for scalable, cost-efficient continual learning in modern deployments.
Abstract
Continual learning (CL) has traditionally focused on minimizing exemplar memory, a constraint often misaligned with modern systems where GPU time, not storage, is the primary bottleneck. This paper challenges this paradigm by investigating a more realistic regime: one where memory is abundant enough to mitigate forgetting, but full retraining from scratch remains prohibitively expensive. In this practical "middle ground", we find that the core challenge shifts from stability to plasticity, as models become biased toward prior tasks and struggle to learn new ones. Conversely, improved stability allows simple replay baselines to outperform the state-of-the-art methods at a fraction of the GPU cost. To address this newly surfaced trade-off, we propose Weight Space Consolidation, a lightweight method that combines (1) rank-based parameter resets to restore plasticity with (2) weight averaging to enhance stability. Validated on both class-incremental learning with image classifiers and continual instruction tuning with large language models, our approach outperforms strong baselines while matching the low computational cost of replay, offering a scalable alternative to expensive full-retraining. These findings challenge long-standing CL assumptions and establish a new, cost-efficient baseline for real-world CL systems where exemplar memory is no longer the limiting factor.
