mlsanityData to 14 Oct 2026

Loss-Parameterized Fisher Width Along Learning Trajectories

arXiv 2608.21561 ↗First posted 21 Aug 2026cs.LG math.ST stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

Fisher width measures the Gaussian width of a probe set after deformation by the local Fisher geometry. We study its evolution along learning trajectories and ask when training loss can serve as an effective coordinate for this quantity. We first derive an exact trace--shape factorization and a deterministic stability bound for fixed compact probes. In a population Gaussian-teacher logistic model, the teacher-aligned state is extremal on every loss level below log 2: it has minimal parameter norm and maximizes both Fisher trace and Euclidean-ball Fisher width. We then show that population gradient flow asymptotically selects this branch, with explicit rates for the aligned and orthogonal coordinates. This yields, for d≥2, [ fracwF(B2d;θ(t)) √L(θ(t)) longrightarrow frac√6πmathbb E[chid-1]. ] Controlled full-Fisher experiments support the matched-loss branch and the population predictions. In a nonlinear MLP with a diagonal model-Fisher approximation, GD and SGD remain close at matched loss, whereas Adam follows a substantially displaced branch; the fixed probes tested retain highly similar temporal shapes. These results support a branchwise, rather than universal, loss parametrization of Fisher width.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 21 Aug 2026.

Builds on

22 of 34 references.

References · 22

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  2. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  3. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  4. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
  5. 2018On Lazy Training in Differentiable Programmingcited by 675
  6. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
  7. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
  8. 2014New insights and perspectives on the natural gradient methodcited by 443
  9. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
  10. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  11. 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 266
  12. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
10 more
  1. 2020The large learning rate phase of deep learning: the catapult mechanismcited by 216
  2. 2013Revisiting Natural Gradient for Deep Networkscited by 159
  3. 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 142
  4. 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 141
  5. 2019Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setupcited by 112
  6. 2018Convergence of Gradient Descent on Separable Datacited by 110
  7. 2020Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalizationcited by 62
  8. 2019Pathological spectra of the Fisher information metric and its variants in deep neural networkscited by 32
  9. 2026Fisher Width: A Geometric Measure of Complexity on Statistical Manifoldscited by 2
  10. 2026Fisher Widths: Local Learning Geometry and Anisotropic Recoverycited by 1

Built on by

Not cited yet.