Derivation of the AMP equations from belief propagation for the 2 minimisation problem
Abstract
We consider the p-minimisation, which consists of finding the vector x∈RN which minimises \|x\|p subject to the linear constraint y=Ax, where y∈Rm is given and A is a m× N random matrix with i.i.d. sub-Gaussian centred entries (m<N). This can be viewed as the zero temperature version of a statistical mechanics problem, in which one introduces a suitable Gibbs measure on RN. To such a Gibbs measure there are associated belief propagation equations. We prove in the easiest case p=2 that the means of the distributions obtained by the belief propagation iteration satisfy asymptotically the approximate message passing equations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.