Trinomial Scaling Law Jointly Derives Optimal Batch Size
orvieto_antonio · x · 2026-07-04
Addressing the compute allocation trade-off between more steps and larger batches, the author proposes a trinomial loss law L(N,M,K)= E + A·N⁻ᵅ + B·M⁻ᵝ + C·K⁻ᵞ, where M is the token-based batch size and K is the number of training steps. Unlike previous approaches that fit batch-size laws separately, the batch size here directly factors into the loss law, allowing optimal and critical batch sizes to be derived rather than fitted independently. Since D=MK (total tokens), the law predicts an optimal batch size M ∝ D^(γ/(β+γ)). A link to the paper is included.
More from Research
- Fast ViT shows strong ImageNet results; scaling runs needed next — ducha_aiki · 2026-09-11
- Loss Functions Are Scientific Assumptions: MSE Implies Gaussian Noise, Cross-Entropy Implies Bernoulli — bravo_abad · 2026-09-11
- SymKit MCP: 44 tools for AI agents to verify symbolic derivations — Foreign-Specific-604 · 2026-09-11
- Researchers: LLMs under pressure invent new languages unreadable to humans — mikeflache · 2026-09-11
- Mi-Ripple fixes ripple artifacts left by iterative AI image editing — Miyang-AI · 2026-09-11
- DRG-MAPPO uses dynamic role graphs to boost multi-agent air combat win rates — China666 · 2026-09-11