{"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/adapterlayer","entry":"AdapterLayer","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":5,"n_papers_ran":4,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2409.19872","paper":"/paper/towards-unified-multimodal-editing-with","title":"Towards Unified Multimodal Editing with Enhanced Knowledge Collaboration","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beepkh/unike","path":"easyeditor/models/unike/unike_main.py","file_url":"https://github.com/beepkh/unike/blob/HEAD/easyeditor/models/unike/unike_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"648995be6cb40f64","mcp_get_code":{"code_sha256":"648995be6cb40f64"}},{"arxiv_id":"2406.18060","paper":"/paper/adazeta-adaptive-zeroth-order-tensor-train","title":"AdaZeta: Adaptive Zeroth-Order Tensor-Train Adaption for Memory-Efficient Large Language Models Fine-Tuning","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanycc/adazeta","path":"large_models/loretta/tuners/loretta_adp.py","file_url":"https://github.com/yifanycc/adazeta/blob/HEAD/large_models/loretta/tuners/loretta_adp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"3bdbc3383c2ef5c7","mcp_get_code":{"code_sha256":"3bdbc3383c2ef5c7"}},{"arxiv_id":"2405.09719","paper":"/paper/spectral-editing-of-activations-for-large","title":"Spectral Editing of Activations for Large Language Model Alignment","date":"2024-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfqiu-nlp/sea-llm","path":"src/decoding_algorithm/inference.py","file_url":"https://github.com/yfqiu-nlp/sea-llm/blob/HEAD/src/decoding_algorithm/inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8da14c2ed8b18b3e","mcp_get_code":{"code_sha256":"8da14c2ed8b18b3e"}},{"arxiv_id":"2402.12656","paper":"/paper/hypermoe-towards-better-mixture-of-experts","title":"HyperMoE: Towards Better Mixture of Experts via Transferring Among Experts","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bumble666/Hyper_MoE","path":"gpt-2-moe/transformers/models/layers.py","file_url":"https://github.com/Bumble666/Hyper_MoE/blob/HEAD/gpt-2-moe/transformers/models/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7fa2bef8aa39823f","mcp_get_code":{"code_sha256":"7fa2bef8aa39823f"}},{"arxiv_id":"2402.02340","paper":"/paper/learning-semantic-proxies-from-visual-prompts","title":"Learning Semantic Proxies from Visual Prompts for Parameter-Efficient Fine-Tuning in Deep Metric Learning","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noahsark/parameterefficient-dml","path":"architectures/peft_vit.py","file_url":"https://github.com/noahsark/parameterefficient-dml/blob/HEAD/architectures/peft_vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4aa93defe46d50e4","mcp_get_code":{"code_sha256":"4aa93defe46d50e4"}}]}