TEAL: New Selection Strategy for Small Buffers in Experience Replay Class Incremental Learning
Not on the map. Why?
Abstract (arXiv)
Continual Learning is an unresolved challenge, whose relevance increases when considering modern applications. Unlike the human brain, trained deep neural networks suffer from a phenomenon called catastrophic forgetting, wherein they progressively lose previously acquired knowledge upon learning new tasks. To mitigate this problem, numerous methods have been developed, many relying on the replay of past exemplars during new task training. However, as the memory allocated for replay decreases, the effectiveness of these approaches diminishes. On the other hand, maintaining a large memory for the purpose of replay is inefficient and often impractical. Here we introduce TEAL, a novel approach to populate the memory with exemplars, that can be integrated with various experience-replay methods and significantly enhance their performance with small memory buffers. We show that TEAL enhances the average accuracy of existing class-incremental methods and outperforms other selection strategies, achieving state-of-the-art performance even with small memory buffers of 1-3 exemplars per class in the final task. This confirms our initial hypothesis that when memory is scarce, it is best to prioritize the most typical data. Code is available at this https URL: https://github.com/shahariel/TEAL.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 34 references that are in the map. First posted on arXiv 30 Jun 2024.
Builds on
20 of 34 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Large Scale Incremental Learningcited by 727
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
- 2019On Tiny Episodic Memories in Continual Learningcited by 299
- 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
8 more
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 215
- 2022Active Learning on a Budget: Opposite Strategies Suit High and Low Budgetscited by 131
- 2021Avalanche: an End-to-End Library for Continual Learningcited by 124
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 121
- 2023A Survey on Few-Shot Class-Incremental Learningcited by 48
- 2021Dual-Teacher Class-Incremental Learning With Data-Free Generative Replaycited by 31
- 2024Revisiting Neural Networks for Continual Learning: An Architectural Perspectivecited by 17
- 2021Generative Replay-based Continual Zero-Shot Learningcited by 7
Built on by
Citing papers per year: 2024: 1.
1 paper.