{"url":"/sota/incremental-learning-on-imagenet100-10-steps","task":{"name":"Incremental Learning","url":"/task/incremental-learning","note":null},"dataset":{"name":"ImageNet100 - 10 steps","url":null},"category":"Methodology","categories":["Methodology"],"category_note":null,"description":"Incremental learning aims to develop artificially intelligent systems that can continuously learn to address new tasks from new data while preserving knowledge learned from previously learned tasks.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Average Incremental Accuracy","Final Accuracy","Average Incremental Accuracy Top-5","Final Accuracy Top-5","# M Params"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Average Incremental Accuracy":"higher","Final Accuracy":"higher","Average Incremental Accuracy Top-5":"higher","Final Accuracy Top-5":"higher","# M Params":"lower"}},"counts":{"rows":13,"rows_with_code":12,"rows_with_paper_page":13,"rows_dated":13,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"kNN-CLIP","metrics":{"Average Incremental Accuracy":"85.1"},"uses_additional_data":true,"paper_date":"2022-04-03","paper":"/paper/revisiting-a-knn-based-image-classification","paper_url":"https://arxiv.org/abs/2204.01186v2","paper_title":"Revisiting a kNN-based Image Classification System with High-capacity Storage","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":2,"model":"RMM (ResNet-18)","metrics":{"Average Incremental Accuracy":"78.47"},"uses_additional_data":false,"paper_date":"2023-01-14","paper":"/paper/rmm-reinforced-memory-management-for-class-1","paper_url":"https://arxiv.org/abs/2301.05792v1","paper_title":"RMM: Reinforced Memory Management for Class-Incremental Learning","code":"https://github.com/g-u-n/pycil","n_code_links":4,"syntology":{"n_ran":2,"n_unverified":2,"n_samples":4,"n_pointer_only_licence":4}},{"rank_in_archive_order":3,"model":"FOSTER","metrics":{"Average Incremental Accuracy":"77.75"},"uses_additional_data":false,"paper_date":"2022-04-10","paper":"/paper/foster-feature-boosting-and-compression-for","paper_url":"https://arxiv.org/abs/2204.04662v2","paper_title":"FOSTER: Feature Boosting and Compression for Class-Incremental Learning","code":"https://github.com/g-u-n/pycil","n_code_links":2,"syntology":{"n_ran":2,"n_unverified":6,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"TCIL","metrics":{"# M Params":"116.54","Average Incremental Accuracy":"77.66","Average Incremental Accuracy Top-5":"94.17","Final Accuracy":"67.34","Final Accuracy Top-5":"88.84"},"uses_additional_data":false,"paper_date":"2022-12-29","paper":"/paper/resolving-task-confusion-in-dynamic-expansion","paper_url":"https://arxiv.org/abs/2212.14284v2","paper_title":"Resolving Task Confusion in Dynamic Expansion Architectures for Class Incremental Learning","code":"https://github.com/yellowpancake/tcil","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"TCIL-Lite","metrics":{"# M Params":"26.36","Average Incremental Accuracy":"77.50","Average Incremental Accuracy Top-5":"93.60","Final Accuracy":"67.30","Final Accuracy Top-5":"87.94"},"uses_additional_data":false,"paper_date":"2022-12-29","paper":"/paper/resolving-task-confusion-in-dynamic-expansion","paper_url":"https://arxiv.org/abs/2212.14284v2","paper_title":"Resolving Task Confusion in Dynamic Expansion Architectures for Class Incremental Learning","code":"https://github.com/yellowpancake/tcil","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"DER w/o Pruning","metrics":{"# M Params":"112.27","Average Incremental Accuracy":"77.18","Average Incremental Accuracy Top-5":"93.23","Final Accuracy":"66.70","Final Accuracy Top-5":"87.52"},"uses_additional_data":false,"paper_date":"2021-03-31","paper":"/paper/der-dynamically-expandable-representation-for","paper_url":"https://arxiv.org/abs/2103.16788v1","paper_title":"DER: Dynamically Expandable Representation for Class Incremental Learning","code":"https://github.com/g-u-n/pycil","n_code_links":2,"syntology":{"n_ran":6,"n_unverified":5,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"DyTox","metrics":{"# M Params":"11.01","Average Incremental Accuracy":"77.15","Average Incremental Accuracy Top-5":"92.04","Final Accuracy":"69.10","Final Accuracy Top-5":"87.98"},"uses_additional_data":false,"paper_date":"2021-11-22","paper":"/paper/dytox-transformers-for-continual-learning","paper_url":"https://arxiv.org/abs/2111.11326v3","paper_title":"DyTox: Transformers for Continual Learning with DYnamic TOken eXpansion","code":"https://github.com/arthurdouillard/dytox","n_code_links":1,"syntology":{"n_ran":3,"n_unverified":8,"n_samples":11,"n_pointer_only_licence":11}},{"rank_in_archive_order":8,"model":"DER","metrics":{"Average Incremental Accuracy":"76.12","Average Incremental Accuracy Top-5":"92.79","Final Accuracy":"66.07","Final Accuracy Top-5":"88.38"},"uses_additional_data":false,"paper_date":"2021-03-31","paper":"/paper/der-dynamically-expandable-representation-for","paper_url":"https://arxiv.org/abs/2103.16788v1","paper_title":"DER: Dynamically Expandable Representation for Class Incremental Learning","code":"https://github.com/g-u-n/pycil","n_code_links":2,"syntology":{"n_ran":6,"n_unverified":5,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"WA","metrics":{"# M Params":"11.22","Average Incremental Accuracy Top-5":"91.00","Final Accuracy Top-5":"84.10"},"uses_additional_data":false,"paper_date":"2019-11-16","paper":"/paper/maintaining-discrimination-and-fairness-in","paper_url":"https://arxiv.org/abs/1911.07053v1","paper_title":"Maintaining Discrimination and Fairness in Class Incremental Learning","code":"https://github.com/g-u-n/pycil","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"BiC","metrics":{"# M Params":"11.22","Average Incremental Accuracy Top-5":"90.60","Final Accuracy Top-5":"84.40"},"uses_additional_data":false,"paper_date":"2019-05-30","paper":"/paper/large-scale-incremental-learning-1","paper_url":"https://arxiv.org/abs/1905.13260v1","paper_title":"Large Scale Incremental Learning","code":"https://github.com/ContinualAI/avalanche","n_code_links":5,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":11,"model":"E2E","metrics":{"# M Params":"11.22","Average Incremental Accuracy Top-5":"89.92","Final Accuracy Top-5":"80.29"},"uses_additional_data":false,"paper_date":"2018-07-25","paper":"/paper/end-to-end-incremental-learning","paper_url":"http://arxiv.org/abs/1807.09536v2","paper_title":"End-to-End Incremental Learning","code":"https://github.com/mmasana/FACIL","n_code_links":6,"syntology":{"n_ran":0,"n_unverified":9,"n_samples":9,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"RPSNet","metrics":{"Average Incremental Accuracy Top-5":"87.90","Final Accuracy Top-5":"74.00"},"uses_additional_data":false,"paper_date":"2019-06-03","paper":"/paper/random-path-selection-for-incremental","paper_url":"https://arxiv.org/abs/1906.01120v3","paper_title":"An Adaptive Random Path Selection Approach for Incremental Learning","code":"https://github.com/brjathu/RPSnet","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"iCaRL","metrics":{"# M Params":"11.22","Average Incremental Accuracy Top-5":"83.60","Final Accuracy Top-5":"63.80"},"uses_additional_data":false,"paper_date":"2016-11-23","paper":"/paper/icarl-incremental-classifier-and","paper_url":"http://arxiv.org/abs/1611.07725v2","paper_title":"iCaRL: Incremental Classifier and Representation Learning","code":"https://github.com/ContinualAI/avalanche","n_code_links":10,"syntology":{"n_ran":3,"n_unverified":11,"n_samples":14,"n_pointer_only_licence":3}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,795 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":8,"rows_with_any_sample_ran":7,"distinct_papers_with_graph_line":7,"distinct_papers_with_any_sample_ran":6,"samples_over_distinct_papers":{"n_ran":17,"n_unverified":41,"n_samples":58,"n_pointer_only_licence":19,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":23,"n_unverified":46,"n_samples":69,"n_pointer_only_licence":19,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}