mlsanityData to 7 Oct 2026

Topological Exploration of High-Dimensional Empirical Risk Landscapes: general approach, and applications to phase retrieval

arXiv 2602.17779 ↗First posted 19 Feb 2026stat.ML cond-mat.dis-nn cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider the landscape of empirical risk minimization for high-dimensional Gaussian single-index models (generalized linear models). The objective is to recover an unknown signal boldsymbolθ^star ∈ ℝd (where d gg 1) from a loss function hatR(boldsymbolθ) that depends on pairs of labels (xi · boldsymbolθ, xi · boldsymbolθ^star)i=1n, with xi ~ N(0, Id), in the proportional asymptotic regime n asymp d. Using the Kac-Rice formula, we analyze different complexities of the landscape -- defined as the expected number of critical points -- corresponding to various types of critical points, including local minima. We first show that some variational formulas previously established in the literature for these complexities can be drastically simplified, reducing to explicit variational problems over a finite number of scalar parameters that we can efficiently solve numerically. Our framework also provides detailed predictions for properties of the critical points, including the spectral properties of the Hessian and the joint distribution of labels. We apply our analysis to the real phase retrieval problem for which we derive complete topological phase diagrams of the loss landscape, characterizing notably BBP-type transitions where the Hessian at local minima (as predicted by the Kac-Rice formula) becomes unstable in the direction of the signal. We test the predictive power of our analysis to characterize gradient flow dynamics, finding excellent agreement with finite-size simulations of local optimization algorithms, and capturing fine-grained details such as the empirical distribution of labels. Overall, our results open new avenues for the asymptotic study of loss landscapes and topological trivialization phenomena in high-dimensional statistical models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 53 references that are in the map. First posted on arXiv 19 Feb 2026.

Builds on

27 of 53 references.

References · 27

  1. 2017Exploring Generalization in Deep Learningcited by 595
  2. 2018To understand deep learning we need to understand kernel learningcited by 186
  3. 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
  4. 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 69
  5. 2023On Learning Gaussian Multi-index Models with Gradient Flowcited by 53
  6. 2020Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functionscited by 50
  7. 2019Bad Global Minima Exist and SGD Can Reach Themcited by 49
  8. 2024Neural network learns low-dimensional polynomials with SGD near the information-theoretic limitcited by 45
  9. 2018Comparing Dynamics: Deep Neural Networks versus Glassy Systemscited by 42
  10. 2017The landscape of the spiked tensor modelcited by 34
  11. 2016No bad local minima: Data independent training error guarantees for multilayer neural networkscited by 29
  12. 2019Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Modelscited by 28
15 more
  1. 2019Who is Afraid of Big Bad Minima? Analysis of Gradient-Flow in a Spiked Matrix-Tensor Modelcited by 25
  2. 2023Hitting the High-Dimensional Notes: An ODE for SGD learning dynamics on GLMs and multi-index modelscited by 25
  3. 2018Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inferencecited by 24
  4. 2018Complex energy landscapes in spiked-tensor and simple glassy models: ruggedness, arrangements of local minima and phase transitionscited by 23
  5. 2017On the Optimization Landscape of Tensor Decompositionscited by 21
  6. 2023On the Impact of Overparameterization on the Training of a Shallow Neural Network in High Dimensionscited by 21
  7. 2020Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrievalcited by 18
  8. 2019Landscape Complexity for the Empirical Risk of Generalized Linear Modelscited by 15
  9. 2023Escaping mediocrity: how two-layer networks learn hard generalized linear models with SGDcited by 14
  10. 2021Solving phase retrieval with random initial guess is nearly as good as by spectral initializationcited by 9
  11. 2023The star-shaped space of solutions of the spherical negative perceptroncited by 8
  12. 2024The Role of the Time-Dependent Hessian in High-Dimensional Optimizationcited by 7
  13. 2026Phase Transitions for Feature Learning in Neural Networkscited by 6
  14. 2025Local minima of the empirical risk in high dimension: General theorems and convex examplescited by 4
  15. 2025Landscape Complexity for the Empirical Risk of Generalized Linear Models: Discrimination between Structured Datacited by 1

Built on by

Not cited yet.