Marvels and pitfalls of the Langevin algorithm in noisy high-dimensional inference
Gradient-descent-based algorithms and their stochastic versions have widespread applications in machine learning and statistical inference. In this work, we carry out an analytic study of the performance of the algorithm most commonly considered in physics, the Langevin algorithm, in the context of...
Autors principals: | Sarao Mannelli, S, Biroli, G, Cammarota, C, Krzakala, F, Urbani, P, Zdeborová, L |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
American Physical Society
2020
|
Ítems similars
-
Marvels and Pitfalls of the Langevin Algorithm in Noisy High-Dimensional Inference
per: Stefano Sarao Mannelli, et al.
Publicat: (2020-03-01) -
Thresholds of descending algorithms in inference problems
per: Sarao Mannelli, S, et al.
Publicat: (2020) -
The Noisy and Marvelous Molecular World of Biology
per: Felix Ritort
Publicat: (2019-04-01) -
Theoretical characterization of uncertainty in high-dimensional linear classification
per: Lucas Clarté, et al.
Publicat: (2023-01-01) -
Glassy Nature of the Hard Phase in Inference Problems
per: Fabrizio Antenucci, et al.
Publicat: (2019-01-01)