The reproducing Stein kernel approach for post-hoc corrected sampling

01/25/2020
by   Liam Hodgkinson, et al.
0

Stein importance sampling is a widely applicable technique based on kernelized Stein discrepancy, which corrects the output of approximate sampling algorithms by reweighting the empirical distribution of the samples. A general analysis of this technique is conducted for the previously unconsidered setting where samples are obtained via the simulation of a Markov chain, and applies to an arbitrary underlying Polish space. We prove that Stein importance sampling yields consistent estimators for quantities related to a target distribution of interest by using samples obtained from a geometrically ergodic Markov chain with a possibly unknown invariant measure that differs from the desired target. The approach is shown to be valid under conditions that are satisfied for a large number of unadjusted samplers, and is capable of retaining consistency when data subsampling is used. Along the way, a universal theory of reproducing Stein kernels is established, which enables the construction of kernelized Stein discrepancy on general Polish spaces, and provides sufficient conditions for kernels to be convergence-determining on such spaces. These results are of independent interest for the development of future methodology based on kernelized Stein discrepancies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2023

Stein Π-Importance Sampling

Stein discrepancies have emerged as a powerful tool for retrospective im...
research
07/17/2022

The Importance Markov Chain

The Importance Markov chain is a new algorithm bridging the gap between ...
research
08/16/2022

Score-Based Diffusion meets Annealed Importance Sampling

More than twenty years after its introduction, Annealed Importance Sampl...
research
05/18/2018

Markov Chain Importance Sampling - a highly efficient estimator for MCMC

Markov chain algorithms are ubiquitous in machine learning and statistic...
research
03/06/2017

Measuring Sample Quality with Kernels

Approximate Markov chain Monte Carlo (MCMC) offers the promise of more r...
research
06/07/2017

Stochastic Global Optimization Algorithms: A Systematic Formal Approach

As we know, some global optimization problems cannot be solved using ana...
research
03/02/2020

Batch Stationary Distribution Estimation

We consider the problem of approximating the stationary distribution of ...

Please sign up or login with your details

Forgot password? Click here to reset