Community detection and stochastic block models: recent developments

E Abbe - Journal of Machine Learning Research, 2018 - jmlr.org
The stochastic block model (SBM) is a random graph model with planted clusters. It is widely
employed as a canonical model to study clustering and community detection, and provides …

Statistical physics of inference: Thresholds and algorithms

L Zdeborová, F Krzakala - Advances in Physics, 2016 - Taylor & Francis
Many questions of fundamental interest in today's science can be formulated as inference
problems: some partial, or noisy, observations are performed over a set of variables and the …

Fundamental limits in structured principal component analysis and how to reach them

J Barbier, F Camilli, M Mondelli… - Proceedings of the …, 2023 - National Acad Sciences
How do statistical dependencies in measurement noise influence high-dimensional
inference? To answer this, we study the paradigmatic spiked matrix model of principal …

A unifying tutorial on approximate message passing

OY Feng, R Venkataramanan, C Rush… - … and Trends® in …, 2022 - nowpublishers.com
Over the last decade or so, Approximate Message Passing (AMP) algorithms have become
extremely popular in various structured high-dimensional statistical problems. Although the …

Sampling with flows, diffusion, and autoregressive neural networks from a spin-glass perspective

D Ghio, Y Dandi, F Krzakala, L Zdeborová - Proceedings of the National …, 2024 - pnas.org
Recent years witnessed the development of powerful generative models based on flows,
diffusion, or autoregressive neural networks, achieving remarkable success in generating …

Fundamental limits of symmetric low-rank matrix estimation

M Lelarge, L Miolane - Conference on Learning Theory, 2017 - proceedings.mlr.press
We consider the high-dimensional inference problem where the signal is a low-rank
symmetric matrix which is corrupted by an additive Gaussian noise. Given a probabilistic …

False discoveries occur early on the lasso path

W Su, M Bogdan, E Candes - The Annals of statistics, 2017 - JSTOR
In regression settings where explanatory variables have very low correlations and there are
relatively few effects, each of large magnitude, we expect the Lasso to find the important …

Approximate message passing algorithms for rotationally invariant matrices

Z Fan - The Annals of Statistics, 2022 - projecteuclid.org
Approximate Message Passing algorithms for rotationally invariant matrices Page 1 The
Annals of Statistics 2022, Vol. 50, No. 1, 197–224 https://doi.org/10.1214/21-AOS2101 © …

Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula

M Dia, N Macris, F Krzakala… - Advances in Neural …, 2016 - proceedings.neurips.cc
Factorizing low-rank matrices has many applications in machine learning and statistics. For
probabilistic models in the Bayes optimal setting, a general expression for the mutual …

The power of sum-of-squares for detecting hidden structures

SB Hopkins, PK Kothari, A Potechin… - 2017 IEEE 58th …, 2017 - ieeexplore.ieee.org
We study planted problems-finding hidden structures in random noisy inputs-through the
lens of the sum-of-squares semidefinite programming hierarchy (SoS). This family of …