Parameter-Efficient Continual Fine-Tuning: A Survey
Not on the map. Why?
Abstract (arXiv)
The emergence of large pre-trained networks has revolutionized the AI field, unlocking new possibilities and achieving unprecedented performance. However, these models inherit a fundamental limitation from traditional Machine Learning approaches: their strong dependence on the textiti.i.d. assumption hinders their adaptability to dynamic learning scenarios. We believe the next breakthrough in AI lies in enabling efficient adaptation to evolving environments -- such as the real world -- where new data and tasks arrive sequentially. This challenge defines the field of Continual Learning (CL), a Machine Learning paradigm focused on developing lifelong learning neural models. One alternative to efficiently adapt these large-scale models is known Parameter-Efficient Fine-Tuning (PEFT). These methods tackle the issue of adapting the model to a particular data or scenario by performing small and efficient modifications, achieving similar performance to full fine-tuning. However, these techniques still lack the ability to adjust the model to multiple tasks continually, as they suffer from the issue of Catastrophic Forgetting. In this survey, we first provide an overview of CL algorithms and PEFT methods before reviewing the state-of-the-art on Parameter-Efficient Continual Fine-Tuning (PECFT). We examine various approaches, discuss evaluation metrics, and explore potential future research directions. Our goal is to highlight the synergy between CL and Parameter-Efficient Fine-Tuning, guide researchers in this field, and pave the way for novel future research directions.
Key facts. Cited by 11 papers in the map (data through 13 Oct 2026). Builds on 125 of its 162 references that are in the map. First posted on arXiv 18 Apr 2025.
Builds on
125 of 162 references.
References · 125
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
- 2020Language Models are Few-Shot Learnerscited by 32,320
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,043
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,549
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,231
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,322
- 2015Distilling the Knowledge in a Neural Networkcited by 10,180
- 2020Scaling Laws for Neural Language Modelscited by 6,494
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,880
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,753
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,281
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,213
38 more
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,898
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,785
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,882
- 2022Emergent Abilities of Large Language Modelscited by 2,499
- 2016Learning without Forgettingcited by 2,479
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,323
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
- 2019Language Models as Knowledge Bases?cited by 1,931
- 2017Gradient Episodic Memory for Continual Learningcited by 1,882
- 2016Progressive Neural Networkscited by 1,347
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,322
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,248
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,240
- 2019A Comprehensive Survey on Transfer Learningcited by 1,157
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,099
- 2018Efficient Lifelong Learning with A-GEMcited by 1,053
- 2021Learning to Prompt for Continual Learningcited by 941
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 901
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 891
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 891
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 868
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 862
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 785
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 737
- 2019Large Scale Incremental Learningcited by 728
- 2021GPT Understands, Toocited by 716
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 675
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 639
- 2019Three scenarios for continual learningcited by 612
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 520
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 514
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 449
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 443
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 390
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 377
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 370
- 2019Orthogonal Gradient Descent for Continual Learningcited by 364
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 363
50 most cited of 125 All 125 (JSON)
Built on by
Citing papers per year: 2025: 6; 2026: 5.
11 papers.
- 2025Bridging Streaming Continual Learning via In-Context Large Tabular Modelscited by 7
- 2025Foundation Models for Scientific Discovery: From Paradigm Enhancement to Paradigm Transitioncited by 6
- 2025GLAM: Efficient Continual Learning at Scale via Grouped LoRA Adapter Mergingcited by 1
- 2025BoHA: Blockwise Hadamard Product Adaptation for Parameter-Efficient Fine-Tuningcited by 1
- 2025Logits Replay + MoClip: Stabilized, Low-Cost Post-Training with Minimal Forgettingcited by 1
- 2026Learning in the Null Space: Small Singular Values for Continual Learningcited by 1
- 2025Adaptive Data Flywheel: Applying MAPE Control Loops to AI Agent Improvementcited by 0
- 2026On Catastrophic Forgetting in Low-Rank Decomposition-Based Parameter-Efficient Fine-Tuningcited by 0
- 2026Repurposing Adversarial Perturbations for Continual Learning: From Defense to Active Alignmentcited by 0
- 2026Towards Continual Motion-Language Agents: LoRA Variants for Incremental Motion Understanding and Generationcited by 0
- 2026The Parts Are Greater Than the Sum: Automated Task Sequencing for Efficient Training of Multi-Policy LLMscited by 0
- 2026The Parts Are Greater Than the Sum: Automated Task Sequencing for Efficient Training of Multi-Policy LLMs31 Jul 2026
- 2026Towards Continual Motion-Language Agents: LoRA Variants for Incremental Motion Understanding and Generation29 Jun 2026
- 2026Repurposing Adversarial Perturbations for Continual Learning: From Defense to Active Alignment1 Jun 2026
- 2026On Catastrophic Forgetting in Low-Rank Decomposition-Based Parameter-Efficient Fine-Tuning10 Mar 2026
- 2026Learning in the Null Space: Small Singular Values for Continual Learning25 Feb 2026
- 2025Bridging Streaming Continual Learning via In-Context Large Tabular Models12 Dec 2025
- 2025Adaptive Data Flywheel: Applying MAPE Control Loops to AI Agent Improvement30 Oct 2025
- 2025Foundation Models for Scientific Discovery: From Paradigm Enhancement to Paradigm Transition17 Oct 2025
- 2025Logits Replay + MoClip: Stabilized, Low-Cost Post-Training with Minimal Forgetting10 Oct 2025
- 2025BoHA: Blockwise Hadamard Product Adaptation for Parameter-Efficient Fine-Tuning25 Sep 2025
- 2025GLAM: Efficient Continual Learning at Scale via Grouped LoRA Adapter Merging16 Sep 2025