Loss Landscape Features That Make Adam Stall: Definitions, Estimators, and the Preconditioned Hessian View
Not on the map. Why?
Abstract (arXiv)
Across implicit-neural-representation (INR) architectures and analytic benchmarks we observe that a thoroughly tuned Adam (especially its learning rate (lr), e.g. in a hyperparameter sweep from lr = 0.05 to 10-8) can potentially reach a very low loss even on ill-conditioned loss landscape or converge at a plateau far above the loss attained by second-order methods. This report defines the measured metrics that help determine if Adam can mitigate the ill-conditioning on a given loss landscape. We provide the indicators by which each outcome is determined, that are: the condition number of the Hessian and of the Adam-preconditioned Hessian D-1/2HD-1/2 (with the derivation from Adam's update rule), the diagonal mass ρ that distinguishes axis-aligned from cross-coupled ill-conditioning, the negative spectral mass estimated by stochastic Lanczos quadrature, and the gradient energy fractions over curvature bands, including the flat fraction that indicates the Adam stall. A worked out 2× 2 example and an illustration show the reasons why a diagonal preconditioning by Adam can remove axis-aligned ill-conditioning by rescaling and why it cannot do the same if the ill-conditioning is cross coupled. In addition, we present a case study of FINER image fitting architecture that goes over the whole loss landscape analysis framework: the fitting architecture description, reasons due to which its landscape stalls Adam at saddles, the measured PSNR values through our tuned baselines to the 120--134,dB results of the blockwise second order methods, the error maps behind those numbers, and description of the benefits such image fitting accuracy gives in practice.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 23 Aug 2026.
Builds on
11 of 19 references.
References · 11
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2020Implicit Geometric Regularization for Learning Shapescited by 707
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 289
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2023WIRE: Wavelet Implicit Neural Representationscited by 220
- 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 179
- 2023FINER: Flexible spectral-bias tuning in Implicit NEural Representation by Variable-periodic Activation Functionscited by 77
Built on by
Citing papers per year: 2026: 1.
1 paper.