Pith. sign in

REVIEW 2 cited by

The reproducing Stein kernel approach for post-hoc corrected sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.09266 v2 pith:SEXUF3BA submitted 2020-01-25 math.ST stat.MLstat.TH

classification math.STstat.MLstat.TH
keywords steinsamplingkernelizedsamplesapproachchainconditionsdiscrepancy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Computable Measure of Suboptimality for Entropy-Regularised Variational Objectives

    stat.CO 2025-09 conditional novelty 7.0 of 10

    Kernel gradient discrepancy gives a computable, theory-backed measure of suboptimality for entropy-regularised variational objectives, and it reduces to kernel Stein discrepancy in the standard Bayesian case.

  2. Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

    stat.ML 2026-07 accept novelty 6.0 of 10

    Minimax lower bounds for MMD, HSIC and KSD estimation are n^{-1/2} on general topological spaces under mild kernel assumptions, matching existing estimators.

Pith tools