aiqbench analysis
This study challenges the assumption that second-order Gauss-Newton methods universally outperform Adam by demonstrating their limitations under specific basis alignments and stochastic noise conditions. The findings suggest that first-order gradient statistics can offer genuine advantages over curvature-based preconditioning in non-convex settings like logistic regression, providing critical insights for optimizing deep learning training dynamics.
Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise
arXiv:2510.13680v2 Announce Type: replace Abstract: Preconditioned methods are central to deep learning optimization. Predominant approaches include computationally light diagonal preconditioners such as Adam, which rely on gradient statistics, and second-order methods such as Gauss-Newton (GN), which capture richer curvature information. Seeking the best of both worlds, we disentangle the preconditioner design space into several factors, separating the choice of diagonal scaling (Adam-style versus GN-style) from 1) the basis choices under which the diagonal scaling operates, and 2) the gradient noises from mini-batching. Our theoretical results show that GN's optimality for linear regression no longer holds under a poorly chosen basis under both population and stochastic updates, or a move from linear regression to a non-convex variant of logistic regression. In these settings, Adam-style methods offer genuine advantages over curvature-inspired preconditioning, rather than serving merely as a tractable proxy. Empirical results on synthetic problems and CIFAR-10 support these findings.
Title:Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise
Abstract:Preconditioned methods are central to deep learning optimization. Predominant approaches include computationally light diagonal preconditioners such as Adam, which rely on gradient statistics, and second-order methods such as Gauss-Newton (GN), which capture richer curvature information. Seeking the best of both worlds, we disentangle the preconditioner design space into several factors, separating the choice of diagonal scaling (Adam-style versus GN-style) from 1) the basis choices under which the diagonal scaling operates, and 2) the gradient noises from mini-batching. Our theoretical results show that GN's optimality for linear regression no longer holds under a poorly chosen basis under both population and stochastic updates, or a move from linear regression to a non-convex variant of logistic regression. In these settings, Adam-style methods offer genuine advantages over curvature-inspired preconditioning, rather than serving merely as a tractable proxy. Empirical results on synthetic problems and CIFAR-10 support these findings.
Machine Learning (cs.LG)
arXiv:2510.13680 [cs.LG]
(or arXiv:2510.13680v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2510.13680 Focus to learn more arXiv-issued DOI via DataCite
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 · 249 words
Related coverage
Links #5: 2026/07
LessWrong · Jul 31, 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026

Generalization and infinite width
LessWrong · Aug 1, 2026

Challenge: Hand coding weights for efficient sequence memorisation
AI Alignment Forum · Jul 23, 2026