Can I read Expectation-Propagation for Likelihood-Free Inference on EtoBox?

Expectation-Propagation for Likelihood-Free Inference by Barthelmé, Simon; Chopin, Nicolas is a scholarly article available to read on EtoBox.

What is Expectation-Propagation for Likelihood-Free Inference about?

Many models of interest in the natural and social sciences have no closed-form likelihood function, which means that they cannot be treated using the usual techniques of statistical inference. In the case where such models can be efficiently simulated, Bayesian inference is still possible thanks to the Approximate Bayesian Computation (ABC) algorithm. Although many refinements have been suggested, ABC inference is still far from routine. ABC is often excruciatingly slow due to very low acceptance rates. In addition, ABC requires introducing a vector of "summary statistics", the choice of which is relatively arbitrary, and often require some trial and error, making the whole process quite laborious for the user. We introduce in this work the EP-ABC algorithm, which is an adaptation to the likelihood-free context of the variational approximation algorithm known as Expectation Propagation (Minka, 2001). The main advantage of EP-ABC is that it is faster by a few orders of magnitude than standard algorithms, while producing an overall approximation error which is typically negligible. A second advantage of EP-ABC is that it replaces the usual global ABC constraint on the vector of summa

Author

Barthelmé, Simon; Chopin, Nicolas

Published

2011

Language

EN