The Lie of the Average: How Class Incremental Learning Evaluation Deceives You?
Not on the map. Why?
Abstract (arXiv)
Class Incremental Learning (CIL) requires models to continuously learn new classes without forgetting previously learned ones, while maintaining stable performance across all possible class sequences. In real-world settings, the order in which classes arrive is diverse and unpredictable, and model performance can vary substantially across different sequences. Yet mainstream evaluation protocols calculate mean and variance from only a small set of randomly sampled sequences. Our theoretical analysis and empirical results demonstrate that this sampling strategy fails to capture the full performance range, resulting in biased mean estimates and a severe underestimation of the true variance in the performance distribution. We therefore contend that a robust CIL evaluation protocol should accurately characterize and estimate the entire performance distribution. To this end, we introduce the concept of extreme sequences and provide theoretical justification for their crucial role in the reliable evaluation of CIL. Moreover, we observe a consistent positive correlation between inter-task similarity and model performance, a relation that can be leveraged to guide the search for extreme sequences. Building on these insights, we propose EDGE (Extreme case-based Distribution & Generalization Evaluation), an evaluation protocol that adaptively identifies and samples extreme class sequences using inter-task similarity, offering a closer approximation of the ground-truth performance distribution. Extensive experiments demonstrate that EDGE effectively captures performance extremes and yields more accurate estimates of distributional boundaries, providing actionable insights for model selection and robustness checking. Our code is available at https://github.com/AIGNLAI/EDGE.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 50 of its 56 references that are in the map. First posted on arXiv 26 Sep 2025.
Builds on
50 of 56 references.
References · 50
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2022Visual Prompt Tuningcited by 1,681
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2021Learning to Prompt for Continual Learningcited by 944
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
38 more
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 372
- 2021Co2L: Contrastive Continual Learningcited by 244
- 2022FOSTER: Feature Boosting and Compression for Class-Incremental Learningcited by 229
- 2018Re-evaluating Continual Learning Scenarios: A Categorization and Case for Strong Baselinescited by 228
- 2023Revisiting Class-Incremental Learning with Pre-Trained Models: Generalizability and Adaptivity are All You Needcited by 184
- 2023RanPAC: Random Projections and Pre-trained Models for Continual Learningcited by 164
- 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 154
- 2024Continual Learning with Pre-Trained Models: A Surveycited by 154
- 2018Towards Robust Evaluations of Continual Learningcited by 148
- 2023A Unified Continual Learning Framework with General Parameter-Efficient Tuningcited by 125
- 2023Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimalitycited by 121
- 2022Self-Sustaining Representation Expansion for Non-Exemplar Class-Incremental Learningcited by 118
- 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 117
- 2023Preventing Zero-Shot Transfer Degradation in Continual Learning of Vision-Language Modelscited by 112
- 2020Generative Feature Replay For Class-Incremental Learningcited by 109
- 2020GAN Memory with No Forgettingcited by 84
- 2023Learning without Forgetting for Vision-Language Modelscited by 79
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 72
- 2023PILOT: A Pre-Trained Model-Based Continual Learning Toolboxcited by 64
- 2021Continual Learning via Local Module Compositioncited by 63
- 2017Hierarchical Clustering: Objective Functions and Algorithmscited by 60
- 2023First Session Adaptation: A Strong Replay-Free Baseline for Class-Incremental Learningcited by 46
- 2022Isolation and Impartial Aggregation: A Paradigm of Incremental Learning without Interferencecited by 44
- 2022CoSCL: Cooperation of Small Continual Learners is Stronger than a Big Onecited by 43
- 2023Incorporating Neuro-Inspired Adaptability for Continual Learning in Artificial Intelligencecited by 43
- 2024MOS: Model Surgery for Pre-Trained Model-Based Class-Incremental Learningcited by 36
- 2021Curriculum-Meta Learning for Order-Robust Continual Relation Extractioncited by 34
- 2022The Effect of Task Ordering in Continual Learningcited by 31
- 2021CLEVA-Compass: A Continual Learning EValuation Assessment Compass to Promote Research Transparency and Comparabilitycited by 28
- 2023Retentive or Forgetful? Diving into the Knowledge Memorizing Mechanism of Language Modelscited by 18
- 2023Learning to Prompt Knowledge Transfer for Open-World Continual Learningcited by 15
- 2025Task-Agnostic Guided Feature Expansion for Class-Incremental Learningcited by 15
- 2024Order parameters and phase transitions of continual learning in deep neural networkscited by 14
- 2024CAPrompt: Cyclic Prompt Aggregation for Pre-Trained Model Based Class Incremental Learningcited by 9
- 2025Order-Robust Class Incremental Learning: Graph-Driven Dynamic Similarity Groupingcited by 7
- 2025ErrorEraser: Unlearning Data Bias for Improved Continual Learningcited by 3
- 2025Exploring Open-world Continual Learning with Knowns-Unknowns Knowledge Transfercited by 2
- 2025CLDyB: Towards Dynamic Benchmarking for Continual Learning with Pre-trained Modelscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.