GLAM: Efficient Continual Learning at Scale via Grouped LoRA Adapter Merging
Not on the map. Why?
Abstract (arXiv)
The ability to learn continuously over time remains a major challenge for modern machine learning systems, even in the era of Foundation Models. While the rich representations learned by large pre-trained models can partially mitigate catastrophic forgetting, they still struggle to adapt efficiently to evolving data distributions. A key challenge remains, how to continually add new knowledge to a large pretrained model in a way that is scalable and computationally efficient over long task sequences. In this work, we introduce GLAM, a simple and effective framework for class-incremental continual learning based on LoRA adapters merging. For each task, GLAM trains a lightweight low-rank adapter with an importance scalar, incurring minimal computational overhead. Adapters are then pruned, rescaled, and sequentially grouped to enable structured knowledge reuse and limit parameter growth. At inference, all groups are combined into a single module, ensuring constant computational cost regardless of the number of tasks. We evaluate GLAM on vision benchmarks with sequences of up to 50 tasks, significantly extending beyond standard protocols. GLAM achieves the highest accuracy across the evaluated benchmarks. Compared with the baseline attaining the highest average accuracy across benchmarks, it uses 16--19% of the trainable parameters and reduces training time by approximately 63--74%, demonstrating efficient and scalable continual learning. Our source code is publicly available at https://github.com/atlas-luiss/GLAM.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 16 Sep 2025.
Builds on
24 of 34 references.
References · 24
- 2017Attention Is All You Needcited by 60,361
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2016Progressive Neural Networkscited by 1,361
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2021Learning to Prompt for Continual Learningcited by 944
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
12 more
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 198
- 2023SLCA: Slow Learner with Classifier Alignment for Continual Learning on a Pre-trained Modelcited by 180
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 124
- 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
- 2025SD-LoRA: Scalable Decoupled Low-Rank Adaptation for Class Incremental Learningcited by 63
- 2024Self-Expansion of Pre-trained Models with Mixture of Adapters for Continual Learningcited by 53
- 2025Merging Models on the Fly Without Retraining: A Sequential Approach to Scalable Continual Model Mergingcited by 27
- 2025Parameter-Efficient Continual Fine-Tuning: A Surveycited by 11
Built on by
Citing papers per year: 2025: 1.
1 paper.