mlsanityData to 14 Oct 2026

Take Only What You Need: Rank Minimization as an Implicit Forgetting Regularizer in Continual Learning

arXiv 2412.01004 ↗First posted 1 Dec 2024cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

The central tension in continual learning (CL) is the trade-off between plasticity (acquiring new knowledge) and stability (retaining prior knowledge). We study how a pre-trained backbone can be continually updated to absorb new knowledge while preserving existing capabilities, via capacity control: regulating the effective rank of each parameter update, a per-step quantity directly controllable inside a LoRA update. A controlled probe of LoRA rank and placement across modules and tasks reveals a consistent trade-off, with a moderate-rank sweet spot that varies by placement and task, leaving no universally optimal fixed rank; a formal bound shows forgetting grows with rank. Building on these findings, we propose Continual Dynamic Rank-Selective LoRA (CoDyRA), which jointly trains each LoRA update with rank minimization via sparsity-promoting regularization on per-component importance weights. The supervised objective drives plasticity; rank minimization regularizes forgetting. We show that rank minimization serves as an implicit forgetting regularizer in the CL regime, protecting general capability and prior-task knowledge simultaneously by controlling forgetting against the current model state. Across MTIL, X-TAIL, and TRACE (CLIP, LLaMA, Gemma), CoDyRA outperforms prior CL methods on new knowledge learning and forgetting, achieving a strong plasticity-stability balance. Project page: https://artificer-ai-lab.github.io/CoDyRA.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 48 of its 87 references that are in the map. First posted on arXiv 1 Dec 2024.

Builds on

48 of 87 references.

References · 48

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2024The Llama 3 Herd of Modelscited by 14,715
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  5. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  6. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  7. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  8. 2016Learning without Forgettingcited by 2,496
  9. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  10. 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
  11. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  12. 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
36 more
  1. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
  2. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  3. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  4. 2021Learning to Prompt for Continual Learningcited by 944
  5. 2021Robust fine-tuning of zero-shot modelscited by 797
  6. 2021CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generationcited by 744
  7. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  8. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
  9. 2019Gradient based sample selection for online continual learningcited by 571
  10. 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
  11. 2019Orthogonal Gradient Descent for Continual Learningcited by 369
  12. 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
  13. 2024LoRA Learns Less and Forgets Lesscited by 328
  14. 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 312
  15. 2013Direct and Indirect Effectscited by 280
  16. 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
  17. 2018Task-Free Continual Learningcited by 221
  18. 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 221
  19. 2024Boosting Continual Learning of Vision-Language Models via Mixture-of-Experts Adapterscited by 199
  20. 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 198
  21. 2024ReFT: Representation Finetuning for Language Modelscited by 197
  22. 2023RanPAC: Random Projections and Pre-trained Models for Continual Learningcited by 164
  23. 2023A Unified Continual Learning Framework with General Parameter-Efficient Tuningcited by 125
  24. 2022NumGLUE: A Suite of Fundamental yet Challenging Mathematical Reasoning Taskscited by 112
  25. 2023MeetingBank: A Benchmark Dataset for Meeting Summarizationcited by 84
  26. 2023Trillion Dollar Words: A New Financial Dataset, Task & Market Analysiscited by 75
  27. 2019Toward Understanding Catastrophic Forgetting in Continual Learningcited by 68
  28. 2022Don't Stop Learning: Towards Continual Learning for the CLIP Modelcited by 61
  29. 2024Self-Expansion of Pre-trained Models with Mixture of Adapters for Continual Learningcited by 53
  30. 2023TiC-CLIP: Continual Training of CLIP Modelscited by 38
  31. 2024Mind the Interference: Retaining Pre-trained Knowledge in Parameter Efficient Continual Learning of Vision-Language Modelscited by 34
  32. 2024Convolutional Prompting meets Language Models for Continual Learningcited by 32
  33. 2023Overcoming Generic Knowledge Loss with Selective Parameter Updatecited by 23
  34. 2024HiDe-PET: Continual Learning via Hierarchical Decomposition of Parameter-Efficient Tuningcited by 20
  35. 2024MiLoRA: Efficient Mixture of Low-Rank Adaptation for Large Language Models Fine-tuningcited by 19
  36. 2023NPCL: Neural Processes for Uncertainty-Aware Continual Learningcited by 14

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.