Parameter Efficient Continual Learning with Dynamic Low-Rank Adaptation
Not on the map. Why?
Abstract (arXiv)
Catastrophic forgetting has remained a critical challenge for deep neural networks in Continual Learning (CL) as it undermines consolidated knowledge when learning new tasks. Parameter efficient fine tuning CL techniques are gaining traction for their effectiveness in addressing catastrophic forgetting with a lightweight training schedule while avoiding degradation of consolidated knowledge in pre-trained models. However, low rank adapters (LoRA) in these approaches are highly sensitive to rank selection which can lead to sub-optimal resource allocation and performance. To this end, we introduce PEARL, a rehearsal-free CL framework that entails dynamic rank allocation for LoRA components during CL training. Specifically, PEARL leverages reference task weights and adaptively determines the rank of task-specific LoRA components based on the current tasks' proximity to reference task weights in parameter space. To demonstrate the versatility of PEARL, we evaluate it across three vision architectures (ResNet, Separable Convolutional Network and Vision Transformer) and a multitude of CL scenarios, and show that PEARL outperforms all considered baselines by a large margin.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 62 of its 81 references that are in the map. First posted on arXiv 17 May 2025.
Builds on
62 of 81 references.
References · 62
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2016Learning without Forgettingcited by 2,496
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2016Progressive Neural Networkscited by 1,361
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2021Learning to Prompt for Continual Learningcited by 944
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
38 more
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 449
- 2024LoRA Learns Less and Forgets Lesscited by 328
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 312
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
- 2021Co2L: Contrastive Continual Learningcited by 244
- 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 219
- 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 198
- 2022Patching open-vocabulary models by interpolating weightscited by 190
- 2023Revisiting Class-Incremental Learning with Pre-Trained Models: Generalizability and Adaptivity are All You Needcited by 184
- 2023Continual Diffusion: Continual Customization of Text-to-Image Diffusion with C-LoRAcited by 141
- 2023A Unified Continual Learning Framework with General Parameter-Efficient Tuningcited by 125
- 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 121
- 2023Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimalitycited by 121
- 2022Self-Sustaining Representation Expansion for Non-Exemplar Class-Incremental Learningcited by 118
- 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 117
- 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 112
- 2019Continual Learning via Neural Pruningcited by 101
- 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
- 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 87
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2024Consistent Prompting for Rehearsal-Free Continual Learningcited by 54
- 2024Self-Expansion of Pre-trained Models with Mixture of Adapters for Continual Learningcited by 53
- 2024MetaGPT: Merging Large Language Models Using Model Exclusive Task Arithmeticcited by 53
- 2023Introducing Language Guidance in Prompt-based Continual Learningcited by 49
- 2022Blueprint Separable Residual Network for Efficient Image Super-Resolutioncited by 44
- 2022Memory Efficient Continual Learning with Transformerscited by 43
- 2024DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distributioncited by 43
- 2022NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networkscited by 39
50 most cited of 62 All 62 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.