Understanding the Subspace Stabilization of the Hessian and Gradient Covariance Matrix
Not on the map. Why?
Abstract (arXiv)
The phenomenon of the top subspace stabilization of the Hessian matrix is an surprising and critical aspect in study of the second-order information of neural network training. Prior work argues that the top subspace of the Hessian stabilizes by measuring the overlap between the top subspaces of the step-wise Hessian, and explains this stabilization with diminishing parameter change in the late phase of training. In this paper, we define a new instability metric for the subspace evolution, and use it to detect subspace stabilization that is independent of the magnitude of parameter change. In the meantime, we observe that the gradient covariance matrix has a similar property of its top subspace to the Hessian. By using a between-class and within-class decomposition of the gradient covariance matrix, we identify an explicit form that gives a near-perfect approximation of the top-(C-1) subspace of the Hessian and the gradient covariance matrix. In the gradient flow set-up, we show that the slow evolution of the idenfied approximation is due to the separation between the outlier and the bulk eigenvalues of the Hessian matrix, thus providing an explanation to the phenomenon of the top subspace stabilization of the Hessian matrix.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 23 references that are in the map. First posted on arXiv 25 Sep 2026.
Builds on
20 of 23 references.
References · 20
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 227
- 2018Gradient Descent Happens in a Tiny Subspacecited by 217
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
- 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 159
- 2020Traces of Class/Cross-Class Structure Pervade Deep Learning Spectracited by 94
- 2019Measurements of Three-Level Hierarchical Structure in the Outliers in the Spectrum of Deepnet Hessianscited by 68
8 more
- 2024Does SGD really happen in tiny subspaces?cited by 36
- 2025The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Trainingcited by 33
- 2024From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applicationscited by 25
- 2025Scaling Collapse Reveals Universal Dynamics in Compute-Optimally Trained Neural Networkscited by 22
- 2019Truth or Backpropaganda? An Empirical Investigation of Deep Learning Theorycited by 21
- 2016Local minima in training of neural networkscited by 19
- 2026A Defense of the Quadratic Modelcited by 14
- 2023Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networkscited by 1
Built on by
Not cited yet.