Papers › Overcoming catastrophic forgetting in neural networks

Overcoming catastrophic forgetting in neural networks

2 Dec 2016arXiv:1612.00796archive 2025-07-28

James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, Andrei A. Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, Demis Hassabis, Claudia Clopath, Dharshan Kumaran, Raia Hadsell

The ability to learn tasks in a sequential fashion is crucial to the development of artificial intelligence. Neural networks are not, in general, capable of this and it has been widely thought that catastrophic forgetting is an inevitable feature of connectionist models. We show that it is possible to overcome this limitation and train networks that can maintain expertise on tasks which they have not experienced for a long time. Our approach remembers old tasks by selectively slowing down learning on the weights important for those tasks. We demonstrate our approach is scalable and effective by solving a set of classification tasks based on the MNIST hand written digit dataset and by learning several Atari 2600 games sequentially.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 22 code samples harvested from 12 repositories linked to this paper: 16 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 22 samples from 12 repositories, 16 ran (12 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 5 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 16 samples that ran have no recorded date.

29 repositories listed; official and paper-mentioned ones first.

King-Of-Knights/overcoming-catastrophic mentioned on GitHubSyntology: not harvested report
Minhchuyentoancbn/Continual-Learning mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
PCJohn/cata-forget mentioned on GitHubtfSyntology: not harvested report
ariseff/overcoming-catastrophic mentioned on GitHubtfSyntology: not harvested report
catid/never_forget mentioned on GitHubpytorchBSD-3-ClauseSyntology: 4 samples, 3 ran (2 instrument-failed) · 1 unverified report
dalxndr/NEURO140 mentioned on GitHubtfSyntology: not harvested report
daskol/paper-reviews mentioned on GitHubMITSyntology: not harvested report
david-knigge/overcoming-catastrophic-forgetting-fncm-uva mentioned on GitHubtfSyntology: not harvested report
ethz-asl/background_foreground_segmentation mentioned on GitHubtfSyntology: not harvested report
fionisarnen/Lifelong-Learning-churn-prediction-torch mentioned on GitHubtorchSyntology: not harvested report
g-u-n/pycil mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to RMM: Reinforced Memory Management for Class-Incremental Learning (arXiv:2301.05792; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
kamsyn95/CL_DNN mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
mu-y/lll-tts mentioned on GitHubpytorchSyntology: not harvested report
nvshrao/Elastic-Weight-Consolidation mentioned on GitHubSyntology: not harvested report
shivamsaboo17/overcoming-catastrophic-forgetting-in-neural-networks mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
srvCodes/continual-learning-benchmark mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
stijani/elastic-weight-consolidation-tf2 mentioned on GitHubtfSyntology: 1 sample, 0 ran · 1 unverified report
wannabeOG/MAS-PyTorch mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
wjmacro/continualmt mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
wyatuestc/overcoming-catastrophic mentioned on GitHubtfSyntology: not harvested report
xduan7/hat-cl mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
ContinualAI/avalanche pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Learning without Forgetting (arXiv:1606.09282; that paper's own run record: 9 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified) and La-MAML: Look-ahead Meta Learning for Continual Learning (arXiv:2007.13904; that paper's own run record: 5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
MindCode-4/code-11 mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Entropy Law: The Story Behind Data Compression and LLM Performance (arXiv:2407.06645; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
MindCode-4/code-6 mindsporeSyntology: not harvested report
aimagelab/mammoth pytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to CLIP with Generative Latent Replay: a Strong Baseline for Incremental Learning (arXiv:2407.15793; that paper's own run record: 8 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
clam004/intro_continual_learning pytorchSyntology: 4 samples, 3 ran (1 instrument-failed) · 1 unverified report
codelion/adaptive-classifier pytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
mindspore-ai/contrib mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems (arXiv:2305.12102; that paper's own run record: 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
mmasana/FACIL pytorchSyntology: 5 samples, 4 ran (0 instrument-failed) · 1 unverified 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

22 samples harvested: 16 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran · honoured contract
4ran · our draft was wrong
10ran
6unverified

Licence: 4 of the 22 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 12 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

Minhchuyentoancbn/Continual-Learning community (archive-listed) 1 sample, 0 ran · 1 unverified
Approach UCL/approaches/ewc.py unverified no licence file found · pointer only · 118dad0481c8d9e3 · report
catid/never_forget community (archive-listed) 4 samples, 3 ran (2 instrument-failed) · 1 unverified
cauchy_naive in 7 papers models/s4.py ran · our draft was wrong fingerprinted BSD-3-Clause (permissive) · b7d9d94554e93b1b · report fixture: signature v:Tensor/2/float, z:Tensor/2/float, w:Tensor/2/float · returned Tensor · level recorded, date not recorded
log_vandermonde_naive in 6 papers models/s4.py ran · our draft was wrong BSD-3-Clause (permissive) · e25911109ba29783 · report fixture: signature v:Tensor/2/float, x:Tensor/2/float, L:int/0/int, conj:bool/0/bool · returned Tensor · level recorded, date not recorded
read_servers_from_hostfile command_client_grid.py ran BSD-3-Clause (permissive) · 5e7be12170048fbb · report fixture: signature filepath:str/0/str · returned list · level recorded 2026-09-26
log_vandermonde_transpose_naive models/s4.py unverified BSD-3-Clause (permissive) · 7cfca855faa8e8dc · report
kamsyn95/CL_DNN community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
EWCMultitask models/ewc_modules.py ran no licence file found · pointer only · 6aad701239ed7577 · report fixture: returned EWCMultitask · level recorded 2026-09-22
shivamsaboo17/overcoming-catastrophic-forgetting-in-neural-networks community (archive-listed) 1 sample, 0 ran · 1 unverified
ElasticWeightConsolidation elastic_weight_consolidation.py unverified no licence file found · pointer only · 9d058983f0e0d999 · report
srvCodes/continual-learning-benchmark community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
EWC train/ewc.py ran MIT (permissive) · 3ca3b2ad5cf08e7a · report fixture: returned EWC · level recorded 2026-09-22
stijani/elastic-weight-consolidation-tf2 community (archive-listed) 1 sample, 0 ran · 1 unverified
EWC module.py unverified no licence file found · pointer only · 5ebc601b0d506a2c · report
wannabeOG/MAS-PyTorch community (archive-listed) 1 sample, 1 ran (1 instrument-failed) · 0 unverified
compute_omega_grads_norm utils/mas_utils.py ran · our draft was wrong BSD-2-Clause (permissive) · a1703c053471f8d6 · report fixture: signature model:callable/0/?, dataloader:list/1/tuple, optimizer:OmegaUpdate/0/?, use_gpu:bool/0/bool · returned ModelWrapper · level recorded 2026-09-22
wjmacro/continualmt community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
GradMultiply fairseq/modules/grad_multiply.py ran MIT (permissive) · b26c848baf0f673d · report fixture: returned GradMultiply · level recorded 2026-09-22
xduan7/hat-cl community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
register_mapping hat/modules/utils.py ran MIT (permissive) · ca1097ecd04eb4a3 · report fixture: signature cls:callable/0/? · returned type · level recorded 2026-09-26
clam004/intro_continual_learning community (archive-listed) 4 samples, 3 ran (1 instrument-failed) · 1 unverified
one_epoch_baseline contlearn/gettrainer.py ran · honoured contract MIT (permissive) · 4473672cd588ecd4 · report fixture: signature model:callable/0/?, data_loader:DataLoader/0/?, lr:float/0/float · returned float · level recorded 2026-09-24
test in 377 papers contlearn/gettrainer.py ran · honoured contract MIT (permissive) · 426df1649f33777b · report fixture: signature model:callable/0/?, data_loader:DataLoader/0/? · returned Tensor · level recorded 2026-09-24
var2device contlearn/gettrainer.py ran · our draft was wrong fingerprinted MIT (permissive) · aff2576823d89d61 · report fixture: signature t:Tensor/2/float, use_cuda:bool/0/bool · returned Tensor · level recorded 2026-09-22
elastic_weight_consolidation_training contlearn/gettrainer.py unverified MIT (permissive) · cbe2eeebdcb6a48a · report
codelion/adaptive-classifier community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
EWC src/adaptive_classifier/ewc.py ran Apache-2.0 (permissive) · a1465fe6cdcb57d7 · report fixture: returned EWC · level recorded 2026-09-22
mmasana/FACIL community (archive-listed) 5 samples, 4 ran (0 instrument-failed) · 1 unverified
ExemplarsDataset src/approach/ewc.py ran · metamorphic tier: well formed MIT (permissive) · 39b8751422fdac64 · report fixture: returned ExemplarsDataset · level recorded 2026-09-22
ExperimentLogger src/approach/ewc.py ran MIT (permissive) · 1d10e03aa48307d3 · report fixture: returned ExperimentLogger · level recorded 2026-09-22
Inc_Learning_Appr in 5 papers src/approach/ewc.py ran MIT (permissive) · a47c1a346ec772ca · report fixture: returned Inc_Learning_Appr · level recorded 2026-09-22
MemoryDataset src/approach/ewc.py ran MIT (permissive) · c1ecdf9c6eed882e · report fixture: returned MemoryDataset · level recorded 2026-09-22
Appr in 8 papers src/approach/ewc.py unverified MIT (permissive) · c1596b67340a6f97 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

10 assemblies on this paper: 10 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

10 sibling assemblies for selectively slowing down learning on the weights important for old tasks (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 10 siblings

  1. EWC entry · level 1 · ran · 3ca3b2ad5cf08e7a

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 10 siblings

  1. Approach entry · level 0 · unverified · 118dad0481c8d9e3

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 5 bricks; individually on a fixture: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 10 siblings

  1. Appr entry · level 0 · unverified · c1596b67340a6f97
  2. ExemplarsDataset helper · level 1 · ran · 39b8751422fdac64
  3. Inc_Learning_Appr helper · level 1 · ran · a47c1a346ec772ca
  4. MemoryDataset helper · level 1 · ran · c1ecdf9c6eed882e
  5. ExperimentLogger helper · level 1 · ran · 1d10e03aa48307d3

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 10 siblings

  1. GradMultiply entry · level 1 · ran · b26c848baf0f673d

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 10 siblings

  1. EWC entry · level 1 · ran · a1465fe6cdcb57d7

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 10 siblings

  1. EWCMultitask entry · level 1 · ran · 6aad701239ed7577

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 10 siblings

  1. EWC entry · level 0 · unverified · 5ebc601b0d506a2c

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 10 siblings

  1. compute_omega_grads_norm entry · level 1 · ran · our draft was wrong · a1703c053471f8d6

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 10 siblings

  1. ElasticWeightConsolidation entry · level 0 · unverified · 9d058983f0e0d999

harvested Assembly for selectively slowing down learning on the weights important for old tasks (graph method: selectively slowing down learning on the weights important for old tasks). 4 bricks; individually on a fixture: 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified. The assembly has not been run end-to-end.

one of 10 siblings

  1. elastic_weight_consolidation_training entry · level 0 · unverified · cbe2eeebdcb6a48a
  2. one_epoch_baseline helper · level 1 · ran · honoured contract · 4473672cd588ecd4
  3. test helper · level 1 · ran · honoured contract · 426df1649f33777b
  4. var2device helper · level 1 · ran · our draft was wrong · aff2576823d89d61

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="1612.00796") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Atari GamesClass Incremental LearningContinual LearningGeneral ClassificationIncremental Learningclass-incremental learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Continual Learning 20Newsgroup (10 tasks) EWC F1 - macro 0.9180 #5 of 6 Archive leaderboard report
Continual Learning ASC (19 tasks) EWC F1 - macro 0.7452 #13 of 15 Archive leaderboard report
Continual Learning ASC (19 tasks) L2 F1 - macro 0.5243 #15 of 15 Archive leaderboard report
Continual Learning DSC (10 tasks) EWC F1 - macro 0.6576 #6 of 6 Archive leaderboard report
Continual Learning F-CelebA (10 tasks) EWC Acc 0.6545 #3 of 7 Archive leaderboard report
class-incremental learning cifar100 EWC 10-stage average accuracy 50.53 #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

Introduced by this paper: EWC

EWC

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