Preconditioned conjugate gradient, especially with a randomized Nyström eigenvalue decomposition preconditioner, solves the Stein equation linear systems used for MCMC post-processing in far fewer iterations than plain conjugate gradient.
Targeted Separation and Convergence with Kernel Discrepancies
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Maximum mean discrepancies (MMDs) like the kernel Stein discrepancy (KSD) have grown central to a wide range of applications, including hypothesis testing, sampler selection, distribution approximation, and variational inference. In each setting, these kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or even (ii) control weak convergence to P. In this article we derive new sufficient and necessary conditions to ensure (i) and (ii). For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels and for controlling convergence with bounded kernels. We use these results on $\mathbb{R}^d$ to substantially broaden the known conditions for KSD separation and convergence control and to develop the first KSDs known to exactly metrize weak convergence to P. Along the way, we highlight the implications of our results for hypothesis testing, measuring and improving sample quality, and sampling with Stein variational gradient descent.
citation-role summary
citation-polarity summary
fields
stat.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Fast Approximate Solution of Stein Equations for Post-Processing of MCMC
Preconditioned conjugate gradient, especially with a randomized Nyström eigenvalue decomposition preconditioner, solves the Stein equation linear systems used for MCMC post-processing in far fewer iterations than plain conjugate gradient.