Fixed Random Classifier Rearrangement for Continual Learning
Not on the map. Why?
Abstract (arXiv)
With the explosive growth of data, continual learning capability is increasingly important for neural networks. Due to catastrophic forgetting, neural networks inevitably forget the knowledge of old tasks after learning new ones. In visual classification scenario, a common practice of alleviating the forgetting is to constrain the backbone. However, the impact of classifiers is underestimated. In this paper, we analyze the variation of model predictions in sequential binary classification tasks and find that the norm of the equivalent one-class classifiers significantly affects the forgetting level. Based on this conclusion, we propose a two-stage continual learning algorithm named Fixed Random Classifier Rearrangement (FRCR). In first stage, FRCR replaces the learnable classifiers with fixed random classifiers, constraining the norm of the equivalent one-class classifiers without affecting the performance of the network. In second stage, FRCR rearranges the entries of new classifiers to implicitly reduce the drift of old latent representations. The experimental results on multiple datasets show that FRCR significantly mitigates the model forgetting; subsequent experimental analyses further validate the effectiveness of the algorithm.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 23 Feb 2024.
Builds on
25 of 35 references.
References · 25
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2016Progressive Neural Networkscited by 1,361
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 372
- 2019Orthogonal Gradient Descent for Continual Learningcited by 369
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 364
13 more
- 2020Understanding the Role of Training Regimes in Continual Learningcited by 180
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 145
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 124
- 2022Inducing Neural Collapse in Imbalanced Learning: Do We Really Need a Learnable Classifier at the End of Deep Neural Network?cited by 100
- 2021GCR: Gradient Coreset Based Replay Buffer Selection For Continual Learningcited by 95
- 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
- 2023No Fear of Classifier Biases: Neural Collapse Inspired Federated Learning with Synthetic and Fixed Classifiercited by 55
- 2023PCR: Proxy-based Contrastive Replay for Online Class-Incremental Continual Learningcited by 52
- 2023Achieving a Better Stability-Plasticity Trade-off via Auxiliary Networks in Continual Learningcited by 41
- 2020Effects of Parameter Norm Growth During Transformer Training: Inductive Bias from Gradient Descentcited by 40
- 2021Towards Better Plasticity-Stability Trade-off in Incremental Learning: A Simple Linear Connectorcited by 34
- 2022Meta-attention for ViT-backed Continual Learningcited by 29
- 2023Forget-free Continual Learning with Soft-Winning SubNetworkscited by 5
Built on by
Not cited yet.