Merge before Forget: A Single LoRA Continual Learning via Continual Merging
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
- 2023GPT-4 Technical Reportcited by 18,132
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2018Experience Replay for Continual Learningcited by 1,074
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
37 more
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 218
- 2023Progressive Prompts: Continual Learning for Language Modelscited by 195
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
- 2024Improving LoRA in Privacy-preserving Federated Learningcited by 158
- 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 155
- 2016A vector-contraction inequality for Rademacher complexitiescited by 141
- 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 132
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2022A Kernel-Based View of Language Model Fine-Tuningcited by 118
- 2024Model merging with SVD to tie the Knotscited by 118
- 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
- 2024Asymmetry in Low-Rank Adapters of Foundation Modelscited by 81
- 2020Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networkscited by 73
- 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
- 2023Parameter Efficient Multi-task Model Fusion with Partial Linearizationcited by 64
- 2025SD-LoRA: Scalable Decoupled Low-Rank Adaptation for Class Incremental Learningcited by 60
- 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
- 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 58
- 2024Model Tailor: Mitigating Catastrophic Forgetting in Multi-modal Large Language Modelscited by 54
- 2024LoRA Training in the NTK Regime has No Spurious Local Minimacited by 48
- 2024CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuningcited by 41
- 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
- 2024SAPT: A Shared Attention Framework for Parameter-Efficient Continual Learning of Large Language Modelscited by 37
- 2025Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Mergingcited by 25
- 2023Fixed Design Analysis of Regularization-Based Continual Learningcited by 24
- 2024Closed-form merging of parameter-efficient modules for Federated Continual Learningcited by 22
Built on by
Citing papers per year: 2026: 9.
9 papers.
- 2026FSFM: A Biologically-Inspired Framework for Selective Forgetting of Agent Memorycited by 3
- 2026SAE-FD: Sparse Autoencoder Feature Distillation for Continual Learning of Large Language Modelscited by 1
- 2026Rethinking Transfer in Continual Learning: A Replay-Based Realisationcited by 0
- 2026Continual Learning in Transitioncited by 0
- 2026Learning New Facts with QLoRA: An Acquisition-Retention Frontiercited by 0
- 2026Beyond Endpoint Scores: Time- and Capacity-Conditioned Evaluation of Continual Knowledge Updatingcited by 0
- 2026Not All Ranks Are Equal: Budget-Aware LoRA Merging Across Taskscited by 0
- 2026Reasoning-Preserving Fine-Tuning of Post-RL LLMs with Null-Basis LoRAcited by 0
- 2026Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Modelscited by 0
- 2026Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Models25 Sep 2026
- 2026Reasoning-Preserving Fine-Tuning of Post-RL LLMs with Null-Basis LoRA22 Sep 2026
- 2026Not All Ranks Are Equal: Budget-Aware LoRA Merging Across Tasks3 Sep 2026
- 2026Beyond Endpoint Scores: Time- and Capacity-Conditioned Evaluation of Continual Knowledge Updating3 Sep 2026
- 2026Learning New Facts with QLoRA: An Acquisition-Retention Frontier26 Aug 2026
- 2026Continual Learning in Transition6 Aug 2026
- 2026Rethinking Transfer in Continual Learning: A Replay-Based Realisation17 Jul 2026
- 2026SAE-FD: Sparse Autoencoder Feature Distillation for Continual Learning of Large Language Models25 May 2026
- 2026FSFM: A Biologically-Inspired Framework for Selective Forgetting of Agent Memory22 Apr 2026