Papers › Resurrecting Old Classes with New Data for Exemplar-Free Continual Learning

Resurrecting Old Classes with New Data for Exemplar-Free Continual Learning

29 May 2024CVPR 2024 1arXiv:2405.19074archive 2025-07-28

Dipam Goswami, Albin Soutif--Cormerais, Yuyang Liu, Sandesh Kamath, Bartłomiej Twardowski, Joost Van de Weijer

Continual learning methods are known to suffer from catastrophic forgetting, a phenomenon that is particularly hard to counter for methods that do not store exemplars of previous tasks. Therefore, to reduce potential drift in the feature extractor, existing exemplar-free methods are typically evaluated in settings where the first task is significantly larger than subsequent tasks. Their performance drops drastically in more challenging settings starting with a smaller first task. To address this problem of feature drift estimation for exemplar-free methods, we propose to adversarially perturb the current samples such that their embeddings are close to the old class prototypes in the old model embedding space. We then estimate the drift in the embedding space from the old to the new model using the perturbed images and compensate the prototypes accordingly. We exploit the fact that adversarial samples are transferable from the old to the new feature space in a continual learning setting. The generation of these images is simple and computationally cheap. We demonstrate in our experiments that the proposed approach better tracks the movement of prototypes in embedding space and outperforms existing methods on several standard continual learning benchmarks as well as on fine-grained datasets. Code is available at https://github.com/dipamgoswami/ADC.

PaperPDFConference PDFCodeCode 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="2405.19074")

Code

Syntology Ran 4 of 9 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 2 ran · our draft was wrong; 1 ran · fixture could not drive it; 1 ran with no contract checked.

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

dipamgoswami/adc officialmentioned in papermentioned on GitHubpytorchMIT 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

9 samples harvested; 4 ran; 0 honoured the contract we drafted; 5 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 · our draft was wrong
1ran · fixture could not drive it
1ran
5unverified

Licence: 0 of the 9 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 dipamgoswami/ADC. “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.

Attack dipamgoswami/ADC/utils/attack.py official repository ran MIT (permissive) · a2e33094ba485ca1 · report
conv1x1 dipamgoswami/adc/convs/modified_represnet.py official repository ran · our draft was wrong MIT (permissive) · d5cd7ffe2dc51b21 · report
conv3x3 dipamgoswami/adc/convs/modified_represnet.py official repository ran · our draft was wrong MIT (permissive) · 1907f2ae25449f39 · report
reduce_proxies dipamgoswami/adc/convs/linears.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 4072283c98270784 · report
resnet18 dipamgoswami/adc/convs/ucir_resnet.py official repository unverified MIT (permissive) · 4742faeabce1f66b · report
resnet18 dipamgoswami/adc/convs/resnet.py official repository unverified MIT (permissive) · 313e3bcf86d1f964 · report
resnet18_cbam dipamgoswami/adc/convs/resnet_cbam.py official repository unverified MIT (permissive) · 80e6cbd05d914e9e · report
resnet18_rep dipamgoswami/adc/convs/modified_represnet.py official repository unverified MIT (permissive) · 6a8f78bbfd703db3 · report
resnet34_cbam dipamgoswami/adc/convs/resnet_cbam.py official repository unverified MIT (permissive) · e95668d4fbeb99a7 · report

Tasks

Continual LearningExemplar-Free

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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