Papers › FOSTER: Feature Boosting and Compression for Class-Incremental Learning

FOSTER: Feature Boosting and Compression for Class-Incremental Learning

10 Apr 2022arXiv:2204.04662archive 2025-07-28

Fu-Yun Wang, Da-Wei Zhou, Han-Jia Ye, De-Chuan Zhan

The ability to learn new concepts continually is necessary in this ever-changing world. However, deep neural networks suffer from catastrophic forgetting when learning new categories. Many works have been proposed to alleviate this phenomenon, whereas most of them either fall into the stability-plasticity dilemma or take too much computation or storage overhead. Inspired by the gradient boosting algorithm to gradually fit the residuals between the target model and the previous ensemble model, we propose a novel two-stage learning paradigm FOSTER, empowering the model to learn new categories adaptively. Specifically, we first dynamically expand new modules to fit the residuals between the target and the output of the original model. Next, we remove redundant parameters and feature dimensions through an effective distillation strategy to maintain the single backbone model. We validate our method FOSTER on CIFAR-100 and ImageNet-100/1000 under different settings. Experimental results show that our method achieves state-of-the-art performance. Code is available at: https://github.com/G-U-N/ECCV22-FOSTER.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2204.04662")

Code

Syntology Ran 2 of 8 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 2 ran with no contract checked.

By repository: official repository: 8 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

G-U-N/ECCV22-FOSTER officialmentioned in papermentioned on GitHubpytorch report
g-u-n/pycil mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 2 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran
6unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from G-U-N/ECCV22-FOSTER. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

CifarResNet G-U-N/ECCV22-FOSTER/models/foster.py official repository ran · metamorphic tier: deterministic MIT (permissive) · a2989710a793436e · report
resnet32 G-U-N/ECCV22-FOSTER/models/foster.py official repository ran MIT (permissive) · dff6861d5062f441 · report
BaseLearner G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · 1afda64d8a5c5708 · report
FOSTER G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · 96a31524768b2656 · report
FOSTERNet G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · b0894f0cc1dd3e52 · report
ResNet G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · 8af98f7f67a0fdda · report
_resnet G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · 67c778a4fecccfd5 · report
get_convnet G-U-N/ECCV22-FOSTER/models/foster.py official repository unverified MIT (permissive) · 4cad458166ad5417 · report

Tasks

Class Incremental LearningIncremental Learningclass-incremental learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Incremental Learning CIFAR-100 - 50 classes + 10 steps of 5 classes FOSTER Average Incremental Accuracy 67.95 #5 of 13 Archive leaderboard report
Incremental Learning CIFAR-100 - 50 classes + 25 steps of 2 classes FOSTER Average Incremental Accuracy 63.83 #3 of 5 Archive leaderboard report
Incremental Learning CIFAR-100 - 50 classes + 5 steps of 10 classes FOSTER Average Incremental Accuracy 69.46 #5 of 15 Archive leaderboard report
Incremental Learning CIFAR100-B0(10steps of 10 classes) FOSTER Average Incremental Accuracy 72.9 #5 of 6 Archive leaderboard report
Incremental Learning CIFAR100B020Step(5ClassesPerStep) FOSTER Average Incremental Accuracy 70.65 #5 of 5 Archive leaderboard report
Incremental Learning ImageNet - 10 steps FOSTER Average Incremental Accuracy 68.34 #4 of 10 Archive leaderboard report
Incremental Learning ImageNet-100 - 50 classes + 10 steps of 5 classes FOSTER Average Incremental Accuracy 77.54 #3 of 5 Archive leaderboard report
Incremental Learning ImageNet-100 - 50 classes + 25 steps of 2 classes FOSTER Average Incremental Accuracy 69.34 #2 of 3 Archive leaderboard report
Incremental Learning ImageNet-100 - 50 classes + 5 steps of 10 classes FOSTER Average Incremental Accuracy 80.22 #1 of 5 Archive leaderboard report
Incremental Learning ImageNet100 - 10 steps FOSTER Average Incremental Accuracy 77.75 #3 of 13 Archive leaderboard report
Incremental Learning ImageNet100 - 20 steps FOSTER Average Incremental Accuracy 74.49 #1 of 1 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Knowledge Distillation

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