{"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/move-to-cpu","entry":"move_to_cpu","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":10,"n_papers_ran":6,"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":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2605.06615","paper":"/paper/arxiv-2605-06615","title":"When and Why SignSGD Outperforms SGD: A Theoretical Study Based on ℓ 1 -norm Lower Bounds","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"epfml/llm-optimizer-benchmark","path":"src/logger/logger.py","file_url":"https://github.com/epfml/llm-optimizer-benchmark/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2602.07425","paper":"/paper/arxiv-2602-07425","title":"Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise","date":"2026-02-07","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"Dingzhen230/Heavy-tailed-Noise-in-LLMs","path":"src/logger/logger.py","file_url":"https://github.com/Dingzhen230/Heavy-tailed-Noise-in-LLMs/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2602.02016","paper":"/paper/arxiv-2602-02016","title":"DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"IST-DASLab/DASH","path":"src/logger/logger.py","file_url":"https://github.com/IST-DASLab/DASH/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2507.09846","paper":null,"title":"arXiv:2507.09846","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"epfml/llm-baselines","path":"src/logger/logger.py","file_url":"https://github.com/epfml/llm-baselines/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2502.05003","paper":"/paper/quest-stable-training-of-llms-with-1-bit","title":"QuEST: Stable Training of LLMs with 1-Bit Weights and Activations","date":"2025-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IST-DASLab/QuEST","path":"src/logger/logger.py","file_url":"https://github.com/IST-DASLab/QuEST/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2405.18392","paper":"/paper/scaling-laws-and-compute-optimal-training","title":"Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/schedules-and-scaling","path":"src/logger/logger.py","file_url":"https://github.com/epfml/schedules-and-scaling/blob/HEAD/src/logger/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bd86a911c3f78a3","mcp_get_code":{"code_sha256":"1bd86a911c3f78a3"}},{"arxiv_id":"2303.10837","paper":"/paper/fedml-he-an-efficient-homomorphic-encryption","title":"FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FedML-AI/FedML","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/FedML-AI/FedML/blob/HEAD/python/fedml/utils/model_utils.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":"e80a141054e3bf40","mcp_get_code":{"code_sha256":"e80a141054e3bf40"}},{"arxiv_id":"2110.02900","paper":"/paper/meta-internal-learning","title":"Meta Internal Learning","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RaphaelBensTAU/MetaInternalLearning","path":"modules/utils.py","file_url":"https://github.com/RaphaelBensTAU/MetaInternalLearning/blob/HEAD/modules/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b468ae6694fa405","mcp_get_code":{"code_sha256":"8b468ae6694fa405"}},{"arxiv_id":"2007.13518","paper":"/paper/fedml-a-research-library-and-benchmark-for","title":"FedML: A Research Library and Benchmark for Federated Machine Learning","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fedmlai/fedml","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/fedmlai/fedml/blob/HEAD/python/fedml/utils/model_utils.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":"e80a141054e3bf40","mcp_get_code":{"code_sha256":"e80a141054e3bf40"}},{"arxiv_id":"2006.16336","paper":"/paper/learning-sparse-prototypes-for-text","title":"Learning Sparse Prototypes for Text Generation","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/sparse-text-prototype","path":"sparse_prototype/sp_criterion.py","file_url":"https://github.com/jxhe/sparse-text-prototype/blob/HEAD/sparse_prototype/sp_criterion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31234bde077b0786","mcp_get_code":{"code_sha256":"31234bde077b0786"}}]}