Google researchers find two numerical bugs in softmax/cross-entropy, fixing Slingshot and grokking issues

jon_barron · x · 2026-10-24

Google's Jonathan T. Barron and co-authors published an arXiv paper, "A Fix for Softmax and Cross-Entropy," identifying two numerical bugs in standard implementations of softmax, log-softmax, and cross-entropy:

The paper presents simple fixed implementations whose effects include: eliminating the previously observed "Slingshot" phenomenon, speeding up grokking with weight decay, preventing accuracy collapse without weight decay, stopping student networks from drifting away from the teacher during distillation, and showing that post-memorization logit growth is bounded by an equilibrium between weight decay and Adam's ε hyperparameter.

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

Original post →

More from Research

Research channel →