{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":27,"rows_per_page":100,"rows":[101,200],"of":2644,"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","prev":"/task/continual-learning","next":"/task/continual-learning/papers/3","papers":[{"url":"/paper/continual-sequence-generation-with-adaptive","slug":"continual-sequence-generation-with-adaptive","title":"Continual Sequence Generation with Adaptive Compositional Modules","date":"2022-03-20","arxiv_id":"2203.10652","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continual-sequence-generation-with-adaptive#ran","syntology_url":"https://syntology.ai/paper/2203.10652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10652"}},"official":{"repos":["GT-SALT/Adaptive-Compositional-Modules"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/new-insights-on-reducing-abrupt-1","slug":"new-insights-on-reducing-abrupt-1","title":"New Insights on Reducing Abrupt Representation Change in Online Continual Learning","date":"2022-03-08","arxiv_id":"2203.03798","repositories_listed":2,"syntology":null},{"url":"/paper/timelms-diachronic-language-models-from","slug":"timelms-diachronic-language-models-from","title":"TimeLMs: Diachronic Language Models from Twitter","date":"2022-02-08","arxiv_id":"2202.03829","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/timelms-diachronic-language-models-from#ran","syntology_url":"https://syntology.ai/paper/2202.03829","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03829"}},"official":{"repos":["cardiffnlp/timelms"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/dataset-condensation-with-contrastive-signals","slug":"dataset-condensation-with-contrastive-signals","title":"Dataset Condensation with Contrastive Signals","date":"2022-02-07","arxiv_id":"2202.02916","repositories_listed":2,"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/dataset-condensation-with-contrastive-signals#ran","syntology_url":"https://syntology.ai/paper/2202.02916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02916"}},"official":{"repos":["saehyung-lee/dcc"],"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/progressive-continual-learning-for-spoken","slug":"progressive-continual-learning-for-spoken","title":"Progressive Continual Learning for Spoken Keyword Spotting","date":"2022-01-29","arxiv_id":"2201.12546","repositories_listed":2,"syntology":null},{"url":"/paper/beyond-simple-meta-learning-multi-purpose","slug":"beyond-simple-meta-learning-multi-purpose","title":"Beyond Simple Meta-Learning: Multi-Purpose Models for Multi-Domain, Active and Continual Few-Shot Learning","date":"2022-01-13","arxiv_id":"2201.05151","repositories_listed":2,"syntology":null},{"url":"/paper/recursive-least-squares-estimator-aided-1","slug":"recursive-least-squares-estimator-aided-1","title":"Recursive Least-Squares Estimator-Aided Online Learning for Visual Tracking","date":"2021-12-28","arxiv_id":"2112.14016","repositories_listed":2,"syntology":null},{"url":"/paper/continual-learning-of-a-mixed-sequence-of-1","slug":"continual-learning-of-a-mixed-sequence-of-1","title":"Continual Learning of a Mixed Sequence of Similar and Dissimilar Tasks","date":"2021-12-18","arxiv_id":"2112.10017","repositories_listed":2,"syntology":null},{"url":"/paper/continual-learning-with-knowledge-transfer","slug":"continual-learning-with-knowledge-transfer","title":"Continual Learning with Knowledge Transfer for Sentiment Classification","date":"2021-12-18","arxiv_id":"2112.10021","repositories_listed":2,"syntology":null},{"url":"/paper/joint-inference-for-neural-network-depth-and","slug":"joint-inference-for-neural-network-depth-and","title":"Joint Inference for Neural Network Depth and Dropout Regularization","date":"2021-11-08","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/on-label-efficient-computer-vision-building","slug":"on-label-efficient-computer-vision-building","title":"On Label-Efficient Computer Vision: Building Fast and Effective Few-Shot Image Classifiers","date":"2021-10-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/streaming-decision-trees-and-forests","slug":"streaming-decision-trees-and-forests","title":"Simplest Streaming Trees","date":"2021-10-16","arxiv_id":"2110.08483","repositories_listed":2,"syntology":null},{"url":"/paper/towards-continual-knowledge-learning-of","slug":"towards-continual-knowledge-learning-of","title":"Towards Continual Knowledge Learning of Language Models","date":"2021-10-07","arxiv_id":"2110.03215","repositories_listed":2,"syntology":null},{"url":"/paper/re-using-adversarial-mask-discriminators-for","slug":"re-using-adversarial-mask-discriminators-for","title":"Re-using Adversarial Mask Discriminators for Test-time Training under Distribution Shifts","date":"2021-08-26","arxiv_id":"2108.11926","repositories_listed":2,"syntology":null},{"url":"/paper/weakly-supervised-continual-learning","slug":"weakly-supervised-continual-learning","title":"Continual Semi-Supervised Learning through Contrastive Interpolation Consistency","date":"2021-08-14","arxiv_id":"2108.06552","repositories_listed":2,"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":2,"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/weakly-supervised-continual-learning#ran","syntology_url":"https://syntology.ai/paper/2108.06552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06552"}},"official":{"repos":["loribonna/cssl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/task-specific-normalization-for-continual","slug":"task-specific-normalization-for-continual","title":"Task-Specific Normalization for Continual Learning of Blind Image Quality Models","date":"2021-07-28","arxiv_id":"2107.13429","repositories_listed":2,"syntology":null},{"url":"/paper/cored-generalizing-fake-media-detection-with","slug":"cored-generalizing-fake-media-detection-with","title":"CoReD: Generalizing Fake Media Detection with Continual Representation using Distillation","date":"2021-07-06","arxiv_id":"2107.02408","repositories_listed":2,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/cored-generalizing-fake-media-detection-with#ran","syntology_url":"https://syntology.ai/paper/2107.02408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02408"}},"official":null}},{"url":"/paper/tackling-catastrophic-forgetting-and","slug":"tackling-catastrophic-forgetting-and","title":"Tackling Catastrophic Forgetting and Background Shift in Continual Semantic Segmentation","date":"2021-06-29","arxiv_id":"2106.15287","repositories_listed":2,"syntology":null},{"url":"/paper/boosting-a-model-zoo-for-multi-task-and","slug":"boosting-a-model-zoo-for-multi-task-and","title":"Model Zoo: A Growing \"Brain\" That Learns Continually","date":"2021-06-06","arxiv_id":"2106.03027","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/boosting-a-model-zoo-for-multi-task-and#ran","syntology_url":"https://syntology.ai/paper/2106.03027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03027"}},"official":{"repos":["grasp-lyrl/modelzoo_continual","rahul13ramesh/modelzoo_continual"],"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/a-procedural-world-generation-framework-for","slug":"a-procedural-world-generation-framework-for","title":"A Procedural World Generation Framework for Systematic Evaluation of Continual Learning","date":"2021-06-04","arxiv_id":"2106.02585","repositories_listed":2,"syntology":null},{"url":"/paper/structured-ensembles-an-approach-to-reduce","slug":"structured-ensembles-an-approach-to-reduce","title":"Structured Ensembles: an Approach to Reduce the Memory Footprint of Ensemble Methods","date":"2021-05-06","arxiv_id":"2105.02551","repositories_listed":2,"syntology":null},{"url":"/paper/class-incremental-learning-with-generative","slug":"class-incremental-learning-with-generative","title":"Class-Incremental Learning with Generative Classifiers","date":"2021-04-20","arxiv_id":"2104.10093","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/class-incremental-learning-with-generative#ran","syntology_url":"https://syntology.ai/paper/2104.10093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.10093"}},"official":{"repos":["GMvandeVen/class-incremental-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reducing-representation-drift-in-online","slug":"reducing-representation-drift-in-online","title":"New Insights on Reducing Abrupt Representation Change in Online Continual Learning","date":"2021-04-11","arxiv_id":"2104.05025","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 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) · 1 unverified","sample_list":"/paper/reducing-representation-drift-in-online#ran","syntology_url":"https://syntology.ai/paper/2104.05025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05025"}},"official":{"repos":["naderAsadi/AML","pclucas14/aml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/distilled-replay-overcoming-forgetting","slug":"distilled-replay-overcoming-forgetting","title":"Distilled Replay: Overcoming Forgetting through Synthetic Samples","date":"2021-03-29","arxiv_id":"2103.15851","repositories_listed":2,"syntology":null},{"url":"/paper/continuous-coordination-as-a-realistic","slug":"continuous-coordination-as-a-realistic","title":"Continuous Coordination As a Realistic Scenario for Lifelong Learning","date":"2021-03-04","arxiv_id":"2103.03216","repositories_listed":2,"syntology":null},{"url":"/paper/dataset-condensation-with-differentiable","slug":"dataset-condensation-with-differentiable","title":"Dataset Condensation with Differentiable Siamese Augmentation","date":"2021-02-16","arxiv_id":"2102.08259","repositories_listed":2,"syntology":null},{"url":"/paper/rethinking-quadratic-regularizers-explicit","slug":"rethinking-quadratic-regularizers-explicit","title":"How do Quadratic Regularizers Prevent Catastrophic Forgetting: The Role of Interpolation","date":"2021-02-04","arxiv_id":"2102.02805","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-quadratic-regularizers-explicit#ran","syntology_url":"https://syntology.ai/paper/2102.02805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.02805"}},"official":{"repos":["EkdeepSLubana/EMR","EkdeepSLubana/QRforgetting"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-continual-learning-with-modular-1","slug":"efficient-continual-learning-with-modular-1","title":"Efficient Continual Learning with Modular Networks and Task-Driven Priors","date":"2020-12-23","arxiv_id":"2012.12631","repositories_listed":2,"syntology":null},{"url":"/paper/river-machine-learning-for-streaming-data-in","slug":"river-machine-learning-for-streaming-data-in","title":"River: machine learning for streaming data in Python","date":"2020-12-08","arxiv_id":"2012.04740","repositories_listed":2,"syntology":null},{"url":"/paper/look-ahead-meta-learning-for-continual","slug":"look-ahead-meta-learning-for-continual","title":"Look-ahead Meta Learning for Continual Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/plop-learning-without-forgetting-for","slug":"plop-learning-without-forgetting-for","title":"PLOP: Learning without Forgetting for Continual Semantic Segmentation","date":"2020-11-23","arxiv_id":"2011.11390","repositories_listed":2,"syntology":null},{"url":"/paper/a-theoretical-analysis-of-catastrophic","slug":"a-theoretical-analysis-of-catastrophic","title":"A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrix","date":"2020-10-07","arxiv_id":"2010.04003","repositories_listed":2,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"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) · 6 unverified","sample_list":"/paper/a-theoretical-analysis-of-catastrophic#ran","syntology_url":"https://syntology.ai/paper/2010.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04003"}},"official":{"repos":["tldoan/PCA-OGD"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/continual-prototype-evolution-learning-online","slug":"continual-prototype-evolution-learning-online","title":"Continual Prototype Evolution: Learning Online from Non-Stationary Data Streams","date":"2020-09-02","arxiv_id":"2009.00919","repositories_listed":2,"syntology":null},{"url":"/paper/ratt-recurrent-attention-to-transient-tasks","slug":"ratt-recurrent-attention-to-transient-tasks","title":"RATT: Recurrent Attention to Transient Tasks for Continual Image Captioning","date":"2020-07-13","arxiv_id":"2007.06271","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-networks-with-continual-learning","slug":"graph-neural-networks-with-continual-learning","title":"Graph Neural Networks with Continual Learning for Fake News Detection from Social Media","date":"2020-07-07","arxiv_id":"2007.03316","repositories_listed":2,"syntology":null},{"url":"/paper/in-the-wild-from-ml-models-to-pragmatic-ml","slug":"in-the-wild-from-ml-models-to-pragmatic-ml","title":"FLUID: A Unified Evaluation Framework for Flexible Sequential Data","date":"2020-07-06","arxiv_id":"2007.02519","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-regularisation-methods-for","slug":"understanding-regularisation-methods-for","title":"Unifying Regularisation Methods for Continual Learning","date":"2020-06-11","arxiv_id":"2006.06357","repositories_listed":2,"syntology":null},{"url":"/paper/explaining-how-deep-neural-networks-forget-by","slug":"explaining-how-deep-neural-networks-forget-by","title":"Explaining How Deep Neural Networks Forget by Deep Visualization","date":"2020-05-03","arxiv_id":"2005.01004","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/explaining-how-deep-neural-networks-forget-by#ran","syntology_url":"https://syntology.ai/paper/2005.01004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01004"}},"official":{"repos":["giangnguyen2412/dissect_catastrophic_forgetting"],"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/visually-grounded-continual-learning-of","slug":"visually-grounded-continual-learning-of","title":"Visually Grounded Continual Learning of Compositional Phrases","date":"2020-05-02","arxiv_id":"2005.00785","repositories_listed":2,"syntology":null},{"url":"/paper/importance-driven-continual-learning-for","slug":"importance-driven-continual-learning-for","title":"Importance Driven Continual Learning for Segmentation Across Domains","date":"2020-04-30","arxiv_id":"2005.00079","repositories_listed":2,"syntology":null},{"url":"/paper/small-task-incremental-learning","slug":"small-task-incremental-learning","title":"PODNet: Pooled Outputs Distillation for Small-Tasks Incremental Learning","date":"2020-04-28","arxiv_id":"2004.13513","repositories_listed":2,"syntology":null},{"url":"/paper/dropout-as-an-implicit-gating-mechanism-for","slug":"dropout-as-an-implicit-gating-mechanism-for","title":"Dropout as an Implicit Gating Mechanism For Continual Learning","date":"2020-04-24","arxiv_id":"2004.11545","repositories_listed":2,"syntology":null},{"url":"/paper/defining-benchmarks-for-continual-few-shot","slug":"defining-benchmarks-for-continual-few-shot","title":"Defining Benchmarks for Continual Few-Shot Learning","date":"2020-04-15","arxiv_id":"2004.11967","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/defining-benchmarks-for-continual-few-shot#ran","syntology_url":"https://syntology.ai/paper/2004.11967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11967"}},"official":{"repos":["AntreasAntoniou/FewShotContinualLearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/mnemonics-training-multi-class-incremental","slug":"mnemonics-training-multi-class-incremental","title":"Mnemonics Training: Multi-Class Incremental Learning without Forgetting","date":"2020-02-24","arxiv_id":"2002.10211","repositories_listed":2,"syntology":null},{"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/online-continual-learning-with-maximal","slug":"online-continual-learning-with-maximal","title":"Online Continual Learning with Maximal Interfered Retrieval","date":"2019-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/increasingly-packing-multiple-facial","slug":"increasingly-packing-multiple-facial","title":"Increasingly Packing Multiple Facial-Informatics Modules in A Unified Deep-Learning Model via Lifelong Learning","date":"2019-06-10","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/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/learning-to-remember-a-synaptic-plasticity","slug":"learning-to-remember-a-synaptic-plasticity","title":"Learning to Remember: A Synaptic Plasticity Driven Framework for Continual Learning","date":"2019-04-05","arxiv_id":"1904.03137","repositories_listed":2,"syntology":null},{"url":"/paper/a-unifying-bayesian-view-of-continual","slug":"a-unifying-bayesian-view-of-continual","title":"A Unifying Bayesian View of Continual Learning","date":"2019-02-18","arxiv_id":"1902.06494","repositories_listed":2,"syntology":null},{"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/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/overcoming-catastrophic-forgetting-with-hard","slug":"overcoming-catastrophic-forgetting-with-hard","title":"Overcoming catastrophic forgetting with hard attention to the task","date":"2018-01-04","arxiv_id":"1801.01423","repositories_listed":2,"syntology":null},{"url":"/paper/learning-multiple-visual-domains-with","slug":"learning-multiple-visual-domains-with","title":"Learning multiple visual domains with residual adapters","date":"2017-05-22","arxiv_id":"1705.08045","repositories_listed":2,"syntology":null},{"url":"/paper/generative-and-discriminative-text","slug":"generative-and-discriminative-text","title":"Generative and Discriminative Text Classification with Recurrent Neural Networks","date":"2017-03-06","arxiv_id":"1703.01898","repositories_listed":2,"syntology":null},{"url":"/paper/lifelongpr-lifelong-knowledge-fusion-for","slug":"lifelongpr-lifelong-knowledge-fusion-for","title":"LifelongPR: Lifelong knowledge fusion for point cloud place recognition based on replay and prompt learning","date":"2025-07-14","arxiv_id":"2507.10034","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-query-based-transformer-for-1","slug":"rethinking-query-based-transformer-for-1","title":"Rethinking Query-based Transformer for Continual Image Segmentation","date":"2025-07-10","arxiv_id":"2507.07831","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":1,"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/rethinking-query-based-transformer-for-1#ran","syntology_url":"https://syntology.ai/paper/2507.07831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.07831"}},"official":{"repos":["soolab/simcis"],"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/addressing-imbalanced-domain-incremental","slug":"addressing-imbalanced-domain-incremental","title":"Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Experts","date":"2025-07-09","arxiv_id":"2507.07100","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":11,"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) · 4 unverified","sample_list":"/paper/addressing-imbalanced-domain-incremental#ran","syntology_url":"https://syntology.ai/paper/2507.07100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.07100"}},"official":{"repos":["lain810/dce"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/growing-transformers-modular-composition-and","slug":"growing-transformers-modular-composition-and","title":"Growing Transformers: Modular Composition and Layer-wise Expansion on a Frozen Substrate","date":"2025-07-08","arxiv_id":"2507.07129","repositories_listed":1,"syntology":null},{"url":"/paper/psat-pediatric-segmentation-approaches-via","slug":"psat-pediatric-segmentation-approaches-via","title":"PSAT: Pediatric Segmentation Approaches via Adult Augmentations and Transfer Learning","date":"2025-07-08","arxiv_id":"2507.05764","repositories_listed":1,"syntology":null},{"url":"/paper/remember-past-anticipate-future-learning","slug":"remember-past-anticipate-future-learning","title":"Remember Past, Anticipate Future: Learning Continual Multimodal Misinformation Detectors","date":"2025-07-08","arxiv_id":"2507.05939","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-the-devastating-effects-of-single","slug":"addressing-the-devastating-effects-of-single","title":"Addressing The Devastating Effects Of Single-Task Data Poisoning In Exemplar-Free Continual Learning","date":"2025-07-05","arxiv_id":"2507.04106","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-continual-learning-with-prior-1","slug":"temporal-continual-learning-with-prior-1","title":"Temporal Continual Learning with Prior Compensation for Human Motion Prediction","date":"2025-07-05","arxiv_id":"2507.04060","repositories_listed":1,"syntology":null},{"url":"/paper/samed-2-selective-memory-enhanced-medical","slug":"samed-2-selective-memory-enhanced-medical","title":"SAMed-2: Selective Memory Enhanced Medical Segment Anything Model","date":"2025-07-04","arxiv_id":"2507.03698","repositories_listed":1,"syntology":null},{"url":"/paper/continual-gradient-low-rank-projection-fine","slug":"continual-gradient-low-rank-projection-fine","title":"Continual Gradient Low-Rank Projection Fine-Tuning for LLMs","date":"2025-07-03","arxiv_id":"2507.02503","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/continual-gradient-low-rank-projection-fine#ran","syntology_url":"https://syntology.ai/paper/2507.02503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.02503"}},"official":{"repos":["wcxwcxw/gorp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-comprehensive-survey-on-continual-learning","slug":"a-comprehensive-survey-on-continual-learning","title":"A Comprehensive Survey on Continual Learning in Generative Models","date":"2025-06-16","arxiv_id":"2506.13045","repositories_listed":1,"syntology":null},{"url":"/paper/swe-bench-cl-continual-learning-for-coding","slug":"swe-bench-cl-continual-learning-for-coding","title":"SWE-Bench-CL: Continual Learning for Coding Agents","date":"2025-06-13","arxiv_id":"2507.00014","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/swe-bench-cl-continual-learning-for-coding#ran","syntology_url":"https://syntology.ai/paper/2507.00014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2507.00014"}},"official":{"repos":["thomasjoshi/agents-never-forget"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/saturation-self-organizing-map","slug":"saturation-self-organizing-map","title":"Saturation Self-Organizing Map","date":"2025-06-12","arxiv_id":"2506.10680","repositories_listed":1,"syntology":null},{"url":"/paper/treelora-efficient-continual-learning-via","slug":"treelora-efficient-continual-learning-via","title":"TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Tree","date":"2025-06-12","arxiv_id":"2506.10355","repositories_listed":1,"syntology":null},{"url":"/paper/adapt-before-continual-learning","slug":"adapt-before-continual-learning","title":"Adapt before Continual Learning","date":"2025-06-04","arxiv_id":"2506.03956","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-stability-plasticity-trade-off","slug":"rethinking-the-stability-plasticity-trade-off","title":"Rethinking the Stability-Plasticity Trade-off in Continual Learning from an Architectural Perspective","date":"2025-06-04","arxiv_id":"2506.03951","repositories_listed":1,"syntology":null},{"url":"/paper/chameleon-a-matmul-free-temporal","slug":"chameleon-a-matmul-free-temporal","title":"Chameleon: A MatMul-Free Temporal Convolutional Network Accelerator for End-to-End Few-Shot and Continual Learning from Sequential Data","date":"2025-05-30","arxiv_id":"2505.24852","repositories_listed":1,"syntology":null},{"url":"/paper/cl-lora-continual-low-rank-adaptation-for","slug":"cl-lora-continual-low-rank-adaptation-for","title":"CL-LoRA: Continual Low-Rank Adaptation for Rehearsal-Free Class-Incremental Learning","date":"2025-05-30","arxiv_id":"2505.24816","repositories_listed":1,"syntology":null},{"url":"/paper/when-large-multimodal-models-confront","slug":"when-large-multimodal-models-confront","title":"When Large Multimodal Models Confront Evolving Knowledge:Challenges and Pathways","date":"2025-05-30","arxiv_id":"2505.24449","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-large-multimodal-models-confront#ran","syntology_url":"https://syntology.ai/paper/2505.24449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24449"}},"official":{"repos":["EVOKE-LMM/EVOKE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/lada-scalable-label-specific-clip-adapter-for","slug":"lada-scalable-label-specific-clip-adapter-for","title":"LADA: Scalable Label-Specific CLIP Adapter for Continual Learning","date":"2025-05-29","arxiv_id":"2505.23271","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/lada-scalable-label-specific-clip-adapter-for#ran","syntology_url":"https://syntology.ai/paper/2505.23271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23271"}},"official":{"repos":["maolinluo/lada"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/irs-incremental-relationship-guided","slug":"irs-incremental-relationship-guided","title":"IRS: Incremental Relationship-guided Segmentation for Digital Pathology","date":"2025-05-28","arxiv_id":"2505.22855","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-freezing-sparse-tuning-enhances","slug":"beyond-freezing-sparse-tuning-enhances","title":"Beyond Freezing: Sparse Tuning Enhances Plasticity in Continual Learning with Pre-Trained Models","date":"2025-05-26","arxiv_id":"2505.19943","repositories_listed":1,"syntology":null},{"url":"/paper/cut-out-and-replay-a-simple-yet-versatile","slug":"cut-out-and-replay-a-simple-yet-versatile","title":"Cut out and Replay: A Simple yet Versatile Strategy for Multi-Label Online Continual Learning","date":"2025-05-26","arxiv_id":"2505.19680","repositories_listed":1,"syntology":null},{"url":"/paper/mm-prompt-cross-modal-prompt-tuning-for","slug":"mm-prompt-cross-modal-prompt-tuning-for","title":"MM-Prompt: Cross-Modal Prompt Tuning for Continual Visual Question Answering","date":"2025-05-26","arxiv_id":"2505.19455","repositories_listed":1,"syntology":null},{"url":"/paper/can-llms-alleviate-catastrophic-forgetting-in","slug":"can-llms-alleviate-catastrophic-forgetting-in","title":"Can LLMs Alleviate Catastrophic Forgetting in Graph Continual Learning? A Systematic Study","date":"2025-05-24","arxiv_id":"2505.18697","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-grafting-of-large-language-models","slug":"knowledge-grafting-of-large-language-models","title":"Knowledge Grafting of Large Language Models","date":"2025-05-24","arxiv_id":"2505.18502","repositories_listed":1,"syntology":null},{"url":"/paper/learning-without-isolation-pathway-protection","slug":"learning-without-isolation-pathway-protection","title":"Learning without Isolation: Pathway Protection for Continual Learning","date":"2025-05-24","arxiv_id":"2505.18568","repositories_listed":1,"syntology":null},{"url":"/paper/the-cell-must-go-on-agar-io-for-continual","slug":"the-cell-must-go-on-agar-io-for-continual","title":"The Cell Must Go On: Agar.io for Continual Reinforcement Learning","date":"2025-05-23","arxiv_id":"2505.18347","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-ensembling-insights-from-online","slug":"bayesian-ensembling-insights-from-online","title":"Bayesian Ensembling: Insights from Online Optimization and Empirical Bayes","date":"2025-05-21","arxiv_id":"2505.15638","repositories_listed":1,"syntology":null},{"url":"/paper/gated-integration-of-low-rank-adaptation-for","slug":"gated-integration-of-low-rank-adaptation-for","title":"Gated Integration of Low-Rank Adaptation for Continual Learning of Language Models","date":"2025-05-21","arxiv_id":"2505.15424","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gated-integration-of-low-rank-adaptation-for#ran","syntology_url":"https://syntology.ai/paper/2505.15424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15424"}},"official":{"repos":["liangyanshuo/gainlora"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/questioning-representational-optimism-in-deep","slug":"questioning-representational-optimism-in-deep","title":"Questioning Representational Optimism in Deep Learning: The Fractured Entangled Representation Hypothesis","date":"2025-05-16","arxiv_id":"2505.11581","repositories_listed":1,"syntology":null},{"url":"/paper/imaginebench-evaluating-reinforcement","slug":"imaginebench-evaluating-reinforcement","title":"ImagineBench: Evaluating Reinforcement Learning with Large Language Model Rollouts","date":"2025-05-15","arxiv_id":"2505.10010","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-brain-inspired-mechanisms-for","slug":"incorporating-brain-inspired-mechanisms-for","title":"Incorporating brain-inspired mechanisms for multimodal learning in artificial intelligence","date":"2025-05-15","arxiv_id":"2505.10176","repositories_listed":1,"syntology":null},{"url":"/paper/preprompt-predictive-prompting-for-class","slug":"preprompt-predictive-prompting-for-class","title":"PrePrompt: Predictive prompting for class incremental learning","date":"2025-05-13","arxiv_id":"2505.08586","repositories_listed":1,"syntology":null},{"url":"/paper/sacfl-self-adaptive-federated-continual","slug":"sacfl-self-adaptive-federated-continual","title":"SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices","date":"2025-05-01","arxiv_id":"2505.00365","repositories_listed":1,"syntology":null},{"url":"/paper/memorization-and-knowledge-injection-in-gated","slug":"memorization-and-knowledge-injection-in-gated","title":"Memorization and Knowledge Injection in Gated LLMs","date":"2025-04-30","arxiv_id":"2504.21239","repositories_listed":1,"syntology":null},{"url":"/paper/action-flow-matching-for-continual-robot","slug":"action-flow-matching-for-continual-robot","title":"Action Flow Matching for Continual Robot Learning","date":"2025-04-25","arxiv_id":"2504.18471","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/action-flow-matching-for-continual-robot#ran","syntology_url":"https://syntology.ai/paper/2504.18471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.18471"}},"official":{"repos":["alejandromllo/action_flow_matching"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-mean-teacher-algorithm-for-unlearning-of","slug":"a-mean-teacher-algorithm-for-unlearning-of","title":"A mean teacher algorithm for unlearning of language models","date":"2025-04-18","arxiv_id":"2504.13388","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-continual-learning-and-forgetting-in","slug":"bayesian-continual-learning-and-forgetting-in","title":"Bayesian continual learning and forgetting in neural networks","date":"2025-04-18","arxiv_id":"2504.13569","repositories_listed":1,"syntology":null},{"url":"/paper/lora-based-continual-learning-with","slug":"lora-based-continual-learning-with","title":"LoRA-Based Continual Learning with Constraints on Critical Parameter Changes","date":"2025-04-18","arxiv_id":"2504.13407","repositories_listed":1,"syntology":null}],"record_sha256":"f5395149edb3bcc8cf5015d78507a7da5499f799b02550b124f84ffd22f55b5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}