Gradient Projection For Continual Parameter-Efficient Tuning
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient tunings (PETs) have demonstrated impressive performance and promising perspectives in training large models, while they are still confronted with a common problem: the trade-off between learning new content and protecting old knowledge, leading to zero-shot generalization collapse, and cross-modal hallucination. In this paper, we reformulate Adapter, LoRA, Prefix-tuning, and Prompt-tuning from the perspective of gradient projection, and firstly propose a unified framework called Parameter Efficient Gradient Projection (PEGP). We introduce orthogonal gradient projection into different PET paradigms and theoretically demonstrate that the orthogonal condition for the gradient can effectively resist forgetting even for large-scale models. It therefore modifies the gradient towards the direction that has less impact on the old feature space, with less extra memory space and training time. We extensively evaluate our method with different backbones, including ViT and CLIP, on diverse datasets, and experiments comprehensively demonstrate its efficiency in reducing forgetting in class, online class, domain, task, and multi-modality continual settings. The project page is available at https://dmcv-ecnu-pegp.github.io/.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 71 references that are in the map. First posted on arXiv 22 May 2024.
Builds on
24 of 71 references.
References · 24
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2019Three scenarios for continual learningcited by 610
12 more
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
- 2023Revisiting Class-Incremental Learning with Pre-Trained Models: Generalizability and Adaptivity are All You Needcited by 183
- 2023Investigating the Catastrophic Forgetting in Multimodal Large Language Modelscited by 119
- 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 110
- 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
- 2022TRGP: Trust Region Gradient Projection for Continual Learningcited by 79
- 2023Learning without Forgetting for Vision-Language Modelscited by 79
- 2019Toward Understanding Catastrophic Forgetting in Continual Learningcited by 67
- 2022CLIP model is an Efficient Continual Learnercited by 64
- 2023Remind of the Past: Incremental Learning with Analogical Promptscited by 3
Built on by
Not cited yet.