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

被引:12
|
作者
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
相关论文
共 50 条
  • [1] Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach
    Parpas, Panos
    Ustun, Berk
    Webster, Mort
    Quang Kha Tran
    INFORMS JOURNAL ON COMPUTING, 2015, 27 (02) : 358 - 377
  • [2] An analytical study of several Markov chain Monte Carlo estimators of the marginal likelihood
    Yu, JZ
    Tanner, MA
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 1999, 8 (04) : 839 - 853
  • [3] Monte Carlo and importance sampling estimators of CoVaR
    Jiang, Guangxin
    Hao, Jianshu
    Sun, Tong
    OPERATIONS RESEARCH LETTERS, 2025, 60
  • [4] STEREOGRAPHIC MARKOV CHAIN MONTE CARLO
    Yang, Jun
    Latuszynski, Krzysztof
    Roberts, Gareth o.
    ANNALS OF STATISTICS, 2024, 52 (06) : 2692 - 2713
  • [5] Markov Chain Monte Carlo versus Importance Sampling in Bayesian Inference of the GARCH model
    Takaishi, Tetsuya
    17TH INTERNATIONAL CONFERENCE IN KNOWLEDGE BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS - KES2013, 2013, 22 : 1056 - 1064
  • [6] CONVERGENCE PROPERTIES OF PSEUDO-MARGINAL MARKOV CHAIN MONTE CARLO ALGORITHMS
    Andrieu, Christophe
    Vihola, Matti
    ANNALS OF APPLIED PROBABILITY, 2015, 25 (02) : 1030 - 1077
  • [7] Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
    Lee, Anthony
    Latuszynski, Krzysztof
    BIOMETRIKA, 2014, 101 (03) : 655 - 671
  • [8] Optimal Markov chain Monte Carlo sampling
    Chen, Ting-Li
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2013, 5 (05) : 341 - 348
  • [9] Analyzing Markov chain Monte Carlo output
    Vats, Dootika
    Robertson, Nathan
    Flegal, James M.
    Jones, Galin L.
    WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2020, 12 (04):
  • [10] Rao-Blackwellisation in the Markov Chain Monte Carlo Era
    Robert, Christian P.
    Roberts, Gareth
    INTERNATIONAL STATISTICAL REVIEW, 2021, 89 (02) : 237 - 249