Google researchers fix two numerical bugs in softmax and cross-entropy, eliminating 'Slingshot'

ZeYanjie · x · 2026-10-24

Jonathan Barron and colleagues (Google) publish an arXiv paper identifying two numerical bugs in standard softmax/log-softmax/cross-entropy implementations:

Their simple fixed implementations eliminate the previously-observed "Slingshot" phenomenon, speed up grokking with weight decay, prevent accuracy collapse without it, stop students drifting from teachers in distillation, and show post-memorization logit growth is bounded by an equilibrium between weight decay and Adam's epsilon.

Related event: Google researcher says all softmax and cross-entropy implementations have two numerical bugs(6 posts)→

Original post →

More from Research

Research channel →