Self-Averaging Expectation Propagation

Burak Cakmak, Manfred Opper, Bernard Henri Fleury, Ole Winther

Research output: Contribution to conference without publisher/journalPosterResearchpeer-review

123 Downloads (Pure)

Abstract

We investigate the problem of approximate inference using Expectation Propagation
(EP) for large systems under some statistical assumptions. Our approach tries
to overcome the numerical bottleneck of EP caused by the inversion of large
matrices. Assuming that the measurement matrices are realizations of specific
types of random matrix ensembles – called invariant ensembles – the EP cavity
variances have an asymptotic self-averaging property. They can be pre-computed
using specific generating functions which do not require matrix inversions. We
demonstrate the performance of our approach on a signal recovery problem of
compressed sensing and compare with standard EP.
Original languageEnglish
Publication date2016
Number of pages5
Publication statusPublished - 2016
EventAdvances in Approximate Bayesian Inference : NIPS 2016 Workshop -
Duration: 9 Dec 20169 Dec 2016
http://approximateinference.org/

Workshop

WorkshopAdvances in Approximate Bayesian Inference
Period09/12/201609/12/2016
Internet address

Fingerprint

Dive into the research topics of 'Self-Averaging Expectation Propagation'. Together they form a unique fingerprint.

Cite this