{"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/print-trainable-parameters","entry":"print_trainable_parameters","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":9,"n_papers_ran":3,"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":7,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":5},"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":"2510.11168","paper":"/paper/arxiv-2510-11168","title":"ELMO : Efficiency via Low-precision and Peak Memory Optimization in Large Output Spaces","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"xmc-aalto/elmo","path":"src/utils.py","file_url":"https://github.com/xmc-aalto/elmo/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63eb98e4f891edda","mcp_get_code":{"code_sha256":"63eb98e4f891edda"}},{"arxiv_id":"2502.21074","paper":"/paper/codi-compressing-chain-of-thought-into","title":"CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillation","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenyi4/codi","path":"src/model.py","file_url":"https://github.com/zhenyi4/codi/blob/HEAD/src/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e2d7d1a29b68d084","mcp_get_code":{"code_sha256":"e2d7d1a29b68d084"}},{"arxiv_id":"2502.13533","paper":"/paper/train-small-infer-large-memory-efficient-lora","title":"Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language Models","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junzhang-zj/LoRAM","path":"loram/2_pruned_low_rank_matrix_training.py","file_url":"https://github.com/junzhang-zj/LoRAM/blob/HEAD/loram/2_pruned_low_rank_matrix_training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"55ec6efd6c53c278","mcp_get_code":{"code_sha256":"55ec6efd6c53c278"}},{"arxiv_id":"2411.03171","paper":"/paper/navigating-extremes-dynamic-sparsity-in-large","title":"Navigating Extremes: Dynamic Sparsity in Large Output Space","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xmc-aalto/NeurIPS24-dst","path":"src/utils.py","file_url":"https://github.com/xmc-aalto/NeurIPS24-dst/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63eb98e4f891edda","mcp_get_code":{"code_sha256":"63eb98e4f891edda"}},{"arxiv_id":"2406.18187","paper":"/paper/selective-prompting-tuning-for-personalized","title":"Selective Prompting Tuning for Personalized Conversations with LLMs","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqsiswiliam/SPT","path":"utils/model_helpers.py","file_url":"https://github.com/hqsiswiliam/SPT/blob/HEAD/utils/model_helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"062f390233bf4d6d","mcp_get_code":{"code_sha256":"062f390233bf4d6d"}},{"arxiv_id":"2403.13592","paper":"/paper/llama-meets-eu-investigating-the-european","title":"Llama meets EU: Investigating the European Political Spectrum through the Lens of LLMs","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coastalcph/eu-politics-llms","path":"finetune_llms/finetune_llms.py","file_url":"https://github.com/coastalcph/eu-politics-llms/blob/HEAD/finetune_llms/finetune_llms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a97c88f3a8082897","mcp_get_code":{"code_sha256":"a97c88f3a8082897"}},{"arxiv_id":"2401.00788","paper":"/paper/astraios-parameter-efficient-instruction","title":"Astraios: Parameter-Efficient Instruction Tuning Code Large Language Models","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/astraios","path":"training/finetune.py","file_url":"https://github.com/bigcode-project/astraios/blob/HEAD/training/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a97c88f3a8082897","mcp_get_code":{"code_sha256":"a97c88f3a8082897"}},{"arxiv_id":"2310.04948","paper":"/paper/tempo-prompt-based-generative-pre-trained","title":"TEMPO: Prompt-based Generative Pre-trained Transformer for Time Series Forecasting","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dc-research/tempo","path":"tempo/models/TEMPO.py","file_url":"https://github.com/dc-research/tempo/blob/HEAD/tempo/models/TEMPO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dde2d9d566d3b650","mcp_get_code":{"code_sha256":"dde2d9d566d3b650"}},{"arxiv_id":"2106.09685","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":"ikergarcia1996/sequence-labeling-llms","path":"seq2seq.py","file_url":"https://github.com/ikergarcia1996/sequence-labeling-llms/blob/HEAD/seq2seq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"14548ec0148ab8ec","mcp_get_code":{"code_sha256":"14548ec0148ab8ec"}}]}