A unifying tutorial on Approximate Message Passing

by   Oliver Y. Feng, et al.

Over the last decade or so, Approximate Message Passing (AMP) algorithms have become extremely popular in various structured high-dimensional statistical problems. The fact that the origins of these techniques can be traced back to notions of belief propagation in the statistical physics literature lends a certain mystique to the area for many statisticians. Our goal in this work is to present the main ideas of AMP from a statistical perspective, to illustrate the power and flexibility of the AMP framework. Along the way, we strengthen and unify many of the results in the existing literature.



page 1

page 2

page 3

page 4


Universality of Approximate Message Passing Algorithms

We consider a broad class of Approximate Message Passing (AMP) algorithm...

Statistical mechanics of complex neural systems and high dimensional data

Recent experimental advances in neuroscience have opened new vistas into...

Structured Message Passing

In this paper, we present structured message passing (SMP), a unifying f...

Replicated Vector Approximate Message Passing For Resampling Problem

Resampling techniques are widely used in statistical inference and ensem...

A Comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer Architectures for Computing Marginals of Probability Distributions

In the last decade, several architectures have been proposed for exact c...

The Kikuchi Hierarchy and Tensor PCA

For the tensor PCA (principal component analysis) problem, we propose a ...

ALBU: An approximate Loopy Belief message passing algorithm for LDA to improve performance on small data sets

Variational Bayes (VB) applied to latent Dirichlet allocation (LDA) has ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.