Bypassing Logits Bias in Online Class-Incremental Learning with a Generative Framework
Not on the map. Why?
Abstract (arXiv)
Continual learning requires the model to maintain the learned knowledge while learning from a non-i.i.d data stream continually. Due to the single-pass training setting, online continual learning is very challenging, but it is closer to the real-world scenarios where quick adaptation to new data is appealing. In this paper, we focus on online class-incremental learning setting in which new classes emerge over time. Almost all existing methods are replay-based with a softmax classifier. However, the inherent logits bias problem in the softmax classifier is a main cause of catastrophic forgetting while existing solutions are not applicable for online settings. To bypass this problem, we abandon the softmax classifier and propose a novel generative framework based on the feature space. In our framework, a generative classifier which utilizes replay memory is used for inference, and the training objective is a pair-based metric learning loss which is proven theoretically to optimize the feature space in a generative way. In order to improve the ability to learn new data, we further propose a hybrid of generative and discriminative loss to train the model. Extensive experiments on several benchmarks, including newly introduced task-free datasets, show that our method beats a series of state-of-the-art replay-based methods with discriminative classifiers, and reduces catastrophic forgetting consistently with a remarkable margin.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 19 May 2022.
Builds on
25 of 41 references.
References · 25
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 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
- 2019Large Scale Incremental Learningcited by 727
- 2019Three scenarios for continual learningcited by 610
- 2019Gradient based sample selection for online continual learningcited by 568
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
13 more
- 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
- 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
- 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
- 2017No Fuss Distance Metric Learning using Proxiescited by 225
- 2018Task-Free Continual Learningcited by 219
- 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
- 2020A Neural Dirichlet Process Mixture Model for Task-Free Continual Learningcited by 133
- 2019A continual learning survey: Defying forgetting in classification taskscited by 118
- 2020A unifying mutual information view of metric learning: cross-entropy vs. pairwise lossescited by 100
- 2020Task Agnostic Continual Learning Using Online Variational Bayes with Fixed-Point Updatescited by 34
- 2017Generative and Discriminative Text Classification with Recurrent Neural Networkscited by 30
- 2020Discriminatively-Tuned Generative Classifiers for Robust Natural Language Inferencecited by 4
Built on by
Not cited yet.