CoChat

A Comprehensive Study of Class Incremental Learning Algorithms for Visual Tasks

Open access
Belouadah, Eden, Popescu, Adrian, Kanellos, Ioannis · 2020 · arXiv

The DOI matches its DataCite record; 102 of the 102 references it cites were found in a registry or an index; 43 of the 89 sources its claims cite were checked for support.

Abstract

The ability of artificial agents to increment their capabilities when\nconfronted with new data is an open challenge in artificial intelligence. The\nmain challenge faced in such cases is catastrophic forgetting, i.e., the\ntendency of neural networks to underfit past data when new ones are ingested. A\nfirst group of approaches tackles forgetting by increasing deep model capacity\nto accommodate new knowledge. A second type of approaches fix the deep model\nsize and introduce a mechanism whose objective is to ensure a good compromise\nbetween stability and plasticity of the model. While the first type of\nalgorithms were compared thoroughly, this is not the case for methods which\nexploit a fixed size model. Here, we focus on the latter, place them in a\ncommon conceptual and experimental framework and propose the following\ncontributions: (1) define six desirable properties of incremental learning\nalgorithms and analyze them according to these properties, (2) introduce a\nunified formalization of the class-incremental learning problem, (3) propose a\ncommon evaluation framework which is more thorough than existing ones in terms\nof number of datasets, size of datasets, size of bounded memory and number of\nincremental states, (4) investigate the usefulness of herding for past\nexemplars selection, (5) provide experimental evidence that it is possible to\nobtain competitive performance without the use of knowledge distillation to\ntackle catastrophic forgetting and (6) facilitate reproducibility by\nintegrating all tested methods in a common open-source repository. The main\nexperimental finding is that none of the existing algorithms achieves the best\nresults in all evaluated settings. Important differences arise notably if a\nbounded memory of past classes is allowed or not.\n

Overview

CoChat Summary

TL;DR

This paper provides a comparative study of class incremental learning (IL) methods for visual tasks under a unified formalization and evaluation protocol. It finds that no single algorithm is best in all settings, and that the best choice depends strongly on whether a bounded memory of past classes is available.

Key findings

  • With memory allowed, the strongest overall results came from methods that treat class IL as an imbalanced learning problem: the paper reports FT th as best overall with GIL = -3.62, followed by ScaIL (-3.70), BiC (-4.03), and LUCIR CNN (-4.13).
  • In the memory setting, the authors report that vanilla FT can outperform iCaRL globally: FT has GIL = -5.19 versus iCaRL’s -7.36; they also state that FT is globally better than iCaRL by over 2 GIL points.
  • Without memory, fixed-representation methods are reported to be much more competitive than fine-tuning methods; the best global score is said to come from DeeSIL, followed by Deep-SLDA, FR, and REMIND.
  • Herding-based exemplar selection outperformed random selection for all methods tested in the reported experiments, though the gain varied by method.

Methods

  • The paper compares class incremental learning algorithms in a common conceptual and experimental framework, focusing on methods for constant model complexity with bounded or no memory of past classes.
  • Experiments use four datasets: ILSVRC (1,231,167 train / 50,000 test), VGGFACE2 (491,746 / 50,000), LANDMARKS (374,367 / 20,000), and CIFAR100 (50,000 / 10,000).
  • Evaluation uses a ResNet-18 backbone with SGD, top-5 accuracy averaged over incremental states, and the Incremental Learning Gap (GIL) across configurations with varying numbers of states (T = 10, 20, 50) and memory sizes (including K = 2%, 1%, 0.5%, and K = 0 in the no-memory case).

Limitations

  • The paper states that the evaluation scenario is still simplified and recommends future work on more realistic settings: no assumption of readily annotated incoming data, variable numbers of classes per incremental state, and imbalanced datasets.
  • The authors note that their conclusions are limited to the tested setting of fixed-complexity visual class incremental learning; methods that grow model capacity, generative replay methods, and some online approaches are discussed but not evaluated under this protocol.
  • Evident from the text: the study is constrained to four datasets and a specific set of algorithm families, so the findings may not generalize beyond the tested visual tasks and configurations.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

DataCite · 10.48550/arxiv.2011.01844

Cites

102 of 102 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

28 Valid · 3 Not valid · 29 Not checked · 127 Own results and interpretations

106 more claims · 6 with their cited sources checked

Create a free account to see all 187 claims and to verify the 12 references still open.

See all claims — free account
  • It may state two separate claims as one. 52
  • Probably not a substantial claim. 27
  • The quote only partly states this claim. 2

Create a free account to see these claims.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 102 references

Research works printed but not linked: 4

  1. [19][19] Fritzke, B., 1994b. A growing neural gas network learns topologies, in: Tesauro, G., Touretzky, D.S., Leen, T.K. (Eds.), Advances in Neural Information Processing Systems 7, [NIPS Conference, Denver, Colorado, USA, 1994], MIT Press. pp. 625-632. -
  2. [70][70] Tao, X., Chang, X., Hong, X., Wei, X., Gong, Y., 2020a. Topologypreserving class-incremental learning, in: Vedaldi, A., Bischof, H., Brox, T., Frahm, J. (Eds.), Computer Vision - ECCV 2020 - 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIX, Springer. pp. 254-270. -
  3. [73][73] Wang, Y., Ramanan, D., Hebert, M., 2017. Growing a brain: Finetuning by increasing model capacity, in: Conference on Computer Vision and Pattern Recognition. -
  4. [80][80] Yu, L., Twardowski, B., Liu, X., Herranz, L., Wang, K., Cheng, Y., Jui, S., van de Weijer, J., 2020. Semantic drift compensation for classincremental learning, in: 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2020, Seattle, WA, USA, June 13-19, 2020, IEEE. pp. 6980-6989. -

Cited by

See all 258

Metadata

Authors
Belouadah, E., Popescu, A., & Kanellos, I.
Affiliations
  • Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR)
  • IMT Atlantique (FR)
Corresponding author
Popescu, Adrian
Venue
arXiv
Publisher
arXiv
Published
2020
Volume
135
Pages
38-54
ISSN
0893-6080 (ISSN-L)
OpenAlex
W3096398238
Cited by
235
References
86
Citations by year
2026: 28 · 2025: 40 · 2024: 61 · 2023: 58 · 2022: 32 · 2021: 16
FWCI
0.91
Type
journal article
Language
en
Open access
Locations
  • Neural Networks (acceptedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion, cc-by-nc)
  • Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
European Commission (951911, HORIZON2020)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Data Stream Mining Techniques
Keywords
class-incremental learning, catastrophic forgetting, stability-plasticity balance, herding behavior, knowledge distillation, evaluation framework, reproducibility, open-source repositories, visual task
MeSH terms
Algorithms, Artificial Intelligence, Humans, Memory, Psychomotor Performance, Visual Perception, Reproducibility of Results, Neural Networks, Computer

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Comprehensive Study of Class Incremental Learning Algorithms for Visual Tasks. https://app.cochat.ai/papers/10.48550/arxiv.2011.01844
The paper
Belouadah, E., Popescu, A., & Kanellos, I. (2020). A Comprehensive Study of Class Incremental Learning Algorithms for Visual Tasks. arXiv. https://doi.org/10.48550/arxiv.2011.01844

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.