{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/load-weights-2","entry":"_load_weights","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":6,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2604.04420","paper":"/paper/arxiv-2604-04420","title":"Is Prompt Selection Necessary for Task-Free Online Continual Learning?","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"efficient-learning-lab/SinglePrompt","path":"models/singlePrompt.py","file_url":"https://github.com/efficient-learning-lab/SinglePrompt/blob/HEAD/models/singlePrompt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"323ef35022abc876","mcp_get_code":{"code_sha256":"323ef35022abc876"}},{"arxiv_id":"2602.17559","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,"code_sha256_prefix":"5630cc0b3ca7ec6e","mcp_get_code":{"code_sha256":"5630cc0b3ca7ec6e"}},{"arxiv_id":"2404.00228","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,"code_sha256_prefix":"1753ff7e1c2b9442","mcp_get_code":{"code_sha256":"1753ff7e1c2b9442"}},{"arxiv_id":"2403.08568","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,"code_sha256_prefix":"707bf605b2ea2de4","mcp_get_code":{"code_sha256":"707bf605b2ea2de4"}},{"arxiv_id":"2307.15324","paper":"/paper/taskexpert-dynamically-assembling-multi-task","title":"TaskExpert: Dynamically Assembling Multi-Task Representations with Memorial Mixture-of-Experts","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prismformore/multi-task-transformer","path":"TaskPrompter/models/transformers/taskprompter.py","file_url":"https://github.com/prismformore/multi-task-transformer/blob/HEAD/TaskPrompter/models/transformers/taskprompter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"930478a0420de5ff","mcp_get_code":{"code_sha256":"930478a0420de5ff"}},{"arxiv_id":"2204.07683","paper":"/paper/safe-self-refinement-for-transformer-based","title":"Safe Self-Refinement for Transformer-based Domain Adaptation","date":"2022-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/SSRT","path":"model/SSRT.py","file_url":"https://github.com/tsun/SSRT/blob/HEAD/model/SSRT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c95bc9517c87684","mcp_get_code":{"code_sha256":"3c95bc9517c87684"}}]}