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
- NUS builds a soft force sensor that drives actuators without electronics or power — CurieuxExplorer · 2026-07-27
- Chelsea Finn says robot RL is bottlenecked by physical rollout cost, not algorithms — ycombinator · 2026-07-27
- ICML 2026 oral paper replication scores stay middling after a stricter re-scoring — profjamesevans · 2026-07-27
- Long-running agents will need immutable event logs, this thread argues — sebpaquet · 2026-07-27
- Seed IQ navigates Doom II, prompting questions about benchmarks beyond ARC-AGI — Fit_Transition8824 · 2026-07-27
- Agentic Data Science in Practice: Agents Write Code but Answer Wrong Questions — hugobowne · 2026-07-27