S-AMP: Approximate Message Passing for General Matrix Ensembles

Burak Cakmak, Ole Winther, Bernard Henri Fleury

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

56 Citations (Scopus)
984 Downloads (Pure)

Abstract

We propose a novel iterative estimation algorithm for linear observation models called S-AMP. The fixed points of
S-AMP are the stationary points of the exact Gibbs free energy under a set of (first- and second-) moment consistency constraints
in the large system limit. S-AMP extends the approximate message-passing (AMP) algorithm to general matrix ensembles
with a well-defined large system size limit. The generalization is based on the S-transform (in free probability) of the spectrum
of the measurement matrix. Furthermore, we show that the optimality of S-AMP follows directly from its design rather than
from solving a separate optimization problem as done for AMP.
Original languageEnglish
Title of host publicationInformation Theory Workshop (ITW), 2014 IEEE
Number of pages5
PublisherIEEE Press
Publication date2 Nov 2014
Pages192 - 196
ISBN (Electronic) 978-1-4799-5998-0
DOIs
Publication statusPublished - 2 Nov 2014
Event2014 IEEE Information Theory Workshop - Hobart, Australia
Duration: 2 Nov 20145 Nov 2014
Conference number: 32406

Conference

Conference2014 IEEE Information Theory Workshop
Number32406
Country/TerritoryAustralia
CityHobart
Period02/11/201405/11/2014
SeriesIEEE Information Theory Workshop
ISSN1662-9019

Fingerprint

Dive into the research topics of 'S-AMP: Approximate Message Passing for General Matrix Ensembles'. Together they form a unique fingerprint.

Cite this