Measuring Sample Quality with Diffusions

11/21/2016
by   Jackson Gorham, et al.
0

Standard Markov chain Monte Carlo diagnostics, like effective sample size, are ineffective for biased sampling procedures that sacrifice asymptotic correctness for computational speed. Recent work addresses this issue for a class of strongly log-concave target distributions by constructing a computable discrepancy measure based on Stein's method that provably determines convergence to the target. We generalize this approach to cover any target with a fast-coupling Ito diffusion by bounding the derivatives of Stein equation solutions in terms of Markov process coupling times. As example applications, we develop computable and convergence-determining diffusion Stein discrepancies for log-concave, heavy-tailed, and multimodal targets and use these quality measures to select the hyperparameters of biased samplers, compare random and deterministic quadrature rules, and quantify bias-variance tradeoffs in approximate Markov chain Monte Carlo. Our explicit multivariate Stein factor bounds may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2015

Measuring Sample Quality with Stein's Method

To improve the efficiency of Monte Carlo estimation, practitioners are t...
research
03/06/2017

Measuring Sample Quality with Kernels

Approximate Markov chain Monte Carlo (MCMC) offers the promise of more r...
research
08/13/2022

Finite Sample Complexity of Sequential Monte Carlo Estimators on Multimodal Target Distributions

We prove finite sample complexities for sequential Monte Carlo (SMC) alg...
research
01/28/2014

Tempering by Subsampling

In this paper we demonstrate that tempering Markov chain Monte Carlo sam...
research
11/18/2020

Subgeometric hypocoercivity for piecewise-deterministic Markov process Monte Carlo methods

We extend the hypocoercivity framework for piecewise-deterministic Marko...
research
10/22/2020

Random Coordinate Underdamped Langevin Monte Carlo

The Underdamped Langevin Monte Carlo (ULMC) is a popular Markov chain Mo...
research
11/29/2018

Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition

A key task in Bayesian machine learning is sampling from distributions t...

Please sign up or login with your details

Forgot password? Click here to reset