mlsanityData to 7 Oct 2026

Width Expansion as a Method for Class Incremental Learning

arXiv 2609.37702 ↗First posted 29 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Class Incremental Learning (Class-IL) requires models to learn new classes over time while preserving previously acquired knowledge without access to past data or task identity. This setting intensifies the stability-plasticity dilemma and makes catastrophic forgetting a central challenge. Existing approaches include regularization, knowledge distillation, replay, and architectural expansion. However, many expansion methods rely on explicit task identifiers or predefined growth strategies, limiting their applicability when task boundaries are unavailable at inference time. This work proposes a dynamic width expansion method that increases the number of neurons within existing layers according to a normalized loss criterion, without requiring task-specific information. An attention mechanism with persistent key-value memory is also incorporated to stabilize feature representations and reduce interference between previously learned and newly introduced classes. The approach is evaluated on Split MNIST and Split CIFAR-100 under the standard Class-IL protocol. Experiments compare fixed-capacity and dynamically expanding architectures, both with and without attention, combined with established continual learning methods including EWC, LwF, and A-GEM. Results show that progressive width expansion consistently improves performance over fixed architectures, particularly when combined with functional methods and A-GEM. The combination of width expansion and attention provides the most consistent gains. Overall, dynamic width expansion based on representational demand provides an effective and flexible strategy for Class-IL, although uncontrolled growth may increase overfitting and computational cost.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 25 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

12 of 25 references.

References · 12

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2016Learning without Forgettingcited by 2,465
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  4. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
  5. 2018Experience Replay for Continual Learningcited by 1,074
  6. 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,061
  7. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  8. 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
  9. 2018Learning without Memorizingcited by 249
  10. 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
  11. 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
  12. 2022Forward Compatible Few-Shot Class-Incremental Learningcited by 125

Built on by

Not cited yet.