Importance sampling type estimators based on approximate marginal Markov chain Monte Carlo

被引:13
作者
Vihola, Matti [1 ]
Helske, Jouni [1 ,2 ]
Franks, Jordan [1 ,3 ]
机构
[1] Univ Jyvaskyla, Dept Math & Stat, POB 35, FI-40014 Jyvaskyla, Finland
[2] Linkoping Univ, Dept Sci & Technol, Linkoping, Sweden
[3] Newcastle Univ, Sch Math Stat & Phys, Newcastle Upon Tyne, Tyne & Wear, England
基金
芬兰科学院;
关键词
Delayed acceptance; importance sampling; Markov chain Monte Carlo; sequential Monte Carlo; pseudo-marginal method; unbiased estimator; CENTRAL LIMIT-THEOREMS; GEOMETRIC ERGODICITY; ADDITIVE-FUNCTIONALS; BAYESIAN COMPUTATION; UNIFORM ERGODICITY; STATE; GIBBS; SIMULATION; CONVERGENCE; HASTINGS;
D O I
10.1111/sjos.12492
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We consider importance sampling (IS) type weighted estimators based on Markov chain Monte Carlo (MCMC) targeting an approximate marginal of the target distribution. In the context of Bayesian latent variable models, the MCMC typically operates on the hyperparameters, and the subsequent weighting may be based on IS or sequential Monte Carlo (SMC), but allows for multilevel techniques as well. The IS approach provides a natural alternative to delayed acceptance (DA) pseudo-marginal/particle MCMC, and has many advantages over DA, including a straightforward parallelization and additional flexibility in MCMC implementation. We detail minimal conditions which ensure strong consistency of the suggested estimators, and provide central limit theorems with expressions for asymptotic variances. We demonstrate how our method can make use of SMC in the state space models context, using Laplace approximations and time-discretized diffusions. Our experimental results are promising and show that the IS-type approach can provide substantial gains relative to an analogous DA scheme, and is often competitive even without parallelization.
引用
收藏
页码:1339 / 1376
页数:38
相关论文
共 102 条
[91]   ON THE EFFICIENCY OF PSEUDO-MARGINAL RANDOM WALK METROPOLIS ALGORITHMS [J].
Sherlock, Chris ;
Thiery, Alexandre H. ;
Roberts, Gareth O. ;
Rosenthal, Jeffrey S. .
ANNALS OF STATISTICS, 2015, 43 (01) :238-275
[92]   Blocking strategies and stability of particle Gibbs samplers [J].
Singh, S. S. ;
Lindsten, F. ;
Moulines, E. .
BIOMETRIKA, 2017, 104 (04) :953-969
[93]   Honest Importance Sampling With Multiple Markov Chains [J].
Tan, Aixin ;
Doss, Hani ;
Hobert, James P. .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2015, 24 (03) :792-826
[94]  
TIERNEY L, 1994, ANN STAT, V22, P1701, DOI 10.1214/aos/1176325750
[95]  
Tran M.-N., 2014, ARXIV13093339V3
[96]  
Vihola M., 2017, ARXIV160902541V3
[97]   On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction [J].
Vihola, Matti ;
Franks, Jordan .
BIOMETRIKA, 2020, 107 (02) :381-395
[98]   Unbiased Estimators and Multilevel Monte Carlo [J].
Vihola, Matti .
OPERATIONS RESEARCH, 2018, 66 (02) :448-462
[99]   Robust adaptive Metropolis algorithm with coerced acceptance rate [J].
Vihola, Matti .
STATISTICS AND COMPUTING, 2012, 22 (05) :997-1008
[100]   TWISTED PARTICLE FILTERS [J].
Whiteley, Nick ;
Lee, Anthony .
ANNALS OF STATISTICS, 2014, 42 (01) :115-141