{"url":"/sota/continual-learning-on-asc-19-tasks","task":{"name":"Continual Learning","url":"/task/continual-learning","note":null},"dataset":{"name":"ASC (19 tasks)","url":"/dataset/asc-til-19-tasks"},"category":"Computer Vision","categories":["Computer Vision","Methodology","Natural Language Processing"],"category_note":null,"description":"**Continual Learning** (also known as **Incremental Learning**, **Life-long Learning**) is a concept to learn a model for a large number of tasks sequentially without forgetting knowledge obtained from the preceding tasks, where the data in the old tasks are not available anymore during training new ones.  \r\nIf not mentioned, the benchmarks here are **Task-CL**, where task-id is provided on validation.\r\n\r\nSource:  \r\n[Continual Learning by Asymmetric Loss Approximation with Single-Side Overestimation](https://arxiv.org/abs/1908.02984)  \r\n[Three scenarios for continual learning](https://arxiv.org/abs/1904.07734)  \r\n[Lifelong Machine Learning](https://books.google.ca/books/about/Lifelong_Machine_Learning.html?id=JQ5pDwAAQBAJ&redir_esc=y)  \r\n[Continual lifelong learning with neural networks: A review](https://www.sciencedirect.com/science/article/pii/S0893608019300231)","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":["F1 - macro"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1 - macro":"higher"}},"counts":{"rows":15,"rows_with_code":15,"rows_with_paper_page":15,"rows_dated":15,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"Multi-task Learning (MTL; Upper Bound)","metrics":{"F1 - macro":"0.8811"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/achieving-forgetting-prevention-and-knowledge-1","paper_url":"https://arxiv.org/abs/2112.02706v1","paper_title":"Achieving Forgetting Prevention and Knowledge Transfer in Continual Learning","code":"https://github.com/zixuanke/pycontinual","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"CTR","metrics":{"F1 - macro":"0.8362"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/achieving-forgetting-prevention-and-knowledge-1","paper_url":"https://arxiv.org/abs/2112.02706v1","paper_title":"Achieving Forgetting Prevention and Knowledge Transfer in Continual Learning","code":"https://github.com/zixuanke/pycontinual","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"B-CL","metrics":{"F1 - macro":"0.8140"},"uses_additional_data":false,"paper_date":"2021-12-06","paper":"/paper/adapting-bert-for-continual-learning-of-a-1","paper_url":"https://arxiv.org/abs/2112.03271v1","paper_title":"Adapting BERT for Continual Learning of a Sequence of Aspect Sentiment Classification Tasks","code":"https://github.com/zixuanke/pycontinual","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"LAMOL","metrics":{"F1 - macro":"0.8059"},"uses_additional_data":false,"paper_date":"2019-09-07","paper":"/paper/lamal-language-modeling-is-all-you-need-for","paper_url":"https://arxiv.org/abs/1909.03329v2","paper_title":"LAMOL: LAnguage MOdeling for Lifelong Language Learning","code":"https://github.com/jojotenya/LAMOL","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":9,"n_samples":10,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"OWM","metrics":{"F1 - macro":"0.7931"},"uses_additional_data":false,"paper_date":"2018-09-29","paper":"/paper/continuous-learning-of-context-dependent","paper_url":"https://arxiv.org/abs/1810.01256v3","paper_title":"Continual Learning of Context-dependent Processing in Neural Networks","code":"https://github.com/beijixiong3510/OWM","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"A-GEM","metrics":{"F1 - macro":"0.7844"},"uses_additional_data":false,"paper_date":"2018-12-02","paper":"/paper/efficient-lifelong-learning-with-a-gem","paper_url":"http://arxiv.org/abs/1812.00420v2","paper_title":"Efficient Lifelong Learning with A-GEM","code":"https://github.com/ContinualAI/avalanche","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":11,"n_samples":12,"n_pointer_only_licence":0}},{"rank_in_archive_order":7,"model":"HAT","metrics":{"F1 - macro":"0.7816"},"uses_additional_data":false,"paper_date":"2018-01-04","paper":"/paper/overcoming-catastrophic-forgetting-with-hard","paper_url":"http://arxiv.org/abs/1801.01423v3","paper_title":"Overcoming catastrophic forgetting with hard attention to the task","code":"https://github.com/joansj/hat","n_code_links":2,"syntology":null},{"rank_in_archive_order":8,"model":"Independent Learning (ONE)","metrics":{"F1 - macro":"0.7807"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/achieving-forgetting-prevention-and-knowledge-1","paper_url":"https://arxiv.org/abs/2112.02706v1","paper_title":"Achieving Forgetting Prevention and Knowledge Transfer in Continual Learning","code":"https://github.com/zixuanke/pycontinual","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"KAN","metrics":{"F1 - macro":"0.7738"},"uses_additional_data":false,"paper_date":"2021-12-18","paper":"/paper/continual-learning-with-knowledge-transfer","paper_url":"https://arxiv.org/abs/2112.10021v1","paper_title":"Continual Learning with Knowledge Transfer for Sentiment Classification","code":"https://github.com/zixuanke/pycontinual","n_code_links":2,"syntology":null},{"rank_in_archive_order":10,"model":"Naive Continual Learning (NCL)","metrics":{"F1 - macro":"0.7664"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/achieving-forgetting-prevention-and-knowledge-1","paper_url":"https://arxiv.org/abs/2112.02706v1","paper_title":"Achieving Forgetting Prevention and Knowledge Transfer in Continual Learning","code":"https://github.com/zixuanke/pycontinual","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"UCL","metrics":{"F1 - macro":"0.7599"},"uses_additional_data":false,"paper_date":"2019-05-28","paper":"/paper/uncertainty-based-continual-learning-with","paper_url":"https://arxiv.org/abs/1905.11614v3","paper_title":"Uncertainty-based Continual Learning with Adaptive Regularization","code":"https://github.com/csm9493/UCL","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"DER++","metrics":{"F1 - macro":"0.7508"},"uses_additional_data":false,"paper_date":"2020-04-15","paper":"/paper/dark-experience-for-general-continual","paper_url":"https://arxiv.org/abs/2004.07211v2","paper_title":"Dark Experience for General Continual Learning: a Strong, Simple Baseline","code":"https://github.com/ContinualAI/avalanche","n_code_links":3,"syntology":null},{"rank_in_archive_order":13,"model":"EWC","metrics":{"F1 - macro":"0.7452"},"uses_additional_data":false,"paper_date":"2016-12-02","paper":"/paper/overcoming-catastrophic-forgetting-in-neural","paper_url":"http://arxiv.org/abs/1612.00796v2","paper_title":"Overcoming catastrophic forgetting in neural networks","code":"https://github.com/ContinualAI/avalanche","n_code_links":29,"syntology":{"n_ran":14,"n_unverified":8,"n_samples":22,"n_pointer_only_licence":4}},{"rank_in_archive_order":14,"model":"CAT","metrics":{"F1 - macro":"0.6864"},"uses_additional_data":false,"paper_date":"2021-12-18","paper":"/paper/continual-learning-of-a-mixed-sequence-of-1","paper_url":"https://arxiv.org/abs/2112.10017v1","paper_title":"Continual Learning of a Mixed Sequence of Similar and Dissimilar Tasks","code":"https://github.com/zixuanke/pycontinual","n_code_links":2,"syntology":null},{"rank_in_archive_order":15,"model":"L2","metrics":{"F1 - macro":"0.5243"},"uses_additional_data":false,"paper_date":"2016-12-02","paper":"/paper/overcoming-catastrophic-forgetting-in-neural","paper_url":"http://arxiv.org/abs/1612.00796v2","paper_title":"Overcoming catastrophic forgetting in neural networks","code":"https://github.com/ContinualAI/avalanche","n_code_links":29,"syntology":{"n_ran":14,"n_unverified":8,"n_samples":22,"n_pointer_only_licence":4}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"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":5,"rows_with_any_sample_ran":5,"distinct_papers_with_graph_line":4,"distinct_papers_with_any_sample_ran":4,"samples_over_distinct_papers":{"n_ran":17,"n_unverified":28,"n_samples":45,"n_pointer_only_licence":4,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":31,"n_unverified":36,"n_samples":67,"n_pointer_only_licence":8,"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"}}}