Parameter-Efficient Fine-Tuning for Continual Learning: A Neural Tangent Kernel Perspective
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning for continual learning (PEFT-CL) has shown promise in adapting pre-trained models to sequential tasks while mitigating catastrophic forgetting problem. However, understanding the mechanisms that dictate continual performance in this paradigm remains elusive. To unravel this mystery, we undertake a rigorous analysis of PEFT-CL dynamics to derive relevant metrics for continual scenarios using Neural Tangent Kernel (NTK) theory. With the aid of NTK as a mathematical analysis tool, we recast the challenge of test-time forgetting into the quantifiable generalization gaps during training, identifying three key factors that influence these gaps and the performance of PEFT-CL: training sample size, task-level feature orthogonality, and regularization. To address these challenges, we introduce NTK-CL, a novel framework that eliminates task-specific parameter storage while adaptively generating task-relevant features. Aligning with theoretical guidance, NTK-CL triples the feature representation of each sample, theoretically and empirically reducing the magnitude of both task-interplay and task-specific generalization gaps. Grounded in NTK analysis, our framework imposes an adaptive exponential moving average mechanism and constraints on task-level feature orthogonality, maintaining intra-task NTK forms while attenuating inter-task NTK forms. Ultimately, by fine-tuning optimizable parameters with appropriate regularization, NTK-CL achieves state-of-the-art performance on established PEFT-CL benchmarks. This work provides a theoretical foundation for understanding and improving PEFT-CL models, offering insights into the interplay between feature representation, task orthogonality, and generalization, contributing to the development of more efficient continual learning systems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 95 of its 135 references that are in the map. First posted on arXiv 24 Jul 2024.
Builds on
95 of 135 references.
References · 95
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
38 more
- 2021Learning to Prompt for Vision-Language Modelscited by 2,269
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2022Visual Prompt Tuningcited by 1,674
- 2021An Empirical Study of Training Self-Supervised Vision Transformerscited by 1,610
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2019Natural Adversarial Examplescited by 1,401
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2017Deep Image Priorcited by 1,097
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2021iBOT: Image BERT Pre-Training with Online Tokenizercited by 891
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
- 2021CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classificationcited by 806
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2021ImageNet-21K Pretraining for the Massescited by 607
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 419
- 2024The Platonic Representation Hypothesiscited by 362
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 278
- 2020Puzzle Mix: Exploiting Saliency and Local Statistics for Optimal Mixupcited by 260
- 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2023Progressive Prompts: Continual Learning for Language Modelscited by 195
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
- 2021Few-Shot Incremental Learning with Continually Evolved Classifierscited by 184
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 156
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 139
50 most cited of 95 All 95 (JSON)
Built on by
Citing papers per year: 2025: 2.
2 papers.