mlsanityData to 14 Oct 2026

Avoiding Forgetting and Allowing Forward Transfer in Continual Learning via Sparse Networks

arXiv 2110.05329 ↗First posted 11 Oct 2021cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

Using task-specific components within a neural network in continual learning (CL) is a compelling strategy to address the stability-plasticity dilemma in fixed-capacity models without access to past data. Current methods focus only on selecting a sub-network for a new task that reduces forgetting of past tasks. However, this selection could limit the forward transfer of relevant past knowledge that helps in future learning. Our study reveals that satisfying both objectives jointly is more challenging when a unified classifier is used for all classes of seen tasks-class-Incremental Learning (class-IL)-as it is prone to ambiguities between classes across tasks. Moreover, the challenge increases when the semantic similarity of classes across tasks increases. To address this challenge, we propose a new CL method, named AFAF, that aims to Avoid Forgetting and Allow Forward transfer in class-IL using fix-capacity models. AFAF allocates a sub-network that enables selective transfer of relevant knowledge to a new task while preserving past knowledge, reusing some of the previously allocated components to utilize the fixed-capacity, and addressing class-ambiguities when similarities exist. The experiments show the effectiveness of AFAF in providing models with multiple CL desirable properties, while outperforming state-of-the-art methods on various challenging benchmarks with different semantic similarities.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 42 of its 58 references that are in the map. First posted on arXiv 11 Oct 2021.

Builds on

42 of 58 references.

References · 42

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  4. 2016Learning without Forgettingcited by 2,496
  5. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  8. 2016Progressive Neural Networkscited by 1,361
  9. 2017Continual Learning with Deep Generative Replaycited by 1,158
  10. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  11. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  12. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
30 more
  1. 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
  2. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  3. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  4. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  5. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  6. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 449
  7. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  8. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  9. 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
  10. 2018Learning without Memorizingcited by 250
  11. 2020Supermasks in Superpositioncited by 227
  12. 2013Predicting Parameters in Deep Learningcited by 224
  13. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
  14. 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 161
  15. 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
  16. 2019Continual Learning via Neural Pruningcited by 101
  17. 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 88
  18. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  19. 2021Few-Shot Lifelong Learningcited by 59
  20. 2020SpaceNet: Make Free Space For Continual Learningcited by 53
  21. 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
  22. 2020Sparse Weight Activation Trainingcited by 45
  23. 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
  24. 2018Multi-objective Evolutionary Federated Learningcited by 42
  25. 2020Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoderscited by 28
  26. 2021Neural network relief: a pruning algorithm based on neural activitycited by 10
  27. 2016Online Contrastive Divergence with Generative Replay: Experience Replay without Storing Datacited by 9
  28. 2021Self-Attention Meta-Learner for Continual Learningcited by 8
  29. 2020OSLNet: Deep Small-Sample Classification with an Orthogonal Softmax Layercited by 7
  30. 2021Learning Invariant Representation for Continual Learningcited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 0; 2026: 2.

8 papers.