Adaptive multiple importance sampling

From MaRDI portal
Publication:3145570

DOI10.1111/J.1467-9469.2011.00756.XzbMATH Open1319.62059arXiv0907.1254OpenAlexW1665662210WikidataQ55953615 ScholiaQ55953615MaRDI QIDQ3145570FDOQ3145570

Antonietta Mira, Jean-Michel Marin, Christian P. Robert Robert, J. M. Cornuet

Publication date: 21 December 2012

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Abstract: The Adaptive Multiple Importance Sampling (AMIS) algorithm is aimed at an optimal recycling of past simulations in an iterated importance sampling scheme. The difference with earlier adaptive importance sampling implementations like Population Monte Carlo is that the importance weights of all simulated values, past as well as present, are recomputed at each iteration, following the technique of the deterministic multiple mixture estimator of Owen and Zhou (2000). Although the convergence properties of the algorithm cannot be fully investigated, we demonstrate through a challenging banana shape target distribution and a population genetics example that the improvement brought by this technique is substantial.


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




Recommendations




Cites Work


Cited In (51)

Uses Software





This page was built for publication: Adaptive multiple importance sampling

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