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...
Main Authors: | Sarao Mannelli, S, Biroli, G, Cammarota, C, Krzakala, F, Urbani, P, Zdeborová, L |
---|---|
Format: | Journal article |
Language: | English |
Published: |
American Physical Society
2020
|
Similar Items
-
Marvels and Pitfalls of the Langevin Algorithm in Noisy High-Dimensional Inference
by: Stefano Sarao Mannelli, et al.
Published: (2020-03-01) -
Thresholds of descending algorithms in inference problems
by: Sarao Mannelli, S, et al.
Published: (2020) -
The Noisy and Marvelous Molecular World of Biology
by: Felix Ritort
Published: (2019-04-01) -
Theoretical characterization of uncertainty in high-dimensional linear classification
by: Lucas Clarté, et al.
Published: (2023-01-01) -
Glassy Nature of the Hard Phase in Inference Problems
by: Fabrizio Antenucci, et al.
Published: (2019-01-01)