Papers › End-to-End Incremental Learning

End-to-End Incremental Learning

25 Jul 2018ECCV 2018 9arXiv:1807.09536archive 2025-07-28

Francisco M. Castro, Manuel J. Marín-Jiménez, Nicolás Guil, Cordelia Schmid, Karteek Alahari

Although deep learning approaches have stood out in recent years due to their state-of-the-art results, they continue to suffer from catastrophic forgetting, a dramatic decrease in overall performance when training with new classes added incrementally. This is due to current neural network architectures requiring the entire dataset, consisting of all the samples from the old as well as the new classes, to update the model -a requirement that becomes easily unsustainable as the number of classes grows. We address this issue with our approach to learn deep neural networks incrementally, using new data and only a small exemplar set corresponding to samples from the old classes. This is based on a loss composed of a distillation measure to retain the knowledge acquired from the old classes, and a cross-entropy loss to learn the new classes. Our incremental training is achieved while keeping the entire framework end-to-end, i.e., learning the data representation and the classifier jointly, unlike recent methods with no such guarantees. We evaluate our method extensively on the CIFAR-100 and ImageNet (ILSVRC 2012) image classification datasets, and show state-of-the-art performance.

PaperPDFConference PDFCodeCode Syntology ran

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 9 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 9 samples from 1 repository, 7 ran (7 with no instrument failure; 0 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 3 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

axelmukwena/biometricECG mentioned on GitHubtfMITSyntology: 9 samples, 7 ran (0 instrument-failed) · 2 unverified report
fmcp/EndToEndIncrementalLearning mentioned on GitHubSyntology: not harvested report
kibok90/iccv2019-inc mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Overcoming Catastrophic Forgetting with Unlabeled Data in the Wild (arXiv:1903.12648; that paper's own run record: 6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
lalithjets/domain-adaptation-in-mtl mentioned on GitHubpytorchSyntology: not harvested report
lalithjets/domain-generalization-for-surgical-scene-graph mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Curriculum By Smoothing (arXiv:2003.01367; that paper's own run record: 2 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; 2 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
mmasana/FACIL 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), iCaRL: Incremental Classifier and Representation Learning (arXiv:1611.07725; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified) and Overcoming catastrophic forgetting in neural networks (arXiv:1612.00796; that paper's own run record: 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); nothing checks that they implement this paper's method. 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

9 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 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.

7ran
2unverified

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 axelmukwena/biometricECG. “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.

axelmukwena/biometricECG community (archive-listed) 9 samples, 7 ran (0 instrument-failed) · 2 unverified
block in 17 papers cnn.py ran MIT (permissive) · 2acfc8cd3d4a7a41 · report fixture: signature m:callable/0/?, fs:int/0/int, ks:int/0/int, ps:int/0/int · returned Sequential · level recorded 2026-09-26
create_pairs in 5 papers snn.py ran MIT (permissive) · 77a608bac7d684d4 · report fixture: signature y:ndarray/1/int, x:ndarray/2/float, ps:list/1/int · returned tuple · level recorded 2026-09-26
load_data in 700 papers utils.py ran MIT (permissive) · 440f3333b608dcc5 · report fixture: signature where:str/0/str · returned tuple · level recorded 2026-09-26
resamp features.py ran fingerprinted MIT (permissive) · 5cc2b83cb8447200 · report fixture: signature array:ndarray/1/float, times:int/0/int · returned ndarray · level recorded 2026-09-26
shuffle in 35 papers utils.py ran MIT (permissive) · e88d07e0f6a17a4e · report fixture: signature yy:list/1/int, xx:list/1/int · returned tuple · level recorded 2026-09-26
splits in 7 papers cnn.py ran MIT (permissive) · 07d3ea7e737fed96 · report fixture: signature yy:ndarray/1/int, xx:ndarray/2/float, sig_dims:tuple/1/int · returned tuple · level recorded 2026-09-26
spp_layer cnn.py ran MIT (permissive) · 442205d6b4df4020 · report fixture: signature inp:KerasTensor/0/float, spp_windows:list/1/int · returned KerasTensor · level recorded 2026-09-26
filters features.py unverified MIT (permissive) · c2be16c19e6d55f9 · report
filters signals.py unverified MIT (permissive) · 4f1c51d7ade05617 · report

Tasks

Image ClassificationIncremental Learningimage-classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Incremental Learning ImageNet - 10 steps E2E # M Params 11.68 #10 of 10 Archive leaderboard report
Incremental Learning ImageNet - 10 steps E2E Average Incremental Accuracy Top-5 72.09 #10 of 10 Archive leaderboard report
Incremental Learning ImageNet - 10 steps E2E Final Accuracy Top-5 52.29 #10 of 10 Archive leaderboard report
Incremental Learning ImageNet100 - 10 steps E2E # M Params 11.22 #11 of 13 Archive leaderboard report
Incremental Learning ImageNet100 - 10 steps E2E Average Incremental Accuracy Top-5 89.92 #11 of 13 Archive leaderboard report
Incremental Learning ImageNet100 - 10 steps E2E Final Accuracy Top-5 80.29 #11 of 13 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.

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