mlsanityData to 7 Oct 2026

Theoretical Understanding of the Information Flow on Continual Learning Performance

arXiv 2204.12010 ↗First posted 26 Apr 2022cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Continual learning (CL) is a setting in which an agent has to learn from an incoming stream of data sequentially. CL performance evaluates the model's ability to continually learn and solve new problems with incremental available information over time while retaining previous knowledge. Despite the numerous previous solutions to bypass the catastrophic forgetting (CF) of previously seen tasks during the learning process, most of them still suffer significant forgetting, expensive memory cost, or lack of theoretical understanding of neural networks' conduct while learning new tasks. While the issue that CL performance degrades under different training regimes has been extensively studied empirically, insufficient attention has been paid from a theoretical angle. In this paper, we establish a probabilistic framework to analyze information flow through layers in networks for task sequences and its impact on learning performance. Our objective is to optimize the information preservation between layers while learning new tasks to manage task-specific knowledge passing throughout the layers while maintaining model performance on previous tasks. In particular, we study CL performance's relationship with information flow in the network to answer the question "How can knowledge of information flow between layers be used to alleviate CF?". Our analysis provides novel insights of information adaptation within the layers during the incremental task learning process. Through our experiments, we provide empirical evidence and practically highlight the performance improvement across multiple tasks.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 24 of its 32 references that are in the map. First posted on arXiv 26 Apr 2022.

Builds on

24 of 32 references.

References · 24

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2016Learning without Forgettingcited by 2,465
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  6. 2016Progressive Neural Networkscited by 1,332
  7. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
  8. 2017Continual Learning with Deep Generative Replaycited by 1,152
  9. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  10. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
  11. 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
  12. 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
12 more
  1. 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 158
  2. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  3. 2020Continual Learning with Node-Importance based Adaptive Group Sparse Regularizationcited by 102
  4. 2019Continual Learning via Neural Pruningcited by 101
  5. 2020A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrixcited by 99
  6. 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 80
  7. 2019Toward Understanding Catastrophic Forgetting in Continual Learningcited by 67
  8. 2020SpaceNet: Make Free Space For Continual Learningcited by 53
  9. 2018Incremental Classifier Learning with Generative Adversarial Networkscited by 32
  10. 2020Learn-Prune-Share for Lifelong Learningcited by 32
  11. 2021Formalizing the Generalization-Forgetting Trade-off in Continual Learningcited by 24
  12. 2020SPACE: Structured Compression and Sharing of Representational Space for Continual Learningcited by 15

Built on by

Cited by year

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

8 papers.