On sequential Monte Carlo, partial rejection control and approximate Bayesian computation

From MaRDI portal
Publication:693361

DOI10.1007/S11222-012-9315-YzbMATH Open1252.65022arXiv0808.3466OpenAlexW2048509028MaRDI QIDQ693361FDOQ693361


Authors: Gareth W. Peters, Yanan Fan, S. A. Sisson Edit this on Wikidata


Publication date: 7 December 2012

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: We present a sequential Monte Carlo sampler variant of the partial rejection control algorithm, and show that this variant can be considered as a sequential Monte Carlo sampler with a modified mutation kernel. We prove that the new sampler can reduce the variance of the incremental importance weights when compared with standard sequential Monte Carlo samplers. We provide a study of theoretical properties of the new algorithm, and make connections with some existing algorithms. Finally, the sampler is adapted for application under the challenging "likelihood free," approximate Bayesian computation modelling framework, where we demonstrate superior performance over existing likelihood-free samplers.


Full work available at URL: https://arxiv.org/abs/0808.3466




Recommendations




Cites Work


Cited In (19)

Uses Software





This page was built for publication: On sequential Monte Carlo, partial rejection control and approximate Bayesian computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693361)