{"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/mark-only-lora-as-trainable","entry":"mark_only_lora_as_trainable","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":11,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":11,"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":0,"unverified":10},"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.01526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01526","title":"Scalable Multi-Task Low-Rank Model Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"doem97/ICLR26_mtLoRA","path":"peft/tuners/mmoelora.py","file_url":"https://github.com/doem97/ICLR26_mtLoRA/blob/HEAD/peft/tuners/mmoelora.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, doem97/ICLR26_mtLoRA when it was checked","code_sha256":"0e7c780ef1f1ff8b","code_sha256_prefix":"0e7c780ef1f1ff8b","mcp_get_code":{"code_sha256":"0e7c780ef1f1ff8b"}},{"arxiv_id":"2601.12493","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-12493","title":"Histopath-C: Towards Realistic Domain Shifts for Histopathology Vision-Language Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Mehrdad-Noori/Histopath-C","path":"adapt/latte.py","file_url":"https://github.com/Mehrdad-Noori/Histopath-C/blob/HEAD/adapt/latte.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":"9d0925bfce78e31f","code_sha256_prefix":"9d0925bfce78e31f","mcp_get_code":{"code_sha256":"9d0925bfce78e31f"}},{"arxiv_id":"2509.25684","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25684","title":"LD-MoLE: Learnable Dynamic Routing for Mixture of LoRA Experts","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"eshentw/LD-MoLE","path":"peft/tuners/lora.py","file_url":"https://github.com/eshentw/LD-MoLE/blob/HEAD/peft/tuners/lora.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, eshentw/LD-MoLE when it was checked","code_sha256":"3fffcf699be25f67","code_sha256_prefix":"3fffcf699be25f67","mcp_get_code":{"code_sha256":"3fffcf699be25f67"}},{"arxiv_id":"2505.23808","arxiv_id_is_arxiv":true,"paper":"/paper/denselora-dense-low-rank-adaptation-of-large","title":"DenseLoRA: Dense Low-Rank Adaptation of Large Language Models","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mulin-ahu/DenseLoRA","path":"commonsense_reasoning/peft/src/peft/tuners/dora.py","file_url":"https://github.com/mulin-ahu/DenseLoRA/blob/HEAD/commonsense_reasoning/peft/src/peft/tuners/dora.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, mulin-ahu/DenseLoRA (NOASSERTION)","code_sha256":"62fbfee1f7ede251","code_sha256_prefix":"62fbfee1f7ede251","mcp_get_code":{"code_sha256":"62fbfee1f7ede251"}},{"arxiv_id":"2503.12897","arxiv_id_is_arxiv":true,"paper":"/paper/federated-continual-instruction-tuning","title":"Federated Continual Instruction Tuning","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ghy0501/FCIT","path":"CoIN/peft/tuners/coinmoelora.py","file_url":"https://github.com/Ghy0501/FCIT/blob/HEAD/CoIN/peft/tuners/coinmoelora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10b3009f403262c7","code_sha256_prefix":"10b3009f403262c7","mcp_get_code":{"code_sha256":"10b3009f403262c7"}},{"arxiv_id":"2503.01303","arxiv_id_is_arxiv":true,"paper":"/paper/proper-a-progressive-learning-framework-for","title":"PROPER: A Progressive Learning Framework for Personalized Large Language Models with Group-Level Adaptation","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"callanwu/PROPER","path":"peft/tuners/lora.py","file_url":"https://github.com/callanwu/PROPER/blob/HEAD/peft/tuners/lora.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, callanwu/PROPER when it was checked","code_sha256":"5577351867d44f9b","code_sha256_prefix":"5577351867d44f9b","mcp_get_code":{"code_sha256":"5577351867d44f9b"}},{"arxiv_id":"2408.10159","arxiv_id_is_arxiv":true,"paper":"/paper/customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akalikong/ilora","path":"model/peft/tuners/moelora.py","file_url":"https://github.com/akalikong/ilora/blob/HEAD/model/peft/tuners/moelora.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, akalikong/ilora when it was checked","code_sha256":"3ab2cfc21d501f78","code_sha256_prefix":"3ab2cfc21d501f78","mcp_get_code":{"code_sha256":"3ab2cfc21d501f78"}},{"arxiv_id":"2407.02013","arxiv_id_is_arxiv":true,"paper":"/paper/digraf-diffeomorphic-graph-adaptive","title":"DiGRAF: Diffeomorphic Graph-Adaptive Activation Function","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipsitmantri/DiTASK","path":"models/lora.py","file_url":"https://github.com/ipsitmantri/DiTASK/blob/HEAD/models/lora.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":"f3788eeccc68b1f0","code_sha256_prefix":"f3788eeccc68b1f0","mcp_get_code":{"code_sha256":"f3788eeccc68b1f0"}},{"arxiv_id":"2403.20320","arxiv_id_is_arxiv":true,"paper":"/paper/mtlora-a-low-rank-adaptation-approach-for","title":"MTLoRA: A Low-Rank Adaptation Approach for Efficient Multi-Task Learning","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scale-lab/mtlora","path":"models/lora.py","file_url":"https://github.com/scale-lab/mtlora/blob/HEAD/models/lora.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":"f3788eeccc68b1f0","code_sha256_prefix":"f3788eeccc68b1f0","mcp_get_code":{"code_sha256":"f3788eeccc68b1f0"}},{"arxiv_id":"2402.13717","arxiv_id_is_arxiv":true,"paper":"/paper/neeko-leveraging-dynamic-lora-for-efficient","title":"Neeko: Leveraging Dynamic LoRA for Efficient Multi-Character Role-Playing Agent","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiyifan1023/neeko","path":"moelora/tuners/moelora.py","file_url":"https://github.com/weiyifan1023/neeko/blob/HEAD/moelora/tuners/moelora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"929ad987e7c47453","code_sha256_prefix":"929ad987e7c47453","mcp_get_code":{"code_sha256":"929ad987e7c47453"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phoebussi/alpaca-cot","path":"peft/src/peft/tuners/lora.py","file_url":"https://github.com/phoebussi/alpaca-cot/blob/HEAD/peft/src/peft/tuners/lora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84f4e84719d66f4c","code_sha256_prefix":"84f4e84719d66f4c","mcp_get_code":{"code_sha256":"84f4e84719d66f4c"}}],"record_sha256":"fc8f513030d48edc1408d6e50a54aca95456a43b2f91cb47e5431045155d834e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}