EFC++: Elastic Feature Consolidation with Prototype Re-balancing for Cold Start Exemplar-free Incremental Learning
Not on the map. Why?
Abstract (arXiv)
Exemplar-free Class Incremental Learning (EFCIL) aims to learn from a sequence of tasks without having access to previous task data. In this paper, we consider the challenging Cold Start scenario in which insufficient data is available in the first task to learn a high-quality backbone. This is especially challenging for EFCIL since it requires high plasticity, resulting in feature drift which is difficult to compensate for in the exemplar-free setting. To address this problem, we propose an effective approach to consolidate feature representations by regularizing drift in directions highly relevant to previous tasks while employing prototypes to reduce task-recency bias. Our approach, which we call Elastic Feature Consolidation++ (EFC++) exploits a tractable second-order approximation of feature drift based on a proposed Empirical Feature Matrix (EFM). The EFM induces a pseudo-metric in feature space which we use to regularize feature drift in important directions and to update Gaussian prototypes. In addition, we introduce a post-training prototype re-balancing phase that updates classifiers to compensate for feature drift. This strategy allows to improve over our previous EFC method by mitigating the misalignment between stored prototypes and the evolving feature space. Extensive experimental results on Tiny-ImageNet, ImageNet-Subset, ImageNet-1K, and DomainNet show that EFC++ achieves a strong stability--plasticity trade-off in Cold Start and outperforms recent exemplar-free baselines. Code is available at https://github.com/simomagi/elastic_feature_consolidation
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 63 of its 103 references that are in the map. First posted on arXiv 13 Mar 2025.
Builds on
63 of 103 references.
References · 63
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 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
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
38 more
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
- 2019Large Scale Incremental Learningcited by 727
- 2018End-to-End Incremental Learningcited by 596
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
- 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
- 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
- 2018Task-Free Continual Learningcited by 219
- 2023Class-Incremental Learning: A Surveycited by 209
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 152
- 2024Continual Learning with Pre-Trained Models: A Surveycited by 151
- 2020Adaptive Aggregation Networks for Class-Incremental Learningcited by 149
- 2021Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learningcited by 130
- 2018Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgettingcited by 127
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 121
- 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 120
- 2022Self-Sustaining Representation Expansion for Non-Exemplar Class-Incremental Learningcited by 118
- 2022Class-Incremental Learning by Knowledge Distillation with Adaptive Feature Consolidationcited by 113
- 2020Generative Feature Replay For Class-Incremental Learningcited by 109
- 2016Less-forgetting Learning in Deep Neural Networkscited by 97
- 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 86
- 2021PyCIL: A Python Toolbox for Class-Incremental Learningcited by 83
- 2022Probing Representation Forgetting in Supervised and Unsupervised Continual Learningcited by 74
- 2022R-DFCIL: Relation-Guided Representation Learning for Data-Free Class Incremental Learningcited by 59
- 2023Continual Learning: Applications and the Road Forwardcited by 59
- 2021Essentials for Class Incremental Learningcited by 57
- 2021Continual Learning for Real-World Autonomous Systems: Algorithms, Challenges and Frameworkscited by 56
- 2022ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protectioncited by 56
- 2022Continual evaluation for lifelong learning: Identifying the stability gapcited by 55
- 2017On Quadratic Penalties in Elastic Weight Consolidationcited by 54
- 2021EEC: Learning to Encode and Regenerate Images for Continual Learningcited by 40
- 2024Elastic Feature Consolidation for Cold Start Exemplar-Free Incremental Learningcited by 37
- 2024Resurrecting Old Classes with New Data for Exemplar-Free Continual Learningcited by 33
- 2022A simple but strong baseline for online continual learning: Repeated Augmented Rehearsalcited by 32
- 2018DeeSIL: Deep-Shallow Incremental Learningcited by 30
- 2024Exemplar-free Continual Representation Learning via Learnable Drift Compensationcited by 30
50 most cited of 63 All 63 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.