mlsanityData to 14 Oct 2026

Forget Forgetting: Continual Learning in a World of Abundant Memory

arXiv 2502.07274 ↗First posted 11 Feb 2025cs.LG cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 64 of its 83 references that are in the map. First posted on arXiv 11 Feb 2025.

Builds on

64 of 83 references.

References · 64

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  5. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  6. 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
  7. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  8. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  9. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  10. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  11. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  12. 2022Editing Models with Task Arithmeticcited by 1,120
38 more
  1. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  2. 2018Experience Replay for Continual Learningcited by 1,095
  3. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  4. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  5. 2021CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generationcited by 744
  6. 2019Large Scale Incremental Learningcited by 732
  7. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  8. 2019Three scenarios for continual learningcited by 614
  9. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  10. 2018Rethinking the Value of Network Pruningcited by 599
  11. 2019Importance Estimation for Neural Network Pruningcited by 541
  12. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 449
  13. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  14. 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 283
  15. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
  16. 2022FOSTER: Feature Boosting and Compression for Class-Incremental Learningcited by 229
  17. 2023Class-Incremental Learning: A Surveycited by 209
  18. 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 154
  19. 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
  20. 2022NumGLUE: A Suite of Fundamental yet Challenging Mathematical Reasoning Taskscited by 112
  21. 2019Continual Learning via Neural Pruningcited by 101
  22. 2018Adapting Auxiliary Losses Using Gradient Similaritycited by 100
  23. 2024Model Stock: All we need is just a few fine-tuned modelscited by 92
  24. 2023MeetingBank: A Benchmark Dataset for Meeting Summarizationcited by 84
  25. 2021PyCIL: A Python Toolbox for Class-Incremental Learningcited by 83
  26. 2023Trillion Dollar Words: A New Financial Dataset, Task & Market Analysiscited by 75
  27. 2020Imbalanced Continual Learning with Partitioning Reservoir Samplingcited by 72
  28. 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
  29. 2023TRACE: A Comprehensive Benchmark for Continual Learning in Large Language Modelscited by 66
  30. 2020CPR: Classifier-Projection Regularization for Continual Learningcited by 62
  31. 2023Computationally Budgeted Continual Learning: What Does Matter?cited by 61
  32. 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
  33. 2021Hessian-Aware Pruning and Optimal Neural Implantcited by 45
  34. 2024Spherical Linear Interpolation and Text-Anchoring for Zero-shot Composed Image Retrievalcited by 44
  35. 2023Weighted Ensemble Models Are Strong Continual Learnerscited by 42
  36. 2023Some Fundamental Aspects about Lipschitz Continuity of Neural Networkscited by 26
  37. 2023How Efficient Are Today's Continual Learning Algorithms?cited by 24
  38. 2024A Practitioner's Guide to Continual Multimodal Pretrainingcited by 23

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 10.

11 papers.