mlsanityData to 14 Oct 2026

Continual Learning of Achieving Forgetting-free and Positive Knowledge Transfer

arXiv 2601.05623 ↗First posted 9 Jan 2026cs.LG cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Existing research on continual learning (CL) of a sequence of tasks focuses mainly on dealing with catastrophic forgetting (CF) to balance the learning plasticity of new tasks and the memory stability of old tasks. However, an ideal CL agent should not only be able to overcome CF, but also encourage positive forward and backward knowledge transfer (KT), i.e., using the learned knowledge from previous tasks for the new task learning (namely FKT), and improving the previous tasks' performance with the knowledge of the new task (namely BKT). To this end, this paper first models CL as an optimization problem in which each sequential learning task aims to achieve its optimal performance under the constraint that both FKT and BKT should be positive. It then proposes a novel Enhanced Task Continual Learning (ETCL) method, which achieves forgetting-free and positive KT. Furthermore, the bounds that can lead to negative FKT and BKT are estimated theoretically. Based on the bounds, a new strategy for online task similarity detection is also proposed to facilitate positive KT. To overcome CF, ETCL learns a set of task-specific binary masks to isolate a sparse sub-network for each task while preserving the performance of a dense network for the task. At the beginning of a new task learning, ETCL tries to align the new task's gradient with that of the sub-network of the previous most similar task to ensure positive FKT. By using a new bi-objective optimization strategy and an orthogonal gradient projection method, ETCL updates only the weights of previous similar tasks at the classification layer to achieve positive BKT. Extensive evaluations demonstrate that the proposed ETCL markedly outperforms strong baselines on dissimilar, similar, and mixed task sequences.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 43 of its 63 references that are in the map. First posted on arXiv 9 Jan 2026.

Builds on

43 of 63 references.

References · 43

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2016Learning without Forgettingcited by 2,496
  4. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  6. 2016Matching Networks for One Shot Learningcited by 2,255
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  8. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  9. 2016Progressive Neural Networkscited by 1,361
  10. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
  11. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  12. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
31 more
  1. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  2. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  3. 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
  4. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  5. 2019Three scenarios for continual learningcited by 614
  6. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  7. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 449
  8. 2019Orthogonal Gradient Descent for Continual Learningcited by 369
  9. 2021Gradient Projection Memory for Continual Learningcited by 348
  10. 2019On Tiny Episodic Memories in Continual Learningcited by 307
  11. 2018Re-evaluating Continual Learning Scenarios: A Categorization and Case for Strong Baselinescited by 228
  12. 2018Statistical Aspects of Wasserstein Distancescited by 203
  13. 2019Meta-Learning Representations for Continual Learningcited by 189
  14. 2018Reinforced Continual Learningcited by 186
  15. 2018Continual Learning of Context-dependent Processing in Neural Networkscited by 179
  16. 2018Towards Robust Evaluations of Continual Learningcited by 148
  17. 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 146
  18. 2020Adversarial Continual Learningcited by 142
  19. 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
  20. 2020A Survey on Negative Transfercited by 122
  21. 2020iTAML: An Incremental Task-Agnostic Meta-learning Approachcited by 90
  22. 2022TRGP: Trust Region Gradient Projection for Continual Learningcited by 82
  23. 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 81
  24. 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
  25. 2022Beyond Not-Forgetting: Continual Learning with Backward Knowledge Transfercited by 59
  26. 2022CoSCL: Cooperation of Small Continual Learners is Stronger than a Big Onecited by 43
  27. 2023Incorporating Neuro-Inspired Adaptability for Continual Learning in Artificial Intelligencecited by 43
  28. 2023Parameter-Level Soft-Masking for Continual Learningcited by 40
  29. 2019Policy Consolidation for Continual Reinforcement Learningcited by 39
  30. 2022Continual Learning with Recursive Gradient Optimizationcited by 32
  31. 2022A Theory for Knowledge Transfer in Continual Learningcited by 16

Built on by

Not cited yet.