arXiv Analytics

Sign in

arXiv:1912.02143 [stat.ML]AbstractReferencesReviewsResources

Landscape Complexity for the Empirical Risk of Generalized Linear Models

Antoine Maillard, Gérard Ben Arous, Giulio Biroli

Published 2019-12-04Version 1

We present a method to obtain the average and the typical value of the number of critical points of the empirical risk landscape for generalized linear estimation problems and variants. This represents a substantial extension of previous applications of the Kac-Rice method since it allows to analyze the critical points of high dimensional non-Gaussian random functions. We obtain a rigorous explicit variational formula for the annealed complexity, which is the logarithm of the average number of critical points at fixed value of the empirical risk. This result is simplified, and extended, using the non-rigorous Kac-Rice replicated method from theoretical physics. In this way we find an explicit variational formula for the quenched complexity, which is generally different from its annealed counterpart, and allows to obtain the number of critical points for typical instances up to exponential accuracy.

Related articles: Most relevant | Search more
arXiv:1710.11205 [stat.ML] (Published 2017-10-30)
Critical Points of Neural Networks: Analytical Forms and Landscape Properties
arXiv:2410.08994 [stat.ML] (Published 2024-10-11)
Optimal Downsampling for Imbalanced Classification with Generalized Linear Models
arXiv:2407.13977 [stat.ML] (Published 2024-07-19)
A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits