Pith. sign in

REVIEW 1 cited by

Targeted Separation and Convergence with Kernel Discrepancies

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 2209.12835 v5 pith:VK3A6UM6 submitted 2022-09-26 stat.ML cs.LGmath.STstat.TH

classification stat.MLcs.LGmath.STstat.TH
keywords convergencemeasuresconditionskernelscontroldiscrepanciesdiscrepancyhypothesis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Fast Approximate Solution of Stein Equations for Post-Processing of MCMC

    stat.CO 2025-01 conditional novelty 5.0 of 10

    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 plai...

Pith tools