Unbiased Markov chain Monte Carlo for intractable target distributions
TLDR
In this article, the authors show how to use coupling techniques to generate unbiased estimators in finite time, building on recent advances for generic MCMC algorithms, and extend existing results to cover the case of polynomially ergodic Markov chains.Abstract:
Performing numerical integration when the integrand itself cannot be evaluated point-wise is a challenging task that arises in statistical analysis, notably in Bayesian inference for models with intractable likelihood functions. Markov chain Monte Carlo (MCMC) algorithms have been proposed for this setting, such as the pseudo-marginal method for latent variable models and the exchange algorithm for a class of undirected graphical models. As with any MCMC algorithm, the resulting estimators are justified asymptotically in the limit of the number of iterations, but exhibit a bias for any fixed number of iterations due to the Markov chains starting outside of stationarity. This “burn-in” bias is known to complicate the use of parallel processors for MCMC computations. We show how to use coupling techniques to generate unbiased estimators in finite time, building on recent advances for generic MCMC algorithms. We establish the theoretical validity of some of these procedures, by extending existing results to cover the case of polynomially ergodic Markov chains. The efficiency of the proposed estimators is compared with that of standard MCMC estimators, with theoretical arguments and numerical experiments including state space models and Ising models.read more
Citations
More filters
Journal ArticleDOI
Unbiased Markov chain Monte Carlo methods with couplings
TL;DR: The theoretical validity of the estimators proposed and their efficiency relative to the underlying MCMC algorithms are established and the performance and limitations of the method are illustrated.
Posted Content
Unbiased Markov chain Monte Carlo with couplings
TL;DR: The theoretical validity of the proposed couplings of Markov chains together with a telescopic sum argument of Glynn and Rhee (2014) is established and their efficiency relative to the underlying MCMC algorithms is studied.
Proceedings Article
Estimating Convergence of Markov chains with L-Lag Couplings
TL;DR: In this paper, the authors introduce L-lag couplings to generate computable, nonasymptotic upper bound estimates for the total variation or the Wasserstein distance of general Markov chains.
Proceedings Article
Unbiased Smoothing using Particle Independent Metropolis-Hastings
TL;DR: A simple way of coupling two MCMC chains built using Particle Independent Metropolis–Hastings (PIMH) to produce unbiased smoothing estimators is proposed, which is easier to implement than recently proposed unbiased smoothers.
Posted Content
Computing Bayes: Bayesian Computation from 1763 to the 21st Century
TL;DR: This paper takes the reader on a chronological tour of Bayesian computation over the past two and a half centuries, and place all computational problems into a common framework, and describe all computational methods using a common notation.
References
More filters
Journal ArticleDOI
Novel approach to nonlinear/non-Gaussian Bayesian state estimation
TL;DR: An algorithm, the bootstrap filter, is proposed for implementing recursive Bayesian filters, represented as a set of random samples, which are updated and propagated by the algorithm.
Book
Markov Chains and Stochastic Stability
Sean P. Meyn,Richard L. Tweedie +1 more
TL;DR: This second edition reflects the same discipline and style that marked out the original and helped it to become a classic: proofs are rigorous and concise, the range of applications is broad and knowledgeable, and key ideas are accessible to practitioners with limited mathematical background.
Journal ArticleDOI
Crystal statistics. I. A two-dimensional model with an order-disorder transition
TL;DR: In this article, the eigenwert problem involved in the corresponding computation for a long strip crystal of finite width, joined straight to itself around a cylinder, is solved by direct product decomposition; in the special case $n=\ensuremath{\infty}$ an integral replaces a sum.
CODA: convergence diagnosis and output analysis for MCMC
TL;DR: Bayesian inference with Markov Chain Monte Carlo with coda package for R contains a set of functions designed to help the user answer questions about how many samples are required to accurately estimate posterior quantities of interest.
Journal ArticleDOI
Discrete Choice Methods with Simulation
TL;DR: Discrete Choice Methods with Simulation by Kenneth Train has been available in the second edition since 2009 and contains two additional chapters, one on endogenous regressors and one on the expectation–maximization (EM) algorithm.