Efficient Rehearsal Free Zero Forgetting Continual Learning using Adaptive Weight Modulation
Not on the map. Why?
Abstract (arXiv)
Artificial neural networks encounter a notable challenge known as continual learning, which involves acquiring knowledge of multiple tasks over an extended period. This challenge arises due to the tendency of previously learned weights to be adjusted to suit the objectives of new tasks, resulting in a phenomenon called catastrophic forgetting. Most approaches to this problem seek a balance between maximizing performance on the new tasks and minimizing the forgetting of previous tasks. In contrast, our approach attempts to maximize the performance of the new task, while ensuring zero forgetting. This is accomplished by creating a task-specific modulation parameters for each task. Only these would be learnable parameters during learning of consecutive tasks. Through comprehensive experimental evaluations, our model demonstrates superior performance in acquiring and retaining novel tasks that pose difficulties for other multi-task models. This emphasizes the efficacy of our approach in preventing catastrophic forgetting while accommodating the acquisition of new tasks
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 43 references that are in the map. First posted on arXiv 26 Nov 2023.
Builds on
24 of 43 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2016Learning without Forgettingcited by 2,496
- 2019Searching for MobileNetV3cited by 1,994
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
12 more
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2019How to Fine-Tune BERT for Text Classification?cited by 411
- 2020Multi-Task Learning with Deep Neural Networks: A Surveycited by 375
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 364
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 360
- 2020Supermasks in Superpositioncited by 227
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
- 2020PLOP: Learning without Forgetting for Continual Semantic Segmentationcited by 177
- 2022VLP: A Survey on Vision-Language Pre-trainingcited by 159
- 2022Representation Compensation Networks for Continual Semantic Segmentationcited by 72
- 2019Weight Agnostic Neural Networkscited by 71
- 2018Real-Time Joint Semantic Segmentation and Depth Estimation Using Asymmetric Annotationscited by 51
Built on by
Citing papers per year: 2025: 1.
1 paper.