mlsanityData to 7 Oct 2026

Soup to go: mitigating forgetting during continual learning with model averaging

arXiv 2501.05559 ↗First posted 9 Jan 2025cs.LG cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

In continual learning, where task data arrives in a sequence, fine-tuning on later tasks will often lead to performance degradation on earlier tasks. This is especially pronounced when these tasks come from diverse domains. In this setting, how can we mitigate catastrophic forgetting of earlier tasks and retain what the model has learned with minimal computational expenses? Inspired by other merging methods, and L2-regression, we propose Sequential Fine-tuning with Averaging (SFA), a method that merges currently training models with earlier checkpoints during the course of training. SOTA approaches typically maintain a data buffer of past tasks or impose a penalty at each gradient step. In contrast, our method achieves comparable results without the need to store past data, or multiple copies of parameters for each gradient step. Furthermore, our method outperforms common merging techniques such as Task Arithmetic, TIES Merging, and WiSE-FT, as well as other penalty methods like L2 and Elastic Weight Consolidation. In turn, our method offers insight into the benefits of merging partially-trained models during training across both image and language domains.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 9 Jan 2025.

Builds on

27 of 41 references.

References · 27

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  4. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  5. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  6. 2017Continual Learning with Deep Generative Replaycited by 1,152
  7. 2021Robust fine-tuning of zero-shot modelscited by 785
  8. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  9. 2023An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 622
  10. 2021Merging Models with Fisher-Weighted Averagingcited by 613
  11. 2019ELI5: Long Form Question Answeringcited by 567
  12. 2015A Neural Attention Model for Abstractive Sentence Summarizationcited by 394
15 more
  1. 2022Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Modelscited by 218
  2. 2021When Does Pretraining Help? Assessing Self-Supervised Learning for Law and the CaseHOLD Datasetcited by 199
  3. 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 189
  4. 2019Episodic Memory in Lifelong Language Learningcited by 188
  5. 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 187
  6. 2022Fine-tuned Language Models are Continual Learnerscited by 152
  7. 2022Measuring Forgetting of Memorized Training Examplescited by 118
  8. 2020A Comprehensive Study of Class Incremental Learning Algorithms for Visual Taskscited by 107
  9. 2020Neural CRF Model for Sentence Alignment in Text Simplificationcited by 106
  10. 2022Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalizationcited by 97
  11. 2018CLAUDETTE: an Automated Detector of Potentially Unfair Clauses in Online Terms of Servicecited by 72
  12. 2022Challenging Common Assumptions about Catastrophic Forgettingcited by 20
  13. 2016Online Contrastive Divergence with Generative Replay: Experience Replay without Storing Datacited by 9
  14. 2024Towards Continual Learning Desiderata via HSIC-Bottleneck Orthogonalization and Equiangular Embeddingcited by 9
  15. 2023Leveraging Function Space Aggregation for Federated Learning at Scalecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 5; 2026: 6.

11 papers.