{"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":"/code/continualmodel","entry":"ContinualModel","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":10,"n_samples_ran":6,"n_samples_constructed":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":5,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":4},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2403.13249","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-and-general-framework-for-continual","title":"A Unified and General Framework for Continual Learning","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/cl-refresh-learning","path":"models/rpc.py","file_url":"https://github.com/joey-wang123/cl-refresh-learning/blob/HEAD/models/rpc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf632e025b73ed65","code_sha256_prefix":"cf632e025b73ed65","mcp_get_code":{"code_sha256":"cf632e025b73ed65"}},{"arxiv_id":"2403.04398","arxiv_id_is_arxiv":true,"paper":"/paper/magr-manifold-aligned-graph-regularization","title":"MAGR: Manifold-Aligned Graph Regularization for Continual Action Quality Assessment","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhouKanglei/MAGR_CAQA","path":"models/fea_gr.py","file_url":"https://github.com/ZhouKanglei/MAGR_CAQA/blob/HEAD/models/fea_gr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZhouKanglei/MAGR_CAQA when it was checked","code_sha256":"45fc3083f9e5c62e","code_sha256_prefix":"45fc3083f9e5c62e","mcp_get_code":{"code_sha256":"45fc3083f9e5c62e"}},{"arxiv_id":"2310.08217","arxiv_id_is_arxiv":true,"paper":"/paper/trire-a-multi-mechanism-learning-paradigm-for-1","title":"TriRE: A Multi-Mechanism Learning Paradigm for Continual Knowledge Retention and Promotion","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/TriRE","path":"models/trire.py","file_url":"https://github.com/NeurAI-Lab/TriRE/blob/HEAD/models/trire.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NeurAI-Lab/TriRE when it was checked","code_sha256":"217935831367f94e","code_sha256_prefix":"217935831367f94e","mcp_get_code":{"code_sha256":"217935831367f94e"}},{"arxiv_id":"2308.13324","arxiv_id_is_arxiv":true,"paper":"/paper/conslide-asynchronous-hierarchical","title":"ConSlide: Asynchronous Hierarchical Interaction Transformer with Breakup-Reorganize Rehearsal for Continual Whole Slide Image Analysis","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKU-MedAI/ConSlide","path":"models/conslide.py","file_url":"https://github.com/HKU-MedAI/ConSlide/blob/HEAD/models/conslide.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HKU-MedAI/ConSlide when it was checked","code_sha256":"b516b9ecb69103f7","code_sha256_prefix":"b516b9ecb69103f7","mcp_get_code":{"code_sha256":"b516b9ecb69103f7"}},{"arxiv_id":"2305.18806","arxiv_id_is_arxiv":true,"paper":"/paper/prediction-error-based-classification-for","title":"Prediction Error-based Classification for Class-Incremental Learning","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michalzajac-ml/pec","path":"models/pec.py","file_url":"https://github.com/michalzajac-ml/pec/blob/HEAD/models/pec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ffb4ae870279d896","code_sha256_prefix":"ffb4ae870279d896","mcp_get_code":{"code_sha256":"ffb4ae870279d896"}},{"arxiv_id":"2302.11346","arxiv_id_is_arxiv":true,"paper":"/paper/task-aware-information-routing-from-common","title":"Task-Aware Information Routing from Common Representation Space in Lifelong Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/tamil","path":"models/tam.py","file_url":"https://github.com/neurai-lab/tamil/blob/HEAD/models/tam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, neurai-lab/tamil when it was checked","code_sha256":"e05a511f5e2451f1","code_sha256_prefix":"e05a511f5e2451f1","mcp_get_code":{"code_sha256":"e05a511f5e2451f1"}},{"arxiv_id":"2302.11344","arxiv_id_is_arxiv":true,"paper":"/paper/error-sensitivity-modulation-based-experience","title":"Error Sensitivity Modulation based Experience Replay: Mitigating Abrupt Representation Drift in Continual Learning","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurai-lab/esmer","path":"models/esmer.py","file_url":"https://github.com/neurai-lab/esmer/blob/HEAD/models/esmer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57fede31419af8bc","code_sha256_prefix":"57fede31419af8bc","mcp_get_code":{"code_sha256":"57fede31419af8bc"}},{"arxiv_id":"2302.01242","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-symbolic-continual-learning-knowledge","title":"Neuro-Symbolic Continual Learning: Knowledge, Reasoning Shortcuts and Concept Rehearsal","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ema-marconato/nesy-cl","path":"models/cool.py","file_url":"https://github.com/ema-marconato/nesy-cl/blob/HEAD/models/cool.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"68ac932d64459c47","code_sha256_prefix":"68ac932d64459c47","mcp_get_code":{"code_sha256":"68ac932d64459c47"}},{"arxiv_id":"2201.12604","arxiv_id_is_arxiv":true,"paper":"/paper/learning-fast-learning-slow-a-general-1","title":"Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning System","date":"2022-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurAI-Lab/CLS-ER","path":"models/clser.py","file_url":"https://github.com/NeurAI-Lab/CLS-ER/blob/HEAD/models/clser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"364c8278b0b06479","code_sha256_prefix":"364c8278b0b06479","mcp_get_code":{"code_sha256":"364c8278b0b06479"}},{"arxiv_id":"2110.06976","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-representational-continuity-1","title":"Representational Continuity for Unsupervised Continual Learning","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divyam3897/ucl","path":"models/mixup.py","file_url":"https://github.com/divyam3897/ucl/blob/HEAD/models/mixup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, divyam3897/ucl (NOASSERTION)","code_sha256":"903bc2472f853661","code_sha256_prefix":"903bc2472f853661","mcp_get_code":{"code_sha256":"903bc2472f853661"}}],"record_sha256":"83e6e9dcd0a3e98b3c524c5e2243f19217dccf4df071d38b20d267acd69d0ec1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}