A Strategy for an Uncompromising Incremental Learner
Not on the map. Why?
Abstract (arXiv)
Multi-class supervised learning systems require the knowledge of the entire range of labels they predict. Often when learnt incrementally, they suffer from catastrophic forgetting. To avoid this, generous leeways have to be made to the philosophy of incremental learning that either forces a part of the machine to not learn, or to retrain the machine again with a selection of the historic data. While these hacks work to various degrees, they do not adhere to the spirit of incremental learning. In this article, we redefine incremental learning with stringent conditions that do not allow for any undesirable relaxations and assumptions. We design a strategy involving generative models and the distillation of dark knowledge as a means of hallucinating data along with appropriate targets from past distributions. We call this technique, phantom sampling.We show that phantom sampling helps avoid catastrophic forgetting during incremental learning. Using an implementation based on deep neural networks, we demonstrate that phantom sampling dramatically avoids catastrophic forgetting. We apply these strategies to competitive multi-class incremental learning of deep neural networks. Using various benchmark datasets and through our strategy, we demonstrate that strict incremental learning could be achieved. We further put our strategy to test on challenging cases, including cross-domain increments and incrementing on a novel label space. We also propose a trivial extension to unbounded-continual learning and identify potential for future development.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 4; 2023: 1.
9 papers.
- 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 120
- 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Taskscited by 80
- 2022Learning with Recoverable Forgettingcited by 29
- 2021Unsupervised Continual Learning Via Pseudo Labelscited by 18
- 2021Online Continual Learning Via Candidates Votingcited by 15
- 2022Cold Start Streaming Learning for Deep Networkscited by 3
- 2023PointCLIMB: An Exemplar-Free Point Cloud Class Incremental Benchmarkcited by 3
- 2022A Comparative Study of Calibration Methods for Imbalanced Class Incremental Learningcited by 2
- 2021DILF-EN framework for Class-Incremental Learningcited by 0
- 2023PointCLIMB: An Exemplar-Free Point Cloud Class Incremental Benchmark13 Apr 2023
- 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learning23 Nov 2022
- 2022Cold Start Streaming Learning for Deep Networks9 Nov 2022
- 2022Learning with Recoverable Forgetting17 Jul 2022
- 2022A Comparative Study of Calibration Methods for Imbalanced Class Incremental Learning1 Feb 2022
- 2021DILF-EN framework for Class-Incremental Learning23 Dec 2021
- 2021Continual Learning of a Mixed Sequence of Similar and Dissimilar Tasks18 Dec 2021
- 2021Online Continual Learning Via Candidates Voting17 Oct 2021
- 2021Unsupervised Continual Learning Via Pseudo Labels14 Apr 2021