aiqbench analysis
This paper provides a rigorous theoretical analysis of the Shampoo optimizer by unifying various divergence measures within a Bregman framework to address finite-sample errors in preconditioning. By validating these findings through GPT-2 pretraining experiments, the study offers principled guidance for improving neural network optimization algorithms beyond ad-hoc tuning.
How Bregman Divergences Shape Shampoo
arXiv:2610.08534v1 Announce Type: new Abstract: Understanding the principles behind Shampoo has recently guided the development of more effective neural network optimizers. These methods learn a preconditioner by optimizing the Frobenius or Kullback-Leibler (KL) divergence against the gradient second moment. In this work, we investigate how the choice of divergence shapes preconditioning, which remains unclear and blocks further improvements. To do so, we develop a unified Bregman divergence framework that connects all popular divergences, allowing us to study them jointly. Through empirical spectral analysis of gradient second moments, we examine how divergence choice shapes Kronecker approximation and interacts with finite-sample error in preconditioning. We find that some divergences can better compensate for finite-sample underestimation of the empirical second moment, helping explain the differing behavior of their corresponding Shampoo variants. We further validate this explanation through GPT-2 pretraining experiments. By connecting divergence choice to practical training behavior, we believe our framework provides principled guidance for understanding the foundations of, and further improving, Shampoo.
Abstract:Understanding the principles behind Shampoo has recently guided the development of more effective neural network optimizers. These methods learn a preconditioner by optimizing the Frobenius or Kullback-Leibler (KL) divergence against the gradient second moment. In this work, we investigate how the choice of divergence shapes preconditioning, which remains unclear and blocks further improvements. To do so, we develop a unified Bregman divergence framework that connects all popular divergences, allowing us to study them jointly. Through empirical spectral analysis of gradient second moments, we examine how divergence choice shapes Kronecker approximation and interacts with finite-sample error in preconditioning. We find that some divergences can better compensate for finite-sample underestimation of the empirical second moment, helping explain the differing behavior of their corresponding Shampoo variants. We further validate this explanation through GPT-2 pretraining experiments. By connecting divergence choice to practical training behavior, we believe our framework provides principled guidance for understanding the foundations of, and further improving, Shampoo.
Machine Learning (cs.LG)
arXiv:2610.08534 [cs.LG]
(or arXiv:2610.08534v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.08534 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 250 words
Related coverage
Rethinking Bregman Divergences in Kronecker-Factored Optimizers
arXiv · Jun 3, 2026
Optimizer Geometry Sets the Pace: Spectral Learning Dynamics in Matrix Factorization
arXiv · Oct 6, 2026
A General Framework for Decision Trees via Bregman Divergences
arXiv · Jun 15, 2026
Bias-variance decompositions: the exclusive privilege of Bregman divergences
arXiv · Sep 30, 2026