{"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":"/task/continual-learning/papers/ran/4","list_of":"/task/continual-learning","task":"Continual Learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,337],"of":337,"counts":{"archive_papers_tagged":2644,"with_a_code_link":1142,"where_syntology_ran_a_sample":337,"not_listed_spam_title":0,"listed":2644,"listed_where_code_ran":337,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":288,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":288,"listed_every_run_a_failure_of_syntologys_instrument":49,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/continual-learning/papers/ran/1","prev":"/task/continual-learning/papers/ran/3","next":null,"papers":[{"url":"/paper/learning-to-continually-learn","slug":"learning-to-continually-learn","title":"Learning to Continually Learn","date":"2020-02-21","arxiv_id":"2002.09571","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-continually-learn#ran","syntology_url":"https://syntology.ai/paper/2002.09571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09571"}},"official":{"repos":["uvm-neurobotics-lab/ANML"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/residual-continual-learning","slug":"residual-continual-learning","title":"Residual Continual Learning","date":"2020-02-17","arxiv_id":"2002.06774","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/residual-continual-learning#ran","syntology_url":"https://syntology.ai/paper/2002.06774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06774"}},"official":null}},{"url":"/paper/modeling-the-background-for-incremental","slug":"modeling-the-background-for-incremental","title":"Modeling the Background for Incremental Learning in Semantic Segmentation","date":"2020-02-03","arxiv_id":"2002.00718","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/modeling-the-background-for-incremental#ran","syntology_url":"https://syntology.ai/paper/2002.00718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00718"}},"official":null}},{"url":"/paper/a-neural-dirichlet-process-mixture-model-for","slug":"a-neural-dirichlet-process-mixture-model-for","title":"A Neural Dirichlet Process Mixture Model for Task-Free Continual Learning","date":"2020-01-03","arxiv_id":"2001.00689","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-neural-dirichlet-process-mixture-model-for#ran","syntology_url":"https://syntology.ai/paper/2001.00689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00689"}},"official":{"repos":["soochan-lee/CN-DPM"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dreaming-to-distill-data-free-knowledge","slug":"dreaming-to-distill-data-free-knowledge","title":"Dreaming to Distill: Data-free Knowledge Transfer via DeepInversion","date":"2019-12-18","arxiv_id":"1912.08795","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"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) · 1 unverified","sample_list":"/paper/dreaming-to-distill-data-free-knowledge#ran","syntology_url":"https://syntology.ai/paper/1912.08795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08795"}},"official":{"repos":["NVlabs/DeepInversion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/direction-concentration-learning-enhancing","slug":"direction-concentration-learning-enhancing","title":"Direction Concentration Learning: Enhancing Congruency in Machine Learning","date":"2019-12-17","arxiv_id":"1912.08136","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/direction-concentration-learning-enhancing#ran","syntology_url":"https://syntology.ai/paper/1912.08136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08136"}},"official":{"repos":["luoyan407/congruency"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-multi-task-gaussian-processes","slug":"continual-multi-task-gaussian-processes","title":"Continual Multi-task Gaussian Processes","date":"2019-10-31","arxiv_id":"1911.00002","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continual-multi-task-gaussian-processes#ran","syntology_url":"https://syntology.ai/paper/1911.00002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00002"}},"official":{"repos":["pmorenoz/ContinualGP"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/compacting-picking-and-growing-for","slug":"compacting-picking-and-growing-for","title":"Compacting, Picking and Growing for Unforgetting Continual Learning","date":"2019-10-15","arxiv_id":"1910.06562","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compacting-picking-and-growing-for#ran","syntology_url":"https://syntology.ai/paper/1910.06562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06562"}},"official":{"repos":["ivclab/CPG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/model-fusion-via-optimal-transport","slug":"model-fusion-via-optimal-transport","title":"Model Fusion via Optimal Transport","date":"2019-10-12","arxiv_id":"1910.05653","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-fusion-via-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/1910.05653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05653"}},"official":{"repos":["sidak/otfusion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lamal-language-modeling-is-all-you-need-for","slug":"lamal-language-modeling-is-all-you-need-for","title":"LAMOL: LAnguage MOdeling for Lifelong Language Learning","date":"2019-09-07","arxiv_id":"1909.03329","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lamal-language-modeling-is-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/1909.03329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03329"}},"official":{"repos":["jojotenya/LAMOL"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/online-continual-learning-with-maximally","slug":"online-continual-learning-with-maximally","title":"Online Continual Learning with Maximally Interfered Retrieval","date":"2019-08-11","arxiv_id":"1908.04742","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/online-continual-learning-with-maximally#ran","syntology_url":"https://syntology.ai/paper/1908.04742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04742"}},"official":{"repos":["optimass/Maximally_Interfered_Retrieval"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/radial-bayesian-neural-networks-robust","slug":"radial-bayesian-neural-networks-robust","title":"Radial Bayesian Neural Networks: Beyond Discrete Support In Large-Scale Bayesian Deep Learning","date":"2019-07-01","arxiv_id":"1907.00865","repositories_listed":4,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/radial-bayesian-neural-networks-robust#ran","syntology_url":"https://syntology.ai/paper/1907.00865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00865"}},"official":{"repos":["SebFar/radial_bnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/continual-and-multi-task-architecture-search","slug":"continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","arxiv_id":"1906.05226","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continual-and-multi-task-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1906.05226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05226"}},"official":{"repos":["ramakanth-pasunuru/CAS-MAS"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-guided-continual-learning-with","slug":"uncertainty-guided-continual-learning-with","title":"Uncertainty-guided Continual Learning with Bayesian Neural Networks","date":"2019-06-06","arxiv_id":"1906.02425","repositories_listed":2,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/uncertainty-guided-continual-learning-with#ran","syntology_url":"https://syntology.ai/paper/1906.02425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02425"}},"official":{"repos":["SaynaEbrahimi/UCB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/190600695","slug":"190600695","title":"Continual learning with hypernetworks","date":"2019-06-03","arxiv_id":"1906.00695","repositories_listed":9,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/190600695#ran","syntology_url":"https://syntology.ai/paper/1906.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00695"}},"official":{"repos":["chrhenning/hypercl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/episodic-memory-in-lifelong-language-learning","slug":"episodic-memory-in-lifelong-language-learning","title":"Episodic Memory in Lifelong Language Learning","date":"2019-06-03","arxiv_id":"1906.01076","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"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","sample_list":"/paper/episodic-memory-in-lifelong-language-learning#ran","syntology_url":"https://syntology.ai/paper/1906.01076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01076"}},"official":null}},{"url":"/paper/uncertainty-based-continual-learning-with","slug":"uncertainty-based-continual-learning-with","title":"Uncertainty-based Continual Learning with Adaptive Regularization","date":"2019-05-28","arxiv_id":"1905.11614","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uncertainty-based-continual-learning-with#ran","syntology_url":"https://syntology.ai/paper/1905.11614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11614"}},"official":{"repos":["csm9493/UCL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-probabilistic-deep-continual-learning","slug":"unified-probabilistic-deep-continual-learning","title":"Unified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition","date":"2019-05-28","arxiv_id":"1905.12019","repositories_listed":3,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unified-probabilistic-deep-continual-learning#ran","syntology_url":"https://syntology.ai/paper/1905.12019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12019"}},"official":{"repos":["MrtnMndt/OCDVAE_ContinualLearning","MrtnMndt/OCDVAEContinualLearning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/three-scenarios-for-continual-learning","slug":"three-scenarios-for-continual-learning","title":"Three scenarios for continual learning","date":"2019-04-15","arxiv_id":"1904.07734","repositories_listed":8,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 1 unverified","sample_list":"/paper/three-scenarios-for-continual-learning#ran","syntology_url":"https://syntology.ai/paper/1904.07734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.07734"}},"official":{"repos":["GMvandeVen/continual-learning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/unsupervised-continual-learning-and-self","slug":"unsupervised-continual-learning-and-self","title":"Unsupervised Progressive Learning and the STAM Architecture","date":"2019-04-03","arxiv_id":"1904.02021","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/unsupervised-continual-learning-and-self#ran","syntology_url":"https://syntology.ai/paper/1904.02021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02021"}},"official":{"repos":["CameronTaylorFL/stam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rates-of-convergence-for-sparse-variational","slug":"rates-of-convergence-for-sparse-variational","title":"Rates of Convergence for Sparse Variational Gaussian Process Regression","date":"2019-03-08","arxiv_id":"1903.03571","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rates-of-convergence-for-sparse-variational#ran","syntology_url":"https://syntology.ai/paper/1903.03571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03571"}},"official":null}},{"url":"/paper/policy-consolidation-for-continual","slug":"policy-consolidation-for-continual","title":"Policy Consolidation for Continual Reinforcement Learning","date":"2019-02-01","arxiv_id":"1902.00255","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/policy-consolidation-for-continual#ran","syntology_url":"https://syntology.ai/paper/1902.00255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00255"}},"official":null}},{"url":"/paper/functional-regularisation-for-continual","slug":"functional-regularisation-for-continual","title":"Functional Regularisation for Continual Learning with Gaussian Processes","date":"2019-01-31","arxiv_id":"1901.11356","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/functional-regularisation-for-continual#ran","syntology_url":"https://syntology.ai/paper/1901.11356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11356"}},"official":null}},{"url":"/paper/generative-models-from-the-perspective-of","slug":"generative-models-from-the-perspective-of","title":"Generative Models from the perspective of Continual Learning","date":"2018-12-21","arxiv_id":"1812.09111","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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","sample_list":"/paper/generative-models-from-the-perspective-of#ran","syntology_url":"https://syntology.ai/paper/1812.09111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.09111"}},"official":{"repos":["TLESORT/Generative_Continual_Learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-lifelong-learning-with-a-gem","slug":"efficient-lifelong-learning-with-a-gem","title":"Efficient Lifelong Learning with A-GEM","date":"2018-12-02","arxiv_id":"1812.00420","repositories_listed":3,"syntology":{"n":12,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"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) · 10 unverified","sample_list":"/paper/efficient-lifelong-learning-with-a-gem#ran","syntology_url":"https://syntology.ai/paper/1812.00420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00420"}},"official":{"repos":["facebookresearch/agem"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/re-evaluating-continual-learning-scenarios-a","slug":"re-evaluating-continual-learning-scenarios-a","title":"Re-evaluating Continual Learning Scenarios: A Categorization and Case for Strong Baselines","date":"2018-10-30","arxiv_id":"1810.12488","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/re-evaluating-continual-learning-scenarios-a#ran","syntology_url":"https://syntology.ai/paper/1810.12488","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.12488"}},"official":{"repos":["GT-RIPL/Continual-Learning-Benchmark"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-learn-without-forgetting-by","slug":"learning-to-learn-without-forgetting-by","title":"Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interference","date":"2018-10-29","arxiv_id":"1810.11910","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-learn-without-forgetting-by#ran","syntology_url":"https://syntology.ai/paper/1810.11910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11910"}},"official":{"repos":["mattriemer/mer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-learning-of-recurrent-neural","slug":"continual-learning-of-recurrent-neural","title":"Continual Learning of Recurrent Neural Networks by Locally Aligning Distributed Representations","date":"2018-10-17","arxiv_id":"1810.07411","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/continual-learning-of-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1810.07411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.07411"}},"official":{"repos":["AnkurMali/ContinualPTNCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-parametrization-of-multi-domain","slug":"efficient-parametrization-of-multi-domain","title":"Efficient parametrization of multi-domain deep neural networks","date":"2018-03-27","arxiv_id":"1803.10082","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-parametrization-of-multi-domain#ran","syntology_url":"https://syntology.ai/paper/1803.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10082"}},"official":null}},{"url":"/paper/task-agnostic-continual-learning-using-online","slug":"task-agnostic-continual-learning-using-online","title":"Task Agnostic Continual Learning Using Online Variational Bayes","date":"2018-03-27","arxiv_id":"1803.10123","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/task-agnostic-continual-learning-using-online#ran","syntology_url":"https://syntology.ai/paper/1803.10123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10123"}},"official":{"repos":["igolan/bgd"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/packnet-adding-multiple-tasks-to-a-single","slug":"packnet-adding-multiple-tasks-to-a-single","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","date":"2017-11-15","arxiv_id":"1711.05769","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/packnet-adding-multiple-tasks-to-a-single#ran","syntology_url":"https://syntology.ai/paper/1711.05769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05769"}},"official":{"repos":["arunmallya/packnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-continual-learning","slug":"variational-continual-learning","title":"Variational Continual Learning","date":"2017-10-29","arxiv_id":"1710.10628","repositories_listed":8,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/variational-continual-learning#ran","syntology_url":"https://syntology.ai/paper/1710.10628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10628"}},"official":null}},{"url":"/paper/continual-learning-through-synaptic","slug":"continual-learning-through-synaptic","title":"Continual Learning Through Synaptic Intelligence","date":"2017-03-13","arxiv_id":"1703.04200","repositories_listed":6,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/continual-learning-through-synaptic#ran","syntology_url":"https://syntology.ai/paper/1703.04200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04200"}},"official":{"repos":["ganguli-lab/pathint"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/pathnet-evolution-channels-gradient-descent","slug":"pathnet-evolution-channels-gradient-descent","title":"PathNet: Evolution Channels Gradient Descent in Super Neural Networks","date":"2017-01-30","arxiv_id":"1701.08734","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 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) · 1 unverified","sample_list":"/paper/pathnet-evolution-channels-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1701.08734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.08734"}},"official":null}},{"url":"/paper/overcoming-catastrophic-forgetting-in-neural","slug":"overcoming-catastrophic-forgetting-in-neural","title":"Overcoming catastrophic forgetting in neural networks","date":"2016-12-02","arxiv_id":"1612.00796","repositories_listed":29,"syntology":{"n":22,"n_ran":16,"n_constructed":8,"n_ran_checked":12,"n_instrument":4,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"phrase":"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","sample_list":"/paper/overcoming-catastrophic-forgetting-in-neural#ran","syntology_url":"https://syntology.ai/paper/1612.00796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.00796"}},"official":null}},{"url":"/paper/learning-without-forgetting","slug":"learning-without-forgetting","title":"Learning without Forgetting","date":"2016-06-29","arxiv_id":"1606.09282","repositories_listed":12,"syntology":{"n":15,"n_ran":9,"n_constructed":3,"n_ran_checked":4,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/learning-without-forgetting#ran","syntology_url":"https://syntology.ai/paper/1606.09282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.09282"}},"official":null}},{"url":"/paper/progressive-neural-networks","slug":"progressive-neural-networks","title":"Progressive Neural Networks","date":"2016-06-15","arxiv_id":"1606.04671","repositories_listed":12,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/progressive-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1606.04671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04671"}},"official":null}}],"record_sha256":"8ea3989795359ac9075e4e28df9bad7f9c58c58c78e2ed8b0f456aa7cde948e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}