CoChat

Few-Shot Class-Incremental Learning for Classification and Object Detection: A Survey

Open access
Zhang, Jinghua, Liu, Li, Silvén, Olli, Pietikäinen, Matti, Hu, Dewen · 2025 · IEEE Transactions on Pattern Analysis and Machine Intelligence

The DOI matches its Crossref record; 123 of the 123 references it cites were found in a registry or an index; 54 of the 100 sources its claims cite were checked for support.

Abstract

Few-shot Class-Incremental Learning (FSCIL) presents a unique challenge in Machine Learning (ML), as it necessitates the Incremental Learning (IL) of new classes from sparsely labeled training samples without forgetting previous knowledge. While this field has seen recent progress, it remains an active exploration area. This paper aims to provide a comprehensive and systematic review of FSCIL. In our in-depth examination, we delve into various facets of FSCIL, encompassing the problem definition, the discussion of the primary challenges of unreliable empirical risk minimization and the stability-plasticity dilemma, general schemes, and relevant problems of IL and Few-shot Learning (FSL). Besides, we offer an overview of benchmark datasets and evaluation metrics. Furthermore, we introduce the Few-shot Class-incremental Classification (FSCIC) methods from data-based, structure-based, and optimization-based approaches and the Few-shot Class-incremental Object Detection (FSCIOD) methods from anchor-free and anchor-based approaches. Beyond these, we present several promising research directions within FSCIL that merit further investigation.

Overview

CoChat Summary

TL;DR

This survey systematically reviews few-shot class-incremental learning (FSCIL) for classification and object detection, covering definitions, challenges, datasets, metrics, methods, and future directions. It organizes FSCIC methods into data-, structure-, and optimization-based approaches and FSCIOD methods into anchor-free and anchor-based approaches.

Key findings

  • FSCIL’s core challenges are unreliable empirical risk minimization under N-way K-shot incremental sessions and the stability-plasticity dilemma; FSCIL is a subdomain of CIL but adds scarce incremental samples and sustained unreliable risk minimization.
  • For FSCIC, top base-session accuracy on mini ImageNet includes SAVC (81.12%), ALICE (80.60%), BiDistFSCIL (74.65%), TEEN (73.53%), and CLOM (73.08%); on CIFAR-100, WaRP (80.31%), BiDistFSCIL (79.45%), ALICE (79.00%), SAVC (78.77%), and TEEN (74.92%); on CUB-200, SAVC (81.85%), F2M and FSIL-GAN (81.07%), DSN (80.86%), and BiDistFSCIL (79.12%).
  • Lowest performance dropping (PD) on mini ImageNet: MgSvF (17.33%), SFbFSCIL (19.14%), SPPR (19.53%), ERL++ (20.94%), and DSN (21.06%); on CIFAR-100: F2M (20.04%), SFbFSCIL (20.31%), SPPR (20.65%), TEEN (22.28%), and FACT (22.50%); on CUB-200: ALICE (17.30%), DSN (17.65%), MgSvF (17.96%), TEEN (18.13%), and BiDistFSCIL (18.19%).
  • For FSCIOD, top base-class methods are Sylph, iFS-RCNN, and MCH; top novel-COCO methods are iFS-RCNN, Incremental-DETR, and iMTFA; top overall COCO methods are iFS-RCNN, Sylph, and MCH; top cross-dataset VOC methods are Incremental-DETR, BPMCH, and MCH.

Methods

  • Systematic literature survey of deep FSCIL in computer vision, focused on classification and object detection; covers problem definition, core challenges, general schemes, related IL/FSL problems, benchmark datasets, evaluation metrics, method taxonomy, performance comparisons, and future directions.
  • Proposes taxonomy: FSCIC methods from data-based (data replay, pseudo scenarios), structure-based (dynamic structure, attention), and optimization-based (representation learning, knowledge distillation, meta-learning, other) approaches; FSCIOD methods from anchor-free (CenterNet-, FCOS-, DETR-based) and anchor-based (Mask R-CNN) frameworks.
  • Performance comparison summarizes mainstream methods on mini ImageNet, CIFAR-100, and CUB-200 for classification and COCO/VOC for detection, extracting values from original papers and noting backbones and extra factors where possible.

Limitations

  • The paper states FSCIL lacks publicly available datasets and that current metrics (AA, PD; mAP, mAR, mAP50) do not fully capture detailed performance throughout continuous learning.
  • It states comparisons are biased by variability in backbone networks, additional data, and implementation conditions; not all methods are open-source, and performance values are extracted from original papers.
  • It states the current FSCIC setting is idealistic versus real-world needs, and FSCIOD research is insufficient, with performance far from practical application and non-unified evaluation metrics. As a survey, it presents no new experiments; this is evident from the text.

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

Integrity signals

Registry

Crossref · 10.1109/tpami.2025.3529038

Cites

123 of 123 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

39 Valid · 16 Not valid · 27 Not checked · 134 Own results and interpretations

56 more claims · 10 with their cited sources checked

Create a free account to see all 216 claims and to verify the 4 references still open.

See all claims — free account
  • Probably not a substantial claim. 127
  • It may state two separate claims as one. 74

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

2 of 2

Citations

Cites

Show all 123 references

Research works printed but not linked: 2

  1. Kim, Warping the space: Weight space rotation for class-incremental few-shot learning
  2. Neal, 2012, Bayesian Learning for Neural Networks, 118

Cited by

See all 84

Metadata

Authors
Zhang, J., Liu, L., Silvén, O., Pietikäinen, M., & Hu, D.
Affiliations
  • National University of Defense Technology (CN)
  • CMVS, University of Oulu, Oulu, Finland
  • University of Oulu (FI)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2025-04
Volume
47
Issue
4
Pages
2924-2945
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W4406354592
Cited by
84
References
123
Citations by year
2026: 58 · 2025: 24
FWCI
32.63
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (62036013, 62376283)
  • Science and Technology Innovation Program of Hunan Province (2024QK2006)
  • Key Stone (JS2023-03)
  • National University of Defense Technology
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 › Machine Learning and Data Classification
Keywords
few-shot class-incremental learning, class-incremental learning, few-shot learning, object detection, classification, catastrophic forgetting, stability-plasticity dilemma, benchmark dataset, evaluation metrics, anchor-free detection, anchor-based detection

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-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-29 (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: Few-Shot Class-Incremental Learning for Classification and Object Detection: A Survey. https://app.cochat.ai/papers/10.1109/tpami.2025.3529038
The paper
Zhang, J., Liu, L., Silvén, O., Pietikäinen, M., & Hu, D. (2025). Few-Shot Class-Incremental Learning for Classification and Object Detection: A Survey. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2025.3529038

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.