Incremental Task Learning with Incremental Rank Updates
Not on the map. Why?
Abstract (arXiv)
Incremental Task learning (ITL) is a category of continual learning that seeks to train a single network for multiple tasks (one after another), where training data for each task is only available during the training of that task. Neural networks tend to forget older tasks when they are trained for the newer tasks; this property is often known as catastrophic forgetting. To address this issue, ITL methods use episodic memory, parameter regularization, masking and pruning, or extensible network structures. In this paper, we propose a new incremental task learning framework based on low-rank factorization. In particular, we represent the network weights for each layer as a linear combination of several rank-1 matrices. To update the network for a new task, we learn a rank-1 (or low-rank) matrix and add that to the weights of every layer. We also introduce an additional selector vector that assigns different weights to the low-rank matrices learned for the previous tasks. We show that our approach performs better than the current state-of-the-art methods in terms of accuracy and forgetting. Our method also offers better memory efficiency compared to episodic memory- and mask-based approaches. Our code will be available at https://github.com/CSIPlab/task-increment-rank-update.git
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 33 of its 43 references that are in the map. First posted on arXiv 19 Jul 2022.
Builds on
33 of 43 references.
References · 33
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2016Progressive Neural Networkscited by 1,332
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Experience Replay for Continual Learningcited by 1,074
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
21 more
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2019Gradient based sample selection for online continual learningcited by 568
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 369
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2017Variational Continual Learningcited by 335
- 2019Continual learning with hypernetworkscited by 267
- 2020Supermasks in Superpositioncited by 223
- 2021Training Networks in Null Space of Feature Covariance for Continual Learningcited by 139
- 2020Conditional Channel Gated Networks for Task-Aware Continual Learningcited by 115
- 2018Alleviating catastrophic forgetting using context-dependent gating and synaptic stabilizationcited by 104
- 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
- 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 87
- 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 71
- 2021Layerwise Optimization by Gradient Decomposition for Continual Learningcited by 51
- 2021Optimizing Reusable Knowledge for Continual Learning via Metalearningcited by 24
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 3.
8 papers.
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
- 2024Continual Learning with Neuromorphic Computing: Foundations, Methods, and Emerging Applicationscited by 7
- 2025H2ST: Hierarchical Two-Sample Tests for Continual Out-of-Distribution Detectioncited by 4
- 2023Hessian Aware Low-Rank Perturbation for Order-Robust Continual Learningcited by 2
- 2025CLoRA: Parameter-Efficient Continual Learning with Low-Rank Adaptationcited by 2
- 2024Decision Boundary-aware Knowledge Consolidation Generates Better Instance-Incremental Learnercited by 1
- 2024Convolutional Neural Network Compression via Dynamic Parameter Rank Pruningcited by 0
- 2025Lifelong Evolution: Collaborative Learning between Large and Small Language Models for Continuous Emergent Fake News Detectioncited by 0
- 2025CLoRA: Parameter-Efficient Continual Learning with Low-Rank Adaptation26 Jul 2025
- 2025Lifelong Evolution: Collaborative Learning between Large and Small Language Models for Continuous Emergent Fake News Detection5 Jun 2025
- 2025H2ST: Hierarchical Two-Sample Tests for Continual Out-of-Distribution Detection19 Mar 2025
- 2024Continual Learning with Neuromorphic Computing: Foundations, Methods, and Emerging Applications11 Oct 2024
- 2024Decision Boundary-aware Knowledge Consolidation Generates Better Instance-Incremental Learner5 Jun 2024
- 2024Convolutional Neural Network Compression via Dynamic Parameter Rank Pruning15 Jan 2024
- 2023Hessian Aware Low-Rank Perturbation for Order-Robust Continual Learning26 Nov 2023
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Application31 Jan 2023