aiqbench analysis
This study rigorously evaluates optimization techniques for language models under extreme resource constraints, revealing that most methods lose efficacy when applied to competitive baselines. The analysis isolates a small subset of robust strategies that consistently improve bits-per-byte performance regardless of the surrounding training stack. These findings offer critical insights into the limits of model compression and efficiency in high-performance computing environments.
Parameter Golf: What Really Works?
arXiv:2607.01517v2 Announce Type: replace Abstract: How far can a language model improve under a strict artifact budget? Parameter Golf posed this question as an open community challenge in which participants trained the best language model, with the complete artifact (training code + compressed weights) required to fit within 16 MB and to be trained in under ten minutes on 8xH100 SXM GPUs. Quality was measured in bits-per-byte (BPB), the average number of bits required to encode each byte of unseen text. We analyze 2,037 pull requests and 1,430 clean-scored submissions from the contest, build a taxonomy of 84 optimization techniques, and measure each technique's contribution to BPB. The verified leaderboard score dropped from 1.2244 to 1.058 BPB across three phases, a 13.6% reduction, despite individual techniques rarely improving BPB by more than 1%. We show that most techniques' gains shrink when re-measured among competitive submissions, isolating the few methods that help regardless of the surrounding stack. Code and data are available at https://github.com/PMP56/pmgolf-analysis.
Title:Parameter Golf: What Really Works?
Abstract:How far can a language model improve under a strict artifact budget? Parameter Golf posed this question as an open community challenge in which participants trained the best language model, with the complete artifact (training code + compressed weights) required to fit within 16 MB and to be trained in under ten minutes on 8xH100 SXM GPUs. Quality was measured in bits-per-byte (BPB), the average number of bits required to encode each byte of unseen text. We analyze 2,037 pull requests and 1,430 clean-scored submissions from the contest, build a taxonomy of 84 optimization techniques, and measure each technique's contribution to BPB. The verified leaderboard score dropped from 1.2244 to 1.058 BPB across three phases, a 13.6% reduction, despite individual techniques rarely improving BPB by more than 1%. We show that most techniques' gains shrink when re-measured among competitive submissions, isolating the few methods that help regardless of the surrounding stack. Code and data are available at this https URL.
Computation and Language (cs.CL)
arXiv:2607.01517 [cs.CL]
(or arXiv:2607.01517v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2607.01517 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 258 words
Related coverage

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026

AXRP Episode 50 - Eli Lifland on AI 2027
LessWrong · Aug 3, 2026

Presentation: From Consumers to Builders: Turning 200 of our Team into Agent Creators in Two Weeks
InfoQ · Sep 28, 2026

Presentation: From Copy-Paste to Composition: Building Agents Like Real Software
InfoQ · Jul 22, 2026