Cited by 115Domain Adaptation and Few-Shot LearningAdvanced Neural Network ApplicationsAdvanced Image and Video Retrieval Techniques

MgSvF: Multi-Grained Slow versus Fast Framework for Few-Shot Class-Incremental Learning

Zhao, Hanbin, Fu, Yongjian, Kang, Mintong, Tian, Qi, Wu, Fei, Li, Xi·2024·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

As a challenging problem, few-shot class-incremental learning (FSCIL) continually learns a sequence of tasks, confronting the dilemma between slow forgetting of old knowledge and fast adaptation to new knowledge. In this paper, we concentrate on this "slow versus fast" (SvF) dilemma to determine which knowledge components to be updated in a slow fashion or a fast fashion, and thereby balance old-knowledge preservation and new-knowledge adaptation. We propose a multi-grained SvF learning strategy to cope with the SvF dilemma from two different grains: intra-space (within the same feature space) and inter-space (between two different feature spaces). The proposed strategy designs a novel frequency-aware regularization to boost the intra-space SvF capability, and meanwhile develops a new feature space composition operation to enhance the inter-space SvF learning performance. With the multi-grained SvF learning strategy, our method outperforms the state-of-the-art approaches by a large margin.

Integrity signals

Registry

Crossref · 10.1109/tpami.2021.3133897

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • FSCIL has two main frameworks: one uses a feature extractor with a softmax classifier, and the other involves a feature embedding network and the nearest class mean classifier.

    “FSCIL has two main frameworks, as shown in Fig. 6. The first uses a feature extractor with a softmax classifier, while the second involves a feature embedding network and the nearest class mean classifier [22, 42, 43].”
  • Low-frequency information may contribute more to preserving old knowledge.

    “It was found that low-frequency information may contribute more to preserving old knowledge.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhao, H., Fu, Y., Kang, M., Tian, Q., Wu, F., & Li, X.
Affiliations
  • Zhejiang University (CN)
  • Huawei Technologies (China) (CN)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2024-03
Volume
46
Issue
3
Pages
1576-1588
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W3113584014
Cited by
115
References
10
Citations by year
2026: 18 · 2025: 47 · 2024: 32 · 2023: 11 · 2022: 5 · 2021: 2
FWCI
4.38
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Key Research and Development Program of China (2020AAA0107400)
  • National Natural Science Foundation of China (U20A20222, 61972071, U20A20184)
  • Zhejiang Provincial Natural Science Foundation of China (LR19F020004)
  • Key Scientific Technological Innovation Research Project
  • Zhejiang University K.P.Chao's High Technology Development Foundation
  • Zhejiang Lab's Open Fund (2020AA3AB14)
  • Zhejiang Laboratory (2019KD0AB02)
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 › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
Keywords
few-shot class-incremental learning, catastrophic forgetting, continual learning, knowledge preservation

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.

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