777 citations · 8.1k across the 109 of their papers we have counts for
9 papers · 1 filter
Rank-one matrix estimation: analysis of algorithmic and information theoretic limits by the spatial coupling method
Jean Barbier, Mohamad Dia, Nicolas Macris +2
Factorizing low-rank matrices is a problem with many applications in machine learning and statistics, ranging from sparse PCA to community detection and sub-matrix localization. Fo…
Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inference
Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota +3
Gradient-descent-based algorithms and their stochastic versions have widespread applications in machine learning and statistical inference. In this work we perform an analytic stud…
Approximate message-passing for convex optimization with non-separable penalties
Andre Manoel, Florent Krzakala, Gaël Varoquaux +2
We introduce an iterative optimization scheme for convex objectives consisting of a linear loss and a non-separable penalty, based on the expectation-consistent approximation and t…
Approximate Survey Propagation for Statistical Inference
Fabrizio Antenucci, Florent Krzakala, Pierfrancesco Urbani +1
Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy na…
On Minimal Sets to Destroy the -Core in Random Networks
Christian Schmidt, Henry D. Pfister, Lenka Zdeborová
We study the problem of finding the smallest set of nodes in a network whose removal results in an empty -core; where the -core is the sub-network obtained after the iterativ…
Typology of phase transitions in Bayesian inference problems
Federico Ricci-Tersenghi, Guilhem Semerjian, Lenka Zdeborova
Many inference problems, notably the stochastic block model (SBM) that generates a random graph with a hidden community structure, undergo phase transitions as a function of the si…