Densely Distilling Cumulative Knowledge for Continual Learning
Not on the map. Why?
Abstract (arXiv)
Continual learning, involving sequential training on diverse tasks, often faces catastrophic forgetting. While knowledge distillation-based approaches exhibit notable success in preventing forgetting, we pinpoint a limitation in their ability to distill the cumulative knowledge of all the previous tasks. To remedy this, we propose Dense Knowledge Distillation (DKD). DKD uses a task pool to track the model's capabilities. It partitions the output logits of the model into dense groups, each corresponding to a task in the task pool. It then distills all tasks' knowledge using all groups. However, using all the groups can be computationally expensive, we also suggest random group selection in each optimization step. Moreover, we propose an adaptive weighting scheme, which balances the learning of new classes and the retention of old classes, based on the count and similarity of the classes. Our DKD outperforms recent state-of-the-art baselines across diverse benchmarks and scenarios. Empirical analysis underscores DKD's ability to enhance model stability, promote flatter minima for improved generalization, and remains robust across various memory budgets and task orders. Moreover, it seamlessly integrates with other CL methods to boost performance and proves versatile in offline scenarios like model compression.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 49 references that are in the map. First posted on arXiv 16 May 2024.
Builds on
32 of 49 references.
References · 32
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Experience Replay for Continual Learningcited by 1,074
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2019Relational Knowledge Distillationcited by 873
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Large Scale Incremental Learningcited by 727
20 more
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2019Three scenarios for continual learningcited by 610
- 2018End-to-End Incremental Learningcited by 596
- 2019Gradient based sample selection for online continual learningcited by 568
- 2018Progress & Compress: A scalable framework for continual learningcited by 516
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 369
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
- 2018Selective Experience Replay for Lifelong Learningcited by 239
- 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 220
- 2018Task-Free Continual Learningcited by 219
- 2019Compacting, Picking and Growing for Unforgetting Continual Learningcited by 207
- 2018Reinforced Continual Learningcited by 186
- 2019Class-incremental Learning via Deep Model Consolidationcited by 172
- 2022Class-Incremental Learning by Knowledge Distillation with Adaptive Feature Consolidationcited by 113
- 2019Overcoming Catastrophic Forgetting with Unlabeled Data in the Wildcited by 111
- 2021On Learning the Geodesic Path for Incremental Learningcited by 85
- 2021Essentials for Class Incremental Learningcited by 57
- 2020Continual Learning with Extended Kronecker-factored Approximate Curvaturecited by 39
Built on by
Citing papers per year: 2026: 1.
1 paper.