Low-redundancy Distillation for Continual Learning
Not on the map. Why?
Abstract (arXiv)
Continual learning (CL) aims to learn new tasks without erasing previous knowledge. However, current CL methods primarily emphasize improving accuracy while often neglecting training efficiency, which consequently restricts their practical application. Drawing inspiration from the brain's contextual gating mechanism, which selectively filters neural information and continuously updates past memories, we propose Low-redundancy Distillation (LoRD), a novel CL method that enhances model performance while maintaining training efficiency. This is achieved by eliminating redundancy in three aspects of CL: student model redundancy, teacher model redundancy, and rehearsal sample redundancy. By compressing the learnable parameters of the student model and pruning the teacher model, LoRD facilitates the retention and optimization of prior knowledge, effectively decoupling task-specific knowledge without manually assigning isolated parameters for each task. Furthermore, we optimize the selection of rehearsal samples and refine rehearsal frequency to improve training efficiency. Through a meticulous design of distillation and rehearsal strategies, LoRD effectively balances training efficiency and model precision. Extensive experimentation across various benchmark datasets and environments demonstrates LoRD's superiority, achieving the highest accuracy with the lowest training FLOPs.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 25 of its 39 references that are in the map. First posted on arXiv 28 Sep 2023.
Builds on
25 of 39 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 909
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2019Gradient based sample selection for online continual learningcited by 571
- 2018Progress & Compress: A scalable framework for continual learningcited by 520
- 2019On Tiny Episodic Memories in Continual Learningcited by 307
13 more
- 2021Co2L: Contrastive Continual Learningcited by 244
- 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 219
- 2023Class-Incremental Learning: A Surveycited by 209
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 161
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 124
- 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 117
- 2023Computationally Budgeted Continual Learning: What Does Matter?cited by 61
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2023Real-Time Evaluation in Online Continual Learning: A New Hopecited by 47
- 2022NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networkscited by 39
- 2023SIESTA: Efficient Online Continual Learning with Sleepcited by 24
- 2022Sparse Coding in a Dual Memory System for Lifelong Learningcited by 16
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.