Black Box Lie Group Preconditioners for SGD
Not on the map. Why?
Abstract (arXiv)
A matrix free and a low rank approximation preconditioner are proposed to accelerate the convergence of stochastic gradient descent (SGD) by exploiting curvature information sampled from Hessian-vector products or finite differences of parameters and gradients similar to the BFGS algorithm. Both preconditioners are fitted with an online updating manner minimizing a criterion that is free of line search and robust to stochastic gradient noise, and further constrained to be on certain connected Lie groups to preserve their corresponding symmetry or invariance, e.g., orientation of coordinates by the connected general linear group with positive determinants. The Lie group's equivariance property facilitates preconditioner fitting, and its invariance property saves any need of damping, which is common in second-order optimizers, but difficult to tune. The learning rate for parameter updating and step size for preconditioner fitting are naturally normalized, and their default values work well in most situations.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 10 of its 12 references that are in the map. First posted on arXiv 8 Nov 2022.
Builds on
10 of 12 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2021Convex optimizationcited by 2,479
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2015Preconditioned Stochastic Gradient Descentcited by 48
- 2015Equilibrated adaptive learning rates for non-convex optimizationcited by 42
- 2020Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Mapscited by 36
- 2018Preconditioner on Matrix Lie Group for SGDcited by 15
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 2; 2026: 2.
8 papers.
- 2025Muon is Scalable for LLM Trainingcited by 381
- 2025Muon Optimizes Under Spectral Norm Constraintscited by 77
- 2026RMNP: Row-Momentum Normalized Preconditioning for Scalable Matrix-Based Optimizationcited by 11
- 2023Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFACcited by 9
- 2026TEON: Tensorized Orthonormalization Beyond Layer-Wise Muon for Large Language Model Pre-Trainingcited by 5
- 2024Stochastic Hessian Fittings with Lie Groupscited by 4
- 2022Improving Levenberg-Marquardt Algorithm for Neural Networkscited by 2
- 2024PureEBM: Universal Poison Purification via Mid-Run Dynamics of Energy-Based Modelscited by 0
- 2026RMNP: Row-Momentum Normalized Preconditioning for Scalable Matrix-Based Optimization20 Mar 2026
- 2026TEON: Tensorized Orthonormalization Beyond Layer-Wise Muon for Large Language Model Pre-Training30 Jan 2026
- 2025Muon Optimizes Under Spectral Norm Constraints18 Jun 2025
- 2025Muon is Scalable for LLM Training24 Feb 2025
- 2024PureEBM: Universal Poison Purification via Mid-Run Dynamics of Energy-Based Models28 May 2024
- 2024Stochastic Hessian Fittings with Lie Groups19 Feb 2024
- 2023Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC9 Dec 2023
- 2022Improving Levenberg-Marquardt Algorithm for Neural Networks17 Dec 2022