Papers › FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learning

FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learning

25 Sep 2023NeurIPS 2023 11arXiv:2309.14062archive 2025-07-28

Dipam Goswami, Yuyang Liu, Bartłomiej Twardowski, Joost Van de Weijer

Exemplar-free class-incremental learning (CIL) poses several challenges since it prohibits the rehearsal of data from previous tasks and thus suffers from catastrophic forgetting. Recent approaches to incrementally learning the classifier by freezing the feature extractor after the first task have gained much attention. In this paper, we explore prototypical networks for CIL, which generate new class prototypes using the frozen feature extractor and classify the features based on the Euclidean distance to the prototypes. In an analysis of the feature distributions of classes, we show that classification based on Euclidean metrics is successful for jointly trained features. However, when learning from non-stationary data, we observe that the Euclidean metric is suboptimal and that feature distributions are heterogeneous. To address this challenge, we revisit the anisotropic Mahalanobis distance for CIL. In addition, we empirically show that modeling the feature covariance relations is better than previous attempts at sampling features from normal distributions and training a linear classifier. Unlike existing methods, our approach generalizes to both many- and few-shot CIL settings, as well as to domain-incremental settings. Interestingly, without updating the backbone network, our method obtains state-of-the-art results on several standard continual learning benchmarks. Code is available at https://github.com/dipamgoswami/FeCAM.

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="2309.14062")

Code

Syntology Ran 11 of 21 code samples harvested from 3 repositories linked to this paper; 10 have no recorded run. Of those that ran: 2 ran · honoured contract; 5 ran · our draft was wrong; 4 ran with no contract checked.

By repository: official repository: 15 samples from 1 repository, 10 ran; community (archive-listed): 6 samples from 2 repositories, 1 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/fecam officialmentioned in papermentioned on GitHubpytorchMIT report
gmum/hint mentioned on GitHubpytorch report
gmum/hyperinterval mentioned 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

21 samples harvested; 11 ran; 2 honoured the contract we drafted; 10 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 · honoured contract
5ran · our draft was wrong
4ran
10unverified

Licence: 0 of the 21 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 3 repositories linked to this paper, official or community; each sample names its own and says which. “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.

compute_common_cov dipamgoswami/FeCAM/utils/maha_utils.py official repository ran · honoured contract MIT (permissive) · c9427cae68d6444f · report
compute_new_common_cov dipamgoswami/FeCAM/utils/maha_utils.py official repository ran · honoured contract MIT (permissive) · 1de4ff97b038199a · report
conv1x1 dipamgoswami/fecam/convs/resnet.py official repository ran · our draft was wrong MIT (permissive) · d9def42110729a85 · report
conv1x1 dipamgoswami/fecam/convs/modified_represnet.py official repository ran · our draft was wrong MIT (permissive) · d5cd7ffe2dc51b21 · report
conv3x3 dipamgoswami/fecam/convs/resnet.py official repository ran · our draft was wrong MIT (permissive) · 160bb14bd76201b4 · report
conv3x3 dipamgoswami/fecam/convs/resnet_cbam.py official repository ran · our draft was wrong MIT (permissive) · fac5364e2f53c6db · report
conv3x3 dipamgoswami/fecam/convs/modified_represnet.py official repository ran · our draft was wrong MIT (permissive) · 1907f2ae25449f39 · report
normalize_cov dipamgoswami/fecam/FeCAM_vit_core50.py official repository ran MIT (permissive) · dbac5df5f6dc9433 · report
shrink_cov dipamgoswami/fecam/FeCAM_vit_core50.py official repository ran fingerprinted MIT (permissive) · 17ed71f058d7674a · report
shrink_cov dipamgoswami/fecam/FeCAM_vit_imagenet-r.py official repository ran fingerprinted MIT (permissive) · 0365639e81fbf382 · report
get_dataset dipamgoswami/fecam/FeCAM_vit_imagenet-r.py official repository unverified MIT (permissive) · f5c8f70797dc3539 · report
resnet18 dipamgoswami/fecam/convs/resnet.py official repository unverified MIT (permissive) · 966d18702829b1c0 · report
resnet18_cbam dipamgoswami/fecam/convs/resnet_cbam.py official repository unverified MIT (permissive) · 9d7277889d69cf2d · report
resnet18_rep dipamgoswami/fecam/convs/modified_represnet.py official repository unverified MIT (permissive) · ecaa7ca05d715804 · report
resnet34_cbam dipamgoswami/fecam/convs/resnet_cbam.py official repository unverified MIT (permissive) · 9eb3d43ee2e8ae7d · report
IntervalModuleWithWeights gmum/hint/IntervalNets/interval_modules.py community (archive-listed) ran MIT (permissive) · 4d1ed8dab640e691 · report
IntervalLinear gmum/hint/IntervalNets/interval_modules.py community (archive-listed) unverified MIT (permissive) · 5ac470f50d929fcf · report
get_current_targets gmum/hyperinterval/Utils/hnet_interval_regularizer.py community (archive-listed) unverified MIT (permissive) · e488b43331809f71 · report
get_current_targets gmum/hyperinterval/Utils/hnet_middle_regularizer.py community (archive-listed) unverified MIT (permissive) · d8e7aca624e3e8de · report
parse_logits gmum/hyperinterval/IntervalNets/interval_modules.py community (archive-listed) unverified MIT (permissive) · a14c0ad5907d1cd5 · report
prepare_subset_imagenet_tasks gmum/hyperinterval/DatasetHandlers/subset_image_net.py community (archive-listed) unverified MIT (permissive) · a740ad44865dbc9b · report

Tasks

Class Incremental LearningContinual LearningExemplar-FreeIncremental Learningclass-incremental learning

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