Repository logo
 

A Unifying Tutorial on Approximate Message Passing

Accepted version
Peer-reviewed

Loading...
Thumbnail Image

Type

Article

Change log

Authors

Feng, Oliver Y 
Venkataramanan, Ramji  ORCID logo  https://orcid.org/0000-0001-7915-5432
Rush, Cynthia 
Samworth, Richard J 

Abstract

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.

Description

Keywords

cs.IT, math.IT, math.ST, math.ST, stat.ML, stat.TH

Journal Title

FOUNDATIONS AND TRENDS IN MACHINE LEARNING

Conference Name

Journal ISSN

1935-8237
1935-8245

Volume Title

abs/2105.02180

Publisher

Now Publishers
Sponsorship
Engineering and Physical Sciences Research Council (EP/N031938/1)
Engineering and Physical Sciences Research Council (EP/P031447/1)
Alan Turing Institute (Unknown)