On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction

被引:10
作者
Vihola, Matti [1 ]
Franks, Jordan [1 ]
机构
[1] Univ Jyvaskyla, Dept Math & Stat, POB 35, FI-40014 Jyvaskyla, Finland
基金
芬兰科学院;
关键词
Adaptive algorithm; Approximate Bayesian computation; Confidence interval; Importance sampling; Markov chain Monte Carlo; Tolerance choice; CONVERGENCE; INFERENCE; EFFICIENCY;
D O I
10.1093/biomet/asz078
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Approximate Bayesian computation enables inference for complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We propose an approach that involves using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure sufficient mixing and post-processing the output, leading to estimators for a range of finer tolerances. We introduce an approximate confidence interval for the related post-corrected estimators and propose an adaptive approximate Bayesian computation Markov chain Monte Carlo algorithm, which finds a balanced tolerance level automatically based on acceptance rate optimization. Our experiments show that post-processing-based estimators can perform better than direct Markov chain Monte Carlo targeting a fine tolerance, that our confidence intervals are reliable, and that our adaptive algorithm leads to reliable inference with little user specification.
引用
收藏
页码:381 / 395
页数:15
相关论文
共 37 条
[1]  
ANDRIEU C., 2018, Chapman & Hall/CRC Handbooks of Modern Statistical Methods
[2]   On the ergodicity properties of some adaptive MCMC algorithms [J].
Andrieu, Christophe ;
Moulines, Eric .
ANNALS OF APPLIED PROBABILITY, 2006, 16 (03) :1462-1505
[3]   A tutorial on adaptive MCMC [J].
Andrieu, Christophe ;
Thoms, Johannes .
STATISTICS AND COMPUTING, 2008, 18 (04) :343-373
[4]  
[Anonymous], 2009, MARKOV CHAINS STOCHA
[5]   The rate of convergence for approximate Bayesian computation [J].
Barber, Stuart ;
Voss, Jochen ;
Webster, Mark .
ELECTRONIC JOURNAL OF STATISTICS, 2015, 9 (01) :80-105
[6]  
Beaumont MA, 2002, GENETICS, V162, P2025
[7]   Julia: A Fresh Approach to Numerical Computing [J].
Bezanson, Jeff ;
Edelman, Alan ;
Karpinski, Stefan ;
Shah, Viral B. .
SIAM REVIEW, 2017, 59 (01) :65-98
[8]   The use of a single pseudo-sample in approximate Bayesian computation [J].
Bornn, Luke ;
Pillai, Natesh S. ;
Smith, Aaron ;
Woodard, Dawn .
STATISTICS AND COMPUTING, 2017, 27 (03) :583-590
[9]   Inference for stereological extremes [J].
Bortot, P. ;
Coles, S. G. ;
Sisson, S. A. .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2007, 102 (477) :84-92
[10]   Bayesian inference for a discretely observed stochastic kinetic model [J].
Boys, R. J. ;
Wilkinson, D. J. ;
Kirkwood, T. B. L. .
STATISTICS AND COMPUTING, 2008, 18 (02) :125-135