{"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/baselearner","entry":"BaseLearner","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":15,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":15,"n_samples_ran":4,"n_samples_constructed":2,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":11,"n_samples_fingerprinted":2,"n_places":15,"n_places_pointer_only":9,"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":4,"unverified":11},"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":"2603.10237","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10237","title":"One Adapter for All: Towards Unified Representation in Step-Imbalanced Class-Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"xiaoyanzhang1/One-A","path":"models/onea.py","file_url":"https://github.com/xiaoyanzhang1/One-A/blob/HEAD/models/onea.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":"3b604a0669da1fed","code_sha256_prefix":"3b604a0669da1fed","mcp_get_code":{"code_sha256":"3b604a0669da1fed"}},{"arxiv_id":"2603.08426","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08426","title":"Grow, Assess, Compress: Adaptive Backbone Scaling for Memory-Efficient Class Incremental Learning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ai-digilab/GRACE","path":"models/grace.py","file_url":"https://github.com/ai-digilab/GRACE/blob/HEAD/models/grace.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, ai-digilab/GRACE (NOASSERTION)","code_sha256":"cd16fc835c393fa7","code_sha256_prefix":"cd16fc835c393fa7","mcp_get_code":{"code_sha256":"cd16fc835c393fa7"}},{"arxiv_id":"2602.17559","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17559","title":"Revisiting Weight Regularization for Low-Rank Continual Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yaoyz96/low-rank-cl","path":"methods/ewclora.py","file_url":"https://github.com/yaoyz96/low-rank-cl/blob/HEAD/methods/ewclora.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":"79e232a82a8317e0","code_sha256_prefix":"79e232a82a8317e0","mcp_get_code":{"code_sha256":"79e232a82a8317e0"}},{"arxiv_id":"2502.20032","arxiv_id_is_arxiv":true,"paper":"/paper/order-robust-class-incremental-learning-graph","title":"Order-Robust Class Incremental Learning: Graph-Driven Dynamic Similarity Grouping","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIGNLAI/GDDSG","path":"GDDSG.py","file_url":"https://github.com/AIGNLAI/GDDSG/blob/HEAD/GDDSG.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, AIGNLAI/GDDSG when it was checked","code_sha256":"a567f058afa20de1","code_sha256_prefix":"a567f058afa20de1","mcp_get_code":{"code_sha256":"a567f058afa20de1"}},{"arxiv_id":"2410.00645","arxiv_id_is_arxiv":true,"paper":"/paper/icl-tsvd-bridging-theory-and-practice-in","title":"LoRanPAC: Low-rank Random Features and Pre-trained Models for Bridging Theory and Practice in Continual Learning","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangzu/loranpac","path":"models/ranpac.py","file_url":"https://github.com/liangzu/loranpac/blob/HEAD/models/ranpac.py","status":"ran","verification_level":1,"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, liangzu/loranpac when it was checked","code_sha256":"228be2f078530a4f","code_sha256_prefix":"228be2f078530a4f","mcp_get_code":{"code_sha256":"228be2f078530a4f"}},{"arxiv_id":"2404.00228","arxiv_id_is_arxiv":true,"paper":"/paper/inflora-interference-free-low-rank-adaptation","title":"InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learning","date":"2024-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangyanshuo/InfLoRA","path":"methods/inflora.py","file_url":"https://github.com/liangyanshuo/InfLoRA/blob/HEAD/methods/inflora.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":"222edc61eeca890a","code_sha256_prefix":"222edc61eeca890a","mcp_get_code":{"code_sha256":"222edc61eeca890a"}},{"arxiv_id":"2403.12030","arxiv_id_is_arxiv":true,"paper":"/paper/expandable-subspace-ensemble-for-pre-trained","title":"Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learning","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sun-hailong/cvpr24-ease","path":"models/ease.py","file_url":"https://github.com/sun-hailong/cvpr24-ease/blob/HEAD/models/ease.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, sun-hailong/cvpr24-ease when it was checked","code_sha256":"ac9d0a6d60dd702e","code_sha256_prefix":"ac9d0a6d60dd702e","mcp_get_code":{"code_sha256":"ac9d0a6d60dd702e"}},{"arxiv_id":"2403.08568","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-prompting-for-rehearsal-free","title":"Consistent Prompting for Rehearsal-Free Continual Learning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhanxin-Gao/CPrompt","path":"models/cprompt.py","file_url":"https://github.com/Zhanxin-Gao/CPrompt/blob/HEAD/models/cprompt.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, Zhanxin-Gao/CPrompt when it was checked","code_sha256":"9e1c37d27be7b6ce","code_sha256_prefix":"9e1c37d27be7b6ce","mcp_get_code":{"code_sha256":"9e1c37d27be7b6ce"}},{"arxiv_id":"2309.11222","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-few-shot-point-cloud-segmentation","title":"Generalized Few-Shot Point Cloud Segmentation Via Geometric Words","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pixie8888/GFS-3DSeg_GWs","path":"model/capl.py","file_url":"https://github.com/Pixie8888/GFS-3DSeg_GWs/blob/HEAD/model/capl.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":"3dfcae847caab91a","code_sha256_prefix":"3dfcae847caab91a","mcp_get_code":{"code_sha256":"3dfcae847caab91a"}},{"arxiv_id":"2308.13305","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-residual-classifier-for-class","title":"Dynamic Residual Classifier for Class Incremental Learning","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chen-xw/drc-cil","path":"models/mafdrc.py","file_url":"https://github.com/chen-xw/drc-cil/blob/HEAD/models/mafdrc.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, chen-xw/drc-cil when it was checked","code_sha256":"5dc4c08d1db9b246","code_sha256_prefix":"5dc4c08d1db9b246","mcp_get_code":{"code_sha256":"5dc4c08d1db9b246"}},{"arxiv_id":"2301.05792","arxiv_id_is_arxiv":true,"paper":"/paper/rmm-reinforced-memory-management-for-class-1","title":"RMM: Reinforced Memory Management for Class-Incremental Learning","date":"2023-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"g-u-n/pycil","path":"models/rmm.py","file_url":"https://github.com/g-u-n/pycil/blob/HEAD/models/rmm.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, g-u-n/pycil (NOASSERTION)","code_sha256":"8347652eeeb36202","code_sha256_prefix":"8347652eeeb36202","mcp_get_code":{"code_sha256":"8347652eeeb36202"}},{"arxiv_id":"2205.13218","arxiv_id_is_arxiv":true,"paper":"/paper/a-model-or-603-exemplars-towards-memory","title":"A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkiw/iclr23-memo","path":"models/memo.py","file_url":"https://github.com/wangkiw/iclr23-memo/blob/HEAD/models/memo.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, wangkiw/iclr23-memo when it was checked","code_sha256":"eae1b41c41d8cbe3","code_sha256_prefix":"eae1b41c41d8cbe3","mcp_get_code":{"code_sha256":"eae1b41c41d8cbe3"}},{"arxiv_id":"2204.04662","arxiv_id_is_arxiv":true,"paper":"/paper/foster-feature-boosting-and-compression-for","title":"FOSTER: Feature Boosting and Compression for Class-Incremental Learning","date":"2022-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"G-U-N/ECCV22-FOSTER","path":"models/foster.py","file_url":"https://github.com/G-U-N/ECCV22-FOSTER/blob/HEAD/models/foster.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":"1afda64d8a5c5708","code_sha256_prefix":"1afda64d8a5c5708","mcp_get_code":{"code_sha256":"1afda64d8a5c5708"}},{"arxiv_id":"2009.13000","arxiv_id_is_arxiv":true,"paper":"/paper/interventional-few-shot-learning","title":"Interventional Few-Shot Learning","date":"2020-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/ifsl","path":"MTL/models/IFSL.py","file_url":"https://github.com/yue-zhongqi/ifsl/blob/HEAD/MTL/models/IFSL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yue-zhongqi/ifsl when it was checked","code_sha256":"80d03250d680ce18","code_sha256_prefix":"80d03250d680ce18","mcp_get_code":{"code_sha256":"80d03250d680ce18"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learnables/learn2learn","path":"learn2learn/algorithms/maml.py","file_url":"https://github.com/learnables/learn2learn/blob/HEAD/learn2learn/algorithms/maml.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77bf690edcbd2974","code_sha256_prefix":"77bf690edcbd2974","mcp_get_code":{"code_sha256":"77bf690edcbd2974"}}],"record_sha256":"46cbddac9262e1211db0fdab47db3be0c0980f97c5e08bd43a26b0e33b2df917","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}