The reproducing Stein kernel approach for post-hoc corrected sampling
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 4; 2023: 1; 2024: 1; 2025: 2; 2026: 1.
10 papers.
- 2021Kernel Stein Discrepancy Descentcited by 57
- 2022Gradient Estimation with Discrete Stein Operatorscited by 22
- 2022Targeted Separation and Convergence with Kernel Discrepanciescited by 15
- 2022A kernel Stein test of goodness of fit for sequential modelscited by 9
- 2022Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agentscited by 5
- 2023Using Perturbation to Improve Goodness-of-Fit Tests based on Kernelized Stein Discrepancycited by 4
- 2025The Minimax Lower Bound of Kernel Stein Discrepancy Estimationcited by 2
- 2026Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSDcited by 2
- 2024Scalable Monte Carlo for Bayesian Learningcited by 0
- 2025Copula Discrepancy: Benchmarking Dependence Structurecited by 0
- 2026Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD27 Jul 2026
- 2025The Minimax Lower Bound of Kernel Stein Discrepancy Estimation16 Oct 2025
- 2025Copula Discrepancy: Benchmarking Dependence Structure29 Jul 2025
- 2024Scalable Monte Carlo for Bayesian Learning17 Jul 2024
- 2023Using Perturbation to Improve Goodness-of-Fit Tests based on Kernelized Stein Discrepancy28 Apr 2023
- 2022A kernel Stein test of goodness of fit for sequential models19 Oct 2022
- 2022Targeted Separation and Convergence with Kernel Discrepancies26 Sep 2022
- 2022Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents20 Mar 2022
- 2022Gradient Estimation with Discrete Stein Operators19 Feb 2022
- 2021Kernel Stein Discrepancy Descent20 May 2021