Pith. Sign in

RECORD

GACL: Exemplar-Free Generalized Analytic Continual Learning

Machine Learning · Submitted 23 Mar 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Empirically, we conduct extensive experiments where, compared with existing GCIL methods, our GACL exhibits a consistently leading performance across various datasets and GCIL settings.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2403.15706 (version 3)
Pith IDPK2DL4BM, Pith's permanent record of this paper and its review
CitationCen Chen, Di Fang, Hongxin Wei, Huiping Zhuang, Kai Tong, Run He, Yizhu Chen, Ziqian Zeng. "GACL: Exemplar-Free Generalized Analytic Continual Learning." arXiv:2403.15706 (2024). https://pith.science/paper/PK2DL4BM
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,546 input tokens.

What the abstract itself states, as probabilities: claims first 0.11 · states limitation 0.07 · human participants 0.03 · controlled comparison 0.73 · randomized assignment 0.01 · states quantitative result 0.05 · compares with prior results 0.97 · mentions code or data availability 0.99.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

Class incremental learning (CIL) trains a network on sequential tasks with separated categories in each task but suffers from catastrophic forgetting, where models quickly lose previously learned knowledge when acquiring new tasks. The generalized CIL (GCIL) aims to address the CIL problem in a more real-world scenario, where incoming data have mixed data categories and unknown sample size distribution. Existing attempts for the GCIL either have poor performance or invade data privacy by saving exemplars. In this paper, we propose a new exemplar-free GCIL technique named generalized analytic continual learning (GACL). The GACL adopts analytic learning (a gradient-free training technique) and delivers an analytical (i.e., closed-form) solution to the GCIL scenario. This solution is derived via decomposing the incoming data into exposed and unexposed classes, thereby attaining a weight-invariant property, a rare yet valuable property supporting an equivalence between incremental learning and its joint training. Such an equivalence is crucial in GCIL settings as data distributions among different tasks no longer pose challenges to adopting our GACL. Theoretically, this equivalence property is validated through matrix analysis tools. Empirically, we conduct extensive experiments where, compared with existing GCIL methods, our GACL exhibits a consistently leading performance across various datasets and GCIL settings. Source code is available at https://github.com/CHEN-YIZHU/GACL.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Class incremental learning (CIL) trains a network on sequential tasks with separated categories in each task but suffers from catastrophic forgetting, where models quickly lose previously learned knowledge when acquiring new tasks. background 1.00 0.06 0.02 asserted 1.00
s1 The generalized CIL (GCIL) aims to address the CIL problem in a more real-world scenario, where incoming data have mixed data categories and unknown sample size distribution. background 0.99 0.06 0.03 asserted 1.00
s2 Existing attempts for the GCIL either have poor performance or invade data privacy by saving exemplars. gap 0.89 0.04 0.03 asserted 1.00
s3 In this paper, we propose a new exemplar-free GCIL technique named generalized analytic continual learning (GACL). contribution 0.99 0.89 0.11 asserted 1.00
s4 The GACL adopts analytic learning (a gradient-free training technique) and delivers an analytical (i.e., closed-form) solution to the GCIL scenario. method 0.91 0.89 0.11 asserted 1.00
s5 This solution is derived via decomposing the incoming data into exposed and unexposed classes, thereby attaining a weight-invariant property, a rare yet valuable property supporting an equivalence between incremental learning and its joint training. method 0.90 0.95 0.19 asserted 1.00
s6 Such an equivalence is crucial in GCIL settings as data distributions among different tasks no longer pose challenges to adopting our GACL. interpretation 0.97 0.58 0.15 asserted 1.00
s7 Theoretically, this equivalence property is validated through matrix analysis tools. method 0.43 0.88 0.06 asserted 1.00
s8 Empirically, we conduct extensive experiments where, compared with existing GCIL methods, our GACL exhibits a consistently leading performance across various datasets and GCIL settings. result 1.00 0.97 0.71 asserted 1.00
s9 Source code is available at https://github.com/CHEN-YIZHU/GACL. contribution 0.63 0.34 0.02 asserted 0.94

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.97.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Class incremental learning (CIL) trains a network on sequential tasks with separated categories in each task but suffers from catastrophic forgetting, where models quickly lose previously learned knowledge when acquiring new tasks. The generalized CIL (GCIL) aims to address the CIL problem in a more real-world scenario, where incoming data have mixed data categories and unknown sample size distribution. Existing attempts for the GCIL either have poor performance or invade data privacy by saving exemplars. In this paper, we propose a new exemplar-free GCIL technique named generalized analytic continual learning (GACL). The GACL adopts analytic learning (a gradient-free training technique) and delivers an analytical (i.e., closed-form) solution to the GCIL scenario. This solution is derived via decomposing the incoming data into exposed and unexposed classes, thereby attaining a weight-invariant property, a rare yet valuable property supporting an equivalence between incremental learning and its joint training. Such an equivalence is crucial in GCIL settings as data distributions among different tasks no longer pose challenges to adopting our GACL. Theoretically, this equivalence property is validated through matrix analysis tools. Empirically, we conduct extensive experiments where, compared with existing GCIL methods, our GACL exhibits a consistently leading performance across various datasets and GCIL settings. Source code is available at https://github.com/CHEN-YIZHU/GACL.

Human review
References
How the literature uses it

3 arXiv papers cite this in 6 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 5 sentences without a confident label

Uses its method or tool 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.