Papers › Accelerating Neural Network Training: An Analysis of the AlgoPerf Competition

Accelerating Neural Network Training: An Analysis of the AlgoPerf Competition

20 Feb 2025arXiv:2502.15015archive 2025-07-28

Priya Kasimbeg, Frank Schneider, Runa Eschenhagen, Juhan Bae, Chandramouli Shama Sastry, Mark Saroufim, Boyuan Feng, Less Wright, Edward Z. Yang, Zachary Nado, Sourabh Medapati, Philipp Hennig, Michael Rabbat, George E. Dahl

The goal of the AlgoPerf: Training Algorithms competition is to evaluate practical speed-ups in neural network training achieved solely by improving the underlying training algorithms. In the external tuning ruleset, submissions must provide workload-agnostic hyperparameter search spaces, while in the self-tuning ruleset they must be completely hyperparameter-free. In both rulesets, submissions are compared on time-to-result across multiple deep learning workloads, training on fixed hardware. This paper presents the inaugural AlgoPerf competition's results, which drew 18 diverse submissions from 10 teams. Our investigation reveals several key findings: (1) The winning submission in the external tuning ruleset, using Distributed Shampoo, demonstrates the effectiveness of non-diagonal preconditioning over popular methods like Adam, even when compared on wall-clock runtime. (2) The winning submission in the self-tuning ruleset, based on the Schedule Free AdamW algorithm, demonstrates a new level of effectiveness for completely hyperparameter-free training algorithms. (3) The top-scoring submissions were surprisingly robust to workload changes. We also discuss the engineering challenges encountered in ensuring a fair comparison between different training algorithms. These results highlight both the significant progress so far, and the considerable room for further improvements.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2502.15015")

Code

Syntology Ran 0 of 19 code samples harvested from 2 repositories linked to this paper; 19 have no recorded run.

By repository: community (archive-listed): 19 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

19 samples harvested; 0 ran; 0 honoured the contract we drafted; 19 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

19unverified

Licence: 0 of the 19 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “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.

Each sample ends with its 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.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at 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 label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

PRNGKey mlcommons/algorithmic-efficiency/algoperf/random_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 3cb5b30e82603e79 · report
compute_ylimits mlcommons/submissions_algorithms/artifacts/tech_report_v1/appendix_training_curves/curve_plotting/plot_curves.py community (archive-listed) unverified Apache-2.0 (permissive) · 1900be230edc52a1 · report
discrete mlcommons/algorithmic-efficiency/algoperf/halton.py community (archive-listed) unverified Apache-2.0 (permissive) · 6dbd6fb3beedb802 · report
find_workloads mlcommons/submissions_algorithms/artifacts/tech_report_v1/section_4_leaderboards/training_curves/plot_helper.py community (archive-listed) unverified Apache-2.0 (permissive) · 4c18823d56662cde · report
fold_in mlcommons/algorithmic-efficiency/algoperf/random_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 6a6d21d04570b761 · report
generate_primes mlcommons/algorithmic-efficiency/algoperf/halton.py community (archive-listed) unverified Apache-2.0 (permissive) · f43e4fb74b7c594d · report
generate_sequence mlcommons/algorithmic-efficiency/algoperf/halton.py community (archive-listed) unverified Apache-2.0 (permissive) · 51e1565dce1f6500 · report
get_target_metric_and_value mlcommons/submissions_algorithms/artifacts/tech_report_v1/section_4_leaderboards/training_curves/plot_helper.py community (archive-listed) unverified Apache-2.0 (permissive) · c5d442c0612ee65b · report
interpolate_trials mlcommons/submissions_algorithms/artifacts/tech_report_v1/appendix_training_curves/curve_plotting/plot_curves.py community (archive-listed) unverified Apache-2.0 (permissive) · 1c18c1b899014486 · report
is_higher_better mlcommons/submissions_algorithms/artifacts/tech_report_v1/appendix_training_curves/curve_plotting/plot_config.py community (archive-listed) unverified Apache-2.0 (permissive) · ca0283eb8398aecb · report
load_workload_data mlcommons/submissions_algorithms/artifacts/tech_report_v1/section_4_leaderboards/training_curves/plot_helper.py community (archive-listed) unverified Apache-2.0 (permissive) · 6c008654e95b670d · report
pad mlcommons/algorithmic-efficiency/algoperf/data_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · a70fb7b96ab81006 · report
recolored mlcommons/submissions_algorithms/artifacts/tech_report_v1/appendix_training_curves/curve_plotting/plot_curves.py community (archive-listed) unverified Apache-2.0 (permissive) · 3b645572c0590248 · report
replicate mlcommons/algorithmic-efficiency/algoperf/jax_sharding_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · ec540686300a802b · report
replicate_checkpoint mlcommons/algorithmic-efficiency/algoperf/checkpoint_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 465fcdd73eea3a51 · report
shard mlcommons/algorithmic-efficiency/algoperf/data_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 26b40ee442cadc0e · report
shard_along_batch_dim mlcommons/algorithmic-efficiency/algoperf/jax_sharding_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · ff8c61af026bc891 · report
split mlcommons/algorithmic-efficiency/algoperf/random_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 41945920f8ae7923 · report
sync_ddp_time mlcommons/algorithmic-efficiency/algoperf/pytorch_utils.py community (archive-listed) unverified Apache-2.0 (permissive) · 8cf27cb29ed879ec · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdamAdamWDistributed Shampoo

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