Adaptive approximate Bayesian computation
Sequential techniques can enhance the efficiency of the approximate Bayesian computation algorithm, as in Sisson et al.'s (2007) partial rejection control version. While this method is based upon the theoretical works of Del Moral et al. (2006), the application to approximate Bayesian computation results in a bias in the approximation to the posterior. An alternative version based on genuine importance sampling arguments bypasses this difficulty, in connection with the population Monte Carlo method of Cappé et al. (2004), and it includes an automatic scaling of the forward kernel. When applied to a population genetics example, it compares favourably with two other versions of the approximate algorithm. Copyright 2009, Oxford University Press.
Year of publication: |
2009
|
---|---|
Authors: | Beaumont, Mark A. ; Cornuet, Jean-Marie ; Marin, Jean-Michel ; Robert, Christian P. |
Published in: |
Biometrika. - Biometrika Trust, ISSN 0006-3444. - Vol. 96.2009, 4, p. 983-990
|
Publisher: |
Biometrika Trust |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
In defence of model-based inference in phylogeography
Corander, Jukka, (2010)
-
Adaptive Multiple Importance Sampling
CORNUET, JEAN-MARIE, (2012)
-
Lack of confidence in approximate Bayesian computation model choice
Robert, Christian P., (2011)
- More ...