A Stable Whitening Optimizer for Efficient Neural Network Training

Kevin Frans, Sergey Levine, Pieter Abbeel
6/8/2025
cs.LG

No confident code implementation found for this paper.

Abstract

In this work, we take an experimentally grounded look at neural network optimization. Building on the Shampoo family of algorithms, we identify and alleviate three key issues, resulting in the proposed SPlus method. First, we find that naive Shampoo is prone to divergence when matrix-inverses are cached for long periods. We introduce an alternate bounded update combining a historical eigenbasis with instantaneous normalization, resulting in across-the-board stability and significantly lower computational requirements. Second, we adapt a shape-aware scaling to enable learning rate transfer across network width. Third, we find that high learning rates result in large parameter noise, and propose a simple iterate-averaging scheme which unblocks faster learning. To properly confirm these findings, we introduce a pointed Transformer training benchmark, considering three objectives (language modelling, image classification, and diffusion modelling) across different stages of training. On average, SPlus is able to reach the validation performance of Adam within 44-58% of the gradient steps and 62-83% of the wallclock time.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{frans2025stable,
  title  = {A Stable Whitening Optimizer for Efficient Neural Network Training},
  author = {Kevin Frans and Sergey Levine and Pieter Abbeel},
  year   = {2025},
  eprint = {2506.07254},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.07254v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.07254.svg)](https://codeofpaper.com/paper/2506.07254)

Discussion