pith. sign in

arxiv: 2605.25173 · v1 · pith:7LUYKBF2new · submitted 2026-05-24 · 📊 stat.ML · cs.LG· math.ST· stat.TH

Nystr\"om Kernel Stein Discrepancy Tests

classification 📊 stat.ML cs.LGmath.STstat.TH
keywords nystrtestsasymptoticdiscrepancykernelmethodnumberquadratic-time
0
0 comments X
read the original abstract

Kernel Stein discrepancy (KSD) is among the most popular goodness-of-fit (GoF) measures on general domains with a large number of successful deployments. One of the main applications of KSD is in constructing powerful GoF tests. However, tests relying on the classical U-/V-statistic-based KSD estimators have two major drawbacks. (i) Their runtime scales quadratically in the number of samples. (ii) Their asymptotic null distribution is computationally intractable in most cases, typically handled by bootstrapping. While it is known that the Nystr\"om method permits accelerating KSD estimation with no loss of statistical accuracy under mild conditions, to the best of our knowledge, the fundamental question of its impact on bootstrap-based GoF testing is open; resolving this question is the focus of the current paper. In particular, we prove that the key properties of the quadratic-time bootstrapped KSD-based GoF test (asymptotic level and local consistency) are preserved by its Nystr\"om acceleration. We numerically demonstrate the efficiency of the accelerated KSD estimator and bootstrap in the context of GoF testing of spherical and functional data. Our numerical results show that the Nystr\"om-accelerated method performs statistically on-par with the quadratic-time approach, while requiring substantially smaller runtime.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.