Optimal approximating Markov chains for Bayesian inference

Abstract

The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention has been paid to computational optimality in these approximating Markov Chains, or when such approximations are justified relative to obtaining shorter paths from the exact kernel. We give simple, sharp bounds for uniform approximations of uniformly mixing Markov chains. We then suggest a notion of optimality that incorporates computation time and approximation error, and use our bounds to make generalizations about properties of good approximations in the uniformly mixing setting. The relevance of these properties is demonstrated in applications to a minibatching-based approximate MCMC algorithm for large $n$ logistic regression and low-rank approximations for Gaussian processes.

References in corpus (1)

• Austerity in MCMC Land: Cutting the Metropolis-Hastings Budget

Cited by in corpus (5)

• Perturbation Bounds for Monte Carlo within Metropolis via Restricted Approximations
• Pólya Urn Latent Dirichlet Allocation: a doubly sparse massively parallel sampler
• Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance
• Beyond Application End-Point Results: Quantifying Statistical Robustness of MCMC Accelerators
• Shifted Lanczos method for quadratic forms with Hermitian matrix resolvents