mlsanityData to 14 Oct 2026

Understanding SOAP from the Perspective of Gradient Whitening

arXiv 2509.22938 ↗First posted 26 Sep 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Shampoo with Adam in the Preconditioner's eigenbasis (SOAP) has recently emerged as a promising optimization algorithm for neural network training, achieving superior training efficiency over both Adam and Shampoo in language modeling tasks. In this work, we analyze Adam, Shampoo, and SOAP from the perspective of gradient whitening, interpreting their preconditioners as approximations to the whitening matrix, which captures second-order curvature information. We further establish a theoretical equivalence between idealized versions of SOAP and Shampoo under the Kronecker product assumption. To empirically evaluate these insights, we reproduce the language modeling experiments using nanoGPT and grayscale image colorization. Our results show that SOAP exhibits similar convergence rate as Shampoo, and no significant advantage over both Adam and Shampoo in the final loss achieved, which aligns with their equivalence in theory.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 26 Sep 2025.

Builds on

7 of 13 references.

References · 7

  1. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  2. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  3. 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 192
  4. 2023A Distributed Data-Parallel PyTorch Implementation of the Distributed Shampoo Optimizer for Training Neural Networks At-Scalecited by 77
  5. 2024A New Perspective on Shampoo's Preconditionercited by 59
  6. 2020A Deeper Look at the Hessian Eigenspectrum of Deep Neural Networks and its Applications to Regularizationcited by 44
  7. 2023ASDL: A Unified Interface for Gradient Preconditioning in PyTorchcited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.