mlsanityData to 7 Oct 2026

Merge before Forget: A Single LoRA Continual Learning via Continual Merging

arXiv 2512.23017 ↗First posted 28 Dec 2025cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient continual learning has emerged as a promising approach for large language models (LLMs) to mitigate catastrophic forgetting while enabling adaptation to new tasks. Current Low-Rank Adaptation (LoRA) continual learning techniques often retain and freeze previously learned LoRAs or generate data representations to overcome forgetting, typically utilizing these to support new LoRAs learn new tasks. However, these methods not only ignore growing computational memory with tasks and limited storage space but also suffer from potential task interference due to the lack of effective LoRA merging mechanisms. In this paper, we propose a novel continual learning method that orthogonally initializes and sequentially merges LoRAs updates into a single unified LoRA. Our method leverages orthogonal basis extraction from previously learned LoRA to initialize the learning of new tasks, further exploits the intrinsic asymmetry property of LoRA components by using a time-aware scaling mechanism to balance new and old knowledge during continual merging. Our approach maintains constant memory complexity with respect to the number of tasks, minimizes interference between past and new tasks via orthogonal basis initialization, and improves performance over asymmetric LoRA merging via adaptive scaling. We provide theoretical analysis to justify our design and conduct extensive experiments across diverse continual learning benchmarks using various Llama models, demonstrating the effectiveness and efficiency of our method.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 49 of its 51 references that are in the map. First posted on arXiv 28 Dec 2025.

Builds on

49 of 51 references.

References · 49

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  5. 2024Qwen2.5 Technical Reportcited by 4,713
  6. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  7. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  8. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  9. 2022Editing Models with Task Arithmeticcited by 1,076
  10. 2018Experience Replay for Continual Learningcited by 1,074
  11. 2021Learning to Prompt for Continual Learningcited by 938
  12. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
37 more
  1. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  2. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  3. 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
  4. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  5. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  6. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  7. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
  8. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
  9. 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
  10. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  11. 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 218
  12. 2023Progressive Prompts: Continual Learning for Language Modelscited by 195
  13. 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
  14. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  15. 2024Improving LoRA in Privacy-preserving Federated Learningcited by 158
  16. 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 155
  17. 2016A vector-contraction inequality for Rademacher complexitiescited by 141
  18. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
  19. 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
  20. 2022A Kernel-Based View of Language Model Fine-Tuningcited by 118
  21. 2024Model merging with SVD to tie the Knotscited by 118
  22. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
  23. 2024Asymmetry in Low-Rank Adapters of Foundation Modelscited by 81
  24. 2020Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networkscited by 73
  25. 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
  26. 2023Parameter Efficient Multi-task Model Fusion with Partial Linearizationcited by 64
  27. 2025SD-LoRA: Scalable Decoupled Low-Rank Adaptation for Class Incremental Learningcited by 60
  28. 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
  29. 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 58
  30. 2024Model Tailor: Mitigating Catastrophic Forgetting in Multi-modal Large Language Modelscited by 54
  31. 2024LoRA Training in the NTK Regime has No Spurious Local Minimacited by 48
  32. 2024CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuningcited by 41
  33. 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
  34. 2024SAPT: A Shared Attention Framework for Parameter-Efficient Continual Learning of Large Language Modelscited by 37
  35. 2025Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Mergingcited by 25
  36. 2023Fixed Design Analysis of Regularization-Based Continual Learningcited by 24
  37. 2024Closed-form merging of parameter-efficient modules for Federated Continual Learningcited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 9.

9 papers.