Browse State-of-the-Art › class-incremental learning
class-incremental learning
281 papers with code · 1 benchmark · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| cifar100 (1 row) | EWC | Overcoming catastrophic forgetting in neural networks | code | Syntology ran 14 of 22 samples · 8 unverified | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 281 papers with code (617 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
2 Dec 2016 29 repositories listed Syntology ran 14 of 22 samples · 8 unverified · 4 pointer-only (licence)The ability to learn tasks in a sequential fashion is crucial to the development of artificial intelligence.
-
23 Nov 2016 10 repositories listed Syntology ran 3 of 14 samples · 11 unverified · 3 pointer-only (licence)A major open problem on the road to artificial intelligence is the development of incrementally learning systems that learn about more and more concepts over time from a stream of data.
-
15 Apr 2019 8 repositories listed Syntology ran 0 of 2 samples · 2 unverifiedStandard artificial neural networks suffer from the well-known issue of catastrophic forgetting, making continual or lifelong learning difficult for machine learning.
-
16 Dec 2021 5 repositories listed Syntology ran 10 of 11 samples · 1 unverified · 10 pointer-only (licence)The mainstream paradigm behind continual learning has been to adapt the model parameters to non-stationary data distributions, where catastrophic forgetting is the central challenge.
-
8 Jul 2019 5 repositories listedIdeally, continual learning should be triggered by the availability of short videos of single objects and performed on-line on on-board hardware with fine-grained updates.
-
30 May 2019 5 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)We believe this is because of the combination of two factors: (a) the data imbalance between the old and new classes, and (b) the increasing number of visually similar classes.
-
20 Mar 2019 5 repositories listedTo prevent forgetting, a replay buffer is usually employed to store the previous data for the purpose of rehearsal.
-
24 May 2017 5 repositories listedAttempts to train a comprehensive artificial intelligence capable of solving multiple tasks have been impeded by a chronic problem called catastrophic forgetting.
-
14 Jan 2023 4 repositories listed Syntology ran 2 of 4 samples · 2 unverified · 4 pointer-only (licence)Class-Incremental Learning (CIL) [40] trains classifiers under a strict memory budget: in each incremental phase, learning is done for new data, most of which is abandoned to free space for the next phase.
-
1 Apr 2021 4 repositories listed Syntology ran 3 of 14 samples · 11 unverifiedLearning continually from non-stationary data streams is a long-standing goal and a challenging problem in machine learning.
-
10 Jul 2018 4 repositories listed Syntology ran 9 of 13 samples · 4 unverified · 12 pointer-only (licence)Detecting test samples drawn sufficiently far away from the training distribution statistically or adversarially is a fundamental requirement for deploying a good classifier in many real-world machine learning…
-
11 Mar 2025 3 repositories listedIn this paper, we introduce ExterNal knowledGe INjEction (ENGINE) for CLIP-based CIL.
-
25 Sep 2023 3 repositories listed Syntology ran 11 of 21 samples · 10 unverifiedHowever, when learning from non-stationary data, we observe that the Euclidean metric is suboptimal and that feature distributions are heterogeneous.
-
13 Mar 2023 3 repositories listedIn this work, we revisit CIL with PTMs and argue that the core factors in CIL are adaptivity for model updating and generalizability for knowledge transferring.
-
7 Feb 2023 3 repositories listedDeep models, e.
-
20 Aug 2022 3 repositories listedInstead of using the saved samples in memory to update the network for previous tasks/classes in the existing approach, MORE leverages the saved samples to build a task specific classifier (adding a new classification…
-
22 Mar 2021 3 repositories listedOnline class-incremental continual learning (CL) studies the problem of learning new classes continually from an online non-stationary data stream, intending to adapt to new data while mitigating catastrophic forgetting.
-
1 Aug 2020 3 repositories listedWe discuss a general formulation for the Continual Learning (CL) problem for classification---a learning task where a stream provides samples to a learner and the goal of the learner, depending on the samples it…
-
15 Apr 2020 3 repositories listedContinual Learning has inspired a plethora of approaches and evaluation settings; however, the majority of them overlooks the properties of a practical scenario, where the data stream cannot be shaped as a sequence of…
-
2 Dec 2018 3 repositories listed Syntology ran 1 of 12 samples · 11 unverifiedIn lifelong learning, the learner is presented with a sequence of tasks, incrementally building a data-driven prior which may be leveraged to speed up learning of a new task.
-
9 Jan 2025 2 repositories listedTo this end, we propose Continuous Knowledge-Preserving Decomposition for FSCIL (CKPD-FSCIL), a framework that decomposes a model's weights into two parts: one that compacts existing knowledge (knowledge-sensitive…
-
12 Dec 2024 2 repositories listed Syntology ran 6 of 17 samples · 11 unverified · 12 pointer-only (licence)Class-Incremental Learning (CIL) requires models to continually acquire knowledge of new classes without forgetting old ones.
-
19 Aug 2024 2 repositories listedTo solve this problem, we propose an analytic imbalance rectifier algorithm (AIR), a novel online exemplar-free continual learning method with an analytic (i.
-
7 Jun 2024 2 repositories listedOne method for incremental class learning, addressing dataset imbalance, is rehearsal using previously stored data.
-
23 Mar 2024 2 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)The GACL adopts analytic learning (a gradient-free training technique) and delivers an analytical (i.
-
10 Mar 2024 2 repositories listedFew-shot Class-Incremental Learning (FSCIL) poses the challenge of retaining prior knowledge while learning from limited new data streams, all without overfitting.
-
2 Feb 2024 2 repositories listedThe latter is a gated incremental classifier, helping the model modify past predictions without directly interfering with them.
-
1 Jan 2024 2 repositories listedFederated Learning (FL) enables collaborative model training among participants while guaranteeing the privacy of raw data.
-
28 Dec 2023 2 repositories listedTo address the above challenges, we introduce the FILP-3D framework with two novel components: the Redundant Feature Eliminator (RFE) for feature space misalignment and the Spatial Noise Compensator (SNC) for…
-
19 Dec 2023 2 repositories listed Syntology ran 7 of 15 samples · 8 unverifiedInspired by the Lottery Ticket Hypothesis (LTH), which highlights the existence of efficient subnetworks within larger, dense networks, a high-performing Winning Subnetwork (WSN) in terms of task performance under…
Syntology lines on 13 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections