Machine learning and the physical sciences
Machine learning (ML) encompasses a broad range of algorithms and modeling tools used
for a vast array of data processing tasks, which has entered most scientific disciplines in …
for a vast array of data processing tasks, which has entered most scientific disciplines in …
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 …
employed as a canonical model to study clustering and community detection, and provides …
Supervised community detection with line graph neural networks
Traditionally, community detection in graphs can be solved using spectral methods or
posterior inference under probabilistic graphical models. Focusing on random graph …
posterior inference under probabilistic graphical models. Focusing on random graph …
Optimal errors and phase transitions in high-dimensional generalized linear models
Generalized linear models (GLMs) are used in high-dimensional machine learning,
statistics, communications, and signal processing. In this paper we analyze GLMs when the …
statistics, communications, and signal processing. In this paper we analyze GLMs when the …
Sampling with flows, diffusion, and autoregressive neural networks from a spin-glass perspective
Recent years witnessed the development of powerful generative models based on flows,
diffusion, or autoregressive neural networks, achieving remarkable success in generating …
diffusion, or autoregressive neural networks, achieving remarkable success in generating …
Fundamental limits of symmetric low-rank matrix estimation
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 …
symmetric matrix which is corrupted by an additive Gaussian noise. Given a probabilistic …
The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference
In recent years important progress has been achieved towards proving the validity of the
replica predictions for the (asymptotic) mutual information (or “free energy”) in Bayesian …
replica predictions for the (asymptotic) mutual information (or “free energy”) in Bayesian …
The computer science and physics of community detection: Landscapes, phase transitions, and hardness
C Moore - arxiv preprint arxiv:1702.00467, 2017 - arxiv.org
Community detection in graphs is the problem of finding groups of vertices which are more
densely connected than they are to the rest of the graph. This problem has a long history, but …
densely connected than they are to the rest of the graph. This problem has a long history, but …
Frozen 1-RSB structure of the symmetric Ising perceptron
We prove, under an assumption on the critical points of a real-valued function, that the
symmetric Ising perceptron exhibits thefrozen 1-RSB'structure conjectured by Krauth and …
symmetric Ising perceptron exhibits thefrozen 1-RSB'structure conjectured by Krauth and …
The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models
In this contribution we give a pedagogic introduction to the newly introduced adaptive
interpolation method to prove in a simple and unified way replica formulas for Bayesian …
interpolation method to prove in a simple and unified way replica formulas for Bayesian …