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.
(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.
Originalsprog | Engelsk |
---|---|
Publikationsdato | 2016 |
Antal sider | 5 |
Status | Udgivet - 2016 |
Begivenhed | Advances in Approximate Bayesian Inference : NIPS 2016 Workshop - Varighed: 9 dec. 2016 → 9 dec. 2016 http://approximateinference.org/ |
Workshop
Workshop | Advances in Approximate Bayesian Inference |
---|---|
Periode | 09/12/2016 → 09/12/2016 |
Internetadresse |