Home › Code › move_to_cpu

move_to_cpu

Syntologyentry name in harvested coderead from the graph 2026-09-24

move_to_cpu appears in the code Syntology harvested for 10 papers, as 4 distinct code bodies found in 10 places (a place is one code body under one paper). At least one of them ran in 6 of the papers; 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named move_to_cpu do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 1 of the 4 distinct code bodies named move_to_cpu; 3 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
1ran
3unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 10 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

10 papers shown of 10, newest first; 10 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 3 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
When and Why SignSGD Outperforms SGD: A Theoretical Study Based on ℓ 1 -norm Lower Bounds added by Syntology 2026-05 (from id) epfml/llm-optimizer-benchmark/src/logger/logger.py 1bd86a911c3f78a3 ran Apache-2.0 (permissive)
Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise added by Syntology 7 Feb 2026 Dingzhen230/Heavy-tailed-Noise-in-LLMs/src/logger/logger.py 1bd86a911c3f78a3 ran no licence file found · pointer only
DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers added by Syntology 2026-02 (from id) IST-DASLab/DASH/src/logger/logger.py 1bd86a911c3f78a3 ran MIT (permissive)
arXiv:2507.09846 2025-07 (from id) epfml/llm-baselines/src/logger/logger.py 1bd86a911c3f78a3 ran MIT (permissive)
QuEST: Stable Training of LLMs with 1-Bit Weights and Activations 7 Feb 2025 IST-DASLab/QuEST/src/logger/logger.py 1bd86a911c3f78a3 ran MIT (permissive)
Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations 28 May 2024 epfml/schedules-and-scaling/src/logger/logger.py 1bd86a911c3f78a3 ran MIT (permissive)
FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System 20 Mar 2023 FedML-AI/FedML/python/fedml/utils/model_utils.py e80a141054e3bf40 unverified Apache-2.0 (permissive)
Meta Internal Learning 6 Oct 2021 RaphaelBensTAU/MetaInternalLearning/modules/utils.py 8b468ae6694fa405 unverified MIT (permissive)
FedML: A Research Library and Benchmark for Federated Machine Learning 27 Jul 2020 fedmlai/fedml/python/fedml/utils/model_utils.py e80a141054e3bf40 unverified Apache-2.0 (permissive)
Learning Sparse Prototypes for Text Generation 29 Jun 2020 jxhe/sparse-text-prototype/sparse_prototype/sp_criterion.py 31234bde077b0786 unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections