{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/large-scale-incremental-learning-1","title":"Large Scale Incremental Learning","arxiv_id":"1905.13260","date":"2019-05-30","proceeding":"CVPR 2019 6","authors":["Yue Wu","Yinpeng Chen","Lijuan Wang","Yuancheng Ye","Zicheng Liu","Yandong Guo","Yun Fu"],"abstract":"Modern machine learning suffers from catastrophic forgetting when learning new classes incrementally. The performance dramatically degrades due to the missing data of old classes. Incremental learning methods have been proposed to retain the knowledge acquired from the old classes, by using knowledge distilling and keeping a few exemplars from the old classes. However, these methods struggle to scale up to a large number of classes. We believe this is because of the combination of two factors: (a) the data imbalance between the old and new classes, and (b) the increasing number of visually similar classes. Distinguishing between an increasing number of visually similar classes is particularly challenging, when the training data is unbalanced. We propose a simple and effective method to address this data imbalance issue. We found that the last fully connected layer has a strong bias towards the new classes, and this bias can be corrected by a linear model. With two bias parameters, our method performs remarkably well on two large datasets: ImageNet (1000 classes) and MS-Celeb-1M (10000 classes), outperforming the state-of-the-art algorithms by 11.1% and 13.2% respectively.","url_abs":"https://arxiv.org/abs/1905.13260v1","url_pdf":"https://arxiv.org/pdf/1905.13260v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"large-scale-incremental-learning-1","repo_url":"https://github.com/g-u-n/pycil","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"large-scale-incremental-learning-1","repo_url":"https://github.com/sairin1202/BIC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"large-scale-incremental-learning-1","repo_url":"https://github.com/ContinualAI/avalanche","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"large-scale-incremental-learning-1","repo_url":"https://github.com/aimagelab/mammoth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"large-scale-incremental-learning-1","repo_url":"https://github.com/mmasana/FACIL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"class-incremental-learning-1","task_name":"class-incremental learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/incremental-learning-on-cifar-100-50-classes-2","task":"Incremental Learning","dataset":"CIFAR-100 - 50 classes + 10 steps of 5 classes","model":"BiC","rank_in_archive_order":12,"of":13,"metrics":{"Average Incremental Accuracy":"53.21"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-cifar-100-50-classes-1","task":"Incremental Learning","dataset":"CIFAR-100 - 50 classes + 25 steps of 2 classes","model":"BiC","rank_in_archive_order":5,"of":5,"metrics":{"Average Incremental Accuracy":"48.96"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-cifar-100-50-classes-3","task":"Incremental Learning","dataset":"CIFAR-100 - 50 classes + 5 steps of 10 classes","model":"BiC","rank_in_archive_order":13,"of":15,"metrics":{"Average Incremental Accuracy":"56.86"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-cifar-100-50-classes","task":"Incremental Learning","dataset":"CIFAR-100 - 50 classes + 50 steps of 1 class","model":"BiC","rank_in_archive_order":2,"of":2,"metrics":{"Average Incremental Accuracy":"47.09"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-cifar-100-b0-5steps","task":"Incremental Learning","dataset":"CIFAR-100-B0(5steps of 20 classes)","model":"BiC","rank_in_archive_order":5,"of":10,"metrics":{"Average Incremental Accuracy":"73.10"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-imagenet-10-steps","task":"Incremental Learning","dataset":"ImageNet - 10 steps","model":"BiC","rank_in_archive_order":9,"of":10,"metrics":{"# M Params":"11.68","Average Incremental Accuracy Top-5":"84.00","Final Accuracy Top-5":"73.20"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-imagenet-100-50","task":"Incremental Learning","dataset":"ImageNet-100 - 50 classes + 50 steps of 1 class","model":"BiC","rank_in_archive_order":2,"of":2,"metrics":{"Average Incremental Accuracy":"46.49"},"uses_additional_data":false},{"leaderboard":"/sota/incremental-learning-on-imagenet100-10-steps","task":"Incremental Learning","dataset":"ImageNet100 - 10 steps","model":"BiC","rank_in_archive_order":10,"of":13,"metrics":{"# M Params":"11.22","Average Incremental Accuracy Top-5":"90.60","Final Accuracy Top-5":"84.40"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.13260","atlas_url":"https://app.syntology.ai/?focus=1905.13260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13260"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.13260"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.13260"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.13260\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1905.13260"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.13260\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.13260"},"call":"get_concepts_for_paper(arxiv_id=\"1905.13260\")"}],"by_repo":[{"repo":"g-u-n/pycil","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2301.05792"],"harvested_for_calls":[{"arxiv_id":"2301.05792","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.05792"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.05792\")"}]},{"repo":"sairin1202/BIC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ContinualAI/avalanche","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1606.09282","2007.13904"],"harvested_for_calls":[{"arxiv_id":"1606.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.09282\")"},{"arxiv_id":"2007.13904","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.13904"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.13904\")"}]},{"repo":"aimagelab/mammoth","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.15793"],"harvested_for_calls":[{"arxiv_id":"2407.15793","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.15793"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.15793\")"}]},{"repo":"mmasana/FACIL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1606.09282","1611.07725","1612.00796"],"harvested_for_calls":[{"arxiv_id":"1606.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.09282\")"},{"arxiv_id":"1611.07725","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1611.07725"},"call":"get_harvested_code_for_paper(arxiv_id=\"1611.07725\")"},{"arxiv_id":"1612.00796","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00796"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00796\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1905.13260.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1905.13260.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/aimagelab/mammoth","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sairin1202/BIC","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ContinualAI/avalanche","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mmasana/FACIL","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/g-u-n/pycil","reach":null}],"summary":{"ran_draft_wrong":1},"n_samples":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"unlocated":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":0,"is":"identical to code Syntology harvested from another paper's repository; this paper's own copy was not located, so no repository is named and no licence is recorded"}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"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_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":0,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"fac5364e2f53c6db","code_sha256_prefix":"fac5364e2f53c6db","entry":"conv3x3","repo":null,"repo_kind":null,"path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_planes:int/0/int, out_planes:int/0/int, stride:int/0/int","fixture_out_type":"Conv2d","code_page":"/code/conv3x3","census":null,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"fac5364e2f53c6db"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e86a701e533e804ddf1062229601158532af75a54c9050df765fa13f1986faf5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}