Pith. sign in

REVIEW 3 minor 2 cited by

Nystr\"om Kernel Stein Discrepancy Tests

T0 review · 0 major / 3 minor · reviewed 2026-06-29 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Nyström acceleration preserves asymptotic level and local consistency of bootstrapped KSD goodness-of-fit tests.

desk verdict The paper proves that Nyström approximation preserves asymptotic level and local consistency for bootstrapped KSD GoF tests under the same mild conditions already known for the estimator. read the letter →

arxiv 2605.25173 v1 pith:7LUYKBF2 submitted 2026-05-24 stat.ML cs.LGmath.STstat.TH

Florian Kalinke , Zoltán Szabó , Bharath K. Sriperumbudur This is my paper · ORCID
classification stat.MLcs.LGmath.STstat.TH
keywords NyströmapproximationkernelSteindiscrepancygoodness-of-fittestbootstrapasymptoticlevellocalconsistencycomputationalacceleration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that accelerating kernel Stein discrepancy estimation via the Nyström method does not compromise the asymptotic level or local consistency of the associated bootstrap goodness-of-fit test. Classical KSD tests suffer from quadratic runtime and rely on bootstrapping whose distribution is hard to compute directly. Showing that the fast version inherits the same guarantees means practitioners can test model fit on larger datasets with the same reliability. Experiments illustrate that the accelerated tests match the original in power while running much faster on spherical and functional data examples.

What carries the argument

Nyström approximation of the kernel Stein discrepancy estimator, which reduces quadratic kernel evaluations to a lower-rank form while keeping the bootstrap null distribution and power properties unchanged.

What would settle it

Generate samples from the null distribution, run the Nyström-accelerated bootstrap KSD test at fixed significance level, and check whether the empirical rejection rate converges to that level as sample size grows.

Watch

Extended reading notes

Core claim

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öm acceleration. This holds because the Nyström method permits accelerating KSD estimation with no loss of statistical accuracy under mild conditions.

Load-bearing premise

The mild conditions that let the Nyström method accelerate KSD estimation without loss of statistical accuracy continue to hold when the estimator enters the bootstrap test.

Editorial extensions

If this is right

  • Bootstrapped KSD tests become feasible for sample sizes where full quadratic computation exceeds available resources.
  • The same asymptotic validity proof covers both the original and accelerated estimators, so no separate bootstrap analysis is required.
  • Local consistency carries over, so the accelerated test detects local alternatives at the same rate as the full method.
  • Numerical results on spherical and functional data confirm that statistical performance stays on par while runtime drops substantially.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same Nyström argument may apply to other kernel discrepancies that currently rely on quadratic-time bootstrap tests.
  • The accelerated procedure could support sequential or streaming goodness-of-fit monitoring where fresh data arrives continuously.
  • Combining Nyström with other low-rank approximations such as random features might yield further speed-ups whose bootstrap properties remain provable.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript develops a Nyström-accelerated variant of the bootstrapped quadratic-time Kernel Stein Discrepancy (KSD) goodness-of-fit test. It proves that the asymptotic level and local consistency of the original test are preserved under the Nyström approximation (under mild conditions already known to control estimator accuracy), and reports numerical experiments on spherical and functional data showing statistical parity with substantially reduced runtime.

Significance. The preservation proof for bootstrap-based KSD testing under Nyström acceleration directly addresses the quadratic scaling barrier while retaining the test's theoretical guarantees. This is a useful extension for practitioners working with large samples on general domains; the explicit statement that the bootstrap analysis is the novel component, together with the numerical parity demonstration, strengthens the contribution.

minor comments (3)
  1. [Theorem on asymptotic level] §3 (or the theorem statement on preservation): the precise statement of the 'mild conditions' under which the Nyström estimator accuracy carries over should be recalled or referenced explicitly so that the bootstrap extension is self-contained.
  2. [Experiments] Numerical section: the choice of Nyström rank (or number of landmarks) is described only qualitatively; adding a short sensitivity table or explicit rule used in the experiments would improve reproducibility.
  3. [Bootstrap procedure] Notation: the distinction between the full KSD estimator and its Nyström version is clear in the text but the bootstrap resampling step could use a single consistent symbol (e.g., B_n vs. B_n^N) throughout to avoid any momentary ambiguity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, recognition of its contribution in preserving bootstrap-based KSD test guarantees under Nyström acceleration, and recommendation for minor revision. No major comments were raised in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; preservation proof under external known result

full rationale

The central claim is a mathematical proof that asymptotic level and local consistency of the existing quadratic-time bootstrapped KSD GoF test are preserved under Nyström acceleration. The abstract explicitly treats the accuracy-preserving property of Nyström as a known external fact (invoked to enable the bootstrap analysis), with the preservation result presented as the novel contribution. No self-definitional equations, fitted inputs renamed as predictions, load-bearing self-citations, or ansatz smuggling are detectable from the provided material. The derivation chain is therefore self-contained against external benchmarks and does not reduce to its own inputs by construction.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

The paper relies on standard kernel and Stein operator assumptions plus the mild conditions for Nyström approximation; no new free parameters or invented entities are introduced in the abstract.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Nystr\"om Kernel Stein Discrepancy Tests." pith.science (2026). https://pith.science/paper/7LUYKBF2

@misc{pith2026260525173,
  author       = {Pith},
  title        = {Pith review of: Nystr\"om Kernel Stein Discrepancy Tests},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7LUYKBF2}},
  note         = {Machine review of arXiv:2605.25173}
}
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.

Figures

Figures reproduced from arXiv: 2605.25173 by the authors.

Figure 1
Figure 1. Results of approximating the nominal level, power, and the total average runtimes (including the bootstrap computation) for d = 2 (top), d = 3 (bottom), and different choices of the sample size n and the concentration parameter κ. To approximate the power, we sample from the von Mises-Fisher distribution (resp. its specific case if d = 2, the von Mises distribution), which has density p(θ) = e κµTx Nd(κ) , with dire… view at source ↗
Figure 2
Figure 2. GoF testing on functional data with n samples of P. The target distribution is Brownian motion, the respective sampling distributions are indicated on the top of the figures, with the average runtime shown on the r.h.s. 5.2 Nystr¨om KSD Test on Functional Data In this section, we apply the Nystr¨om acceleration to GoF testing to functional data. In particular, we employ the setup of Wynne et al. (2025) (also employe… view at source ↗

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. Minimax Estimation of Kernel Stein Discrepancy: Trace versus Hilbert-Schmidt Scales

    math.ST 2026-07 accept novelty 6.5 of 10

    Minimax risk for estimating KSD is governed by the Hilbert–Schmidt norm of the Stein covariance, attained by a square-root U-statistic but not by the standard V-statistic.

  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.

Reference graph

Works this paper leans on

96 extracted references · 3 canonical work pages · cited by 2 Pith papers

  1. [1]

    Gaunt, Fatemeh Ghaderinezhad, Jackson Gorham, Arthur Gretton, Christophe Ley, Qiang Liu, Lester Mackey, Chris J

    Andreas Anastasiou, Alessandro Barp, Fran c ois-Xavier Briol, Bruno Ebner, Robert E. Gaunt, Fatemeh Ghaderinezhad, Jackson Gorham, Arthur Gretton, Christophe Ley, Qiang Liu, Lester Mackey, Chris J. Oates, Gesine Reinert, and Yvik Swan. Stein's method meets computational statistics: A review of some recent developments. Statistical Science, 38 0 (1): 0 120...

    2023

  2. [2]

    Arcones and Evarist Gin\' e

    Miguel A. Arcones and Evarist Gin\' e . On the bootstrap of U and V statistics. The Annals of Statistics, 20 0 (2): 0 655--674, 1992

    1992

  3. [3]

    Theory of reproducing kernels

    Nachman Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68: 0 337--404, 1950

    1950

  4. [4]

    On the optimality of kernel-embedding based goodness-of-fit tests

    Krishnakumar Balasubramanian, Tong Li, and Ming Yuan. On the optimality of kernel-embedding based goodness-of-fit tests. Journal of Machine Learning Research, 22 0 (1): 0 1--45, 2021

    2021

  5. [5]

    Baringhaus and C

    L. Baringhaus and C. Franz. On a new multivariate two-sample test. Journal of Multivariate Analysis, 88: 0 190--206, 2004

    2004

  6. [6]

    Targeted separation and convergence with kernel discrepancies

    Alessandro Barp, Carl-Johann Simon-Gabriel, Mark Girolami, and Lester Mackey. Targeted separation and convergence with kernel discrepancies. Journal of Machine Learning Research, 25 0 (378): 0 1--50, 2024

    2024

  7. [7]

    A kernel Stein test of goodness of fit for sequential models

    Jerome Baum, Heishiro Kanagawa, and Arthur Gretton. A kernel Stein test of goodness of fit for sequential models. In Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett, editors, International Conference on Machine Learning ( ICML ) , pages 1936--1953. PMLR, 2023

    1936

  8. [8]

    Reproducing Kernel Hilbert Spaces in Probability and Statistics

    Alain Berlinet and Christine Thomas-Agnan. Reproducing Kernel Hilbert Spaces in Probability and Statistics. Kluwer, 2004

    2004

Show all 96 references
  1. [9]

    Bickel and Leo Breiman

    Peter J. Bickel and Leo Breiman. Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. The Annals of Probability, 11 0 (1): 0 185--214, 1983

    1983

  2. [10]

    Optimal rates for regularization of statistical inverse learning problems

    Gilles Blanchard and Nicole M\" u cke. Optimal rates for regularization of statistical inverse learning problems. Foundations of Computational Mathematics, 18 0 (4): 0 971--1013, 2018

    2018

  3. [11]

    Bongiorno, Aldo Goia, and Philippe Vieu

    Enea G. Bongiorno, Aldo Goia, and Philippe Vieu. Modeling functional data: a test procedure. Computational Statistics, 34 0 (2): 0 451--468, 2019

    2019

  4. [12]

    Optimal rates for regularized least-squares algorithm

    Andrea Caponnetto and Ernesto De Vito . Optimal rates for regularized least-squares algorithm. Foundations of Computational Mathematics, 7 0 (3): 0 331--368, 2007

    2007

  5. [13]

    Vector valued reproducing kernel H ilbert spaces and universality

    Claudio Carmeli, Ernesto De Vito, Alessandro Toigo, and Veronica Umanit \'a . Vector valued reproducing kernel H ilbert spaces and universality. Analysis and Applications, 8: 0 19--61, 2010

    2010

  6. [14]

    Orlicz random F ourier features

    Linda Chamakh, Emmanuel Gobet, and Zoltán Szabó. Orlicz random F ourier features. Journal of Machine Learning Research, 21 0 (145): 0 1--37, 2020

    2020

  7. [15]

    Nystr \"o m kernel mean embeddings

    Antoine Chatalic, Nicolas Schreuder, Alessandro Rudi, and Lorenzo Rosasco. Nystr \"o m kernel mean embeddings. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, International Conference on Machine Learning (ICML), volume 1...

    2022

  8. [16]

    An efficient permutation-based kernel two-sample test

    Antoine Chatalic, Marco Letizia, Nicolas Schreuder, and Lorenzo Rosasco. An efficient permutation-based kernel two-sample test. Technical report, 2025. https://arxiv.org/abs/2502.13570

    2025 arXiv

  9. [17]

    Louis H. Y. Chen. Stein's method of normal approximation: Some recollections and reflections. The Annals of Statistics, 49 0 (4): 0 1850--1863, 2021

    2021

  10. [18]

    Fast two-sample testing with analytic representations of probability measures

    Kacper Chwialkowski, Aaditya Ramdas, Dino Sejdinovic, and Arthur Gretton. Fast two-sample testing with analytic representations of probability measures. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems (...

    1972

  11. [19]

    A kernel test of goodness of fit

    Kacper Chwialkowski, Heiko Strathmann, and Arthur Gretton. A kernel test of goodness of fit. In Maria - Florina Balcan and Kilian Q. Weinberger, editors, International Conference on Machine Learning (ICML), volume 48, pages 2606--2615. PMLR, 2016

    2016

  12. [20]

    The minimax lower bound of kernel S tein discrepancy estimation

    Jose Cribeiro-Ramallo, Agnideep Aich, Florian Kalinke, Ashit Baran Aich, and Zoltán Szabó. The minimax lower bound of kernel S tein discrepancy estimation. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2026. (accepted; preprint: https://arxiv...

    2026

  13. [21]

    On the mathematical foundations of learning

    Felipe Cucker and Steve Smale. On the mathematical foundations of learning. Bulletin of the American Mathematical Society, 39 0 (1): 0 1--49, 2002

    2002

  14. [22]

    Learning Theory: An Approximation Theory Viewpoint

    Felipe Cucker and Ding-Xuan Zhou. Learning Theory: An Approximation Theory Viewpoint. Cambridge University Press, 2007

    2007

  15. [23]

    Regularization: from inverse problems to large-scale machine learning

    Ernesto De Vito, Lorenzo Rosasco, and Alessandro Rudi. Regularization: from inverse problems to large-scale machine learning. In Harmonic and Applied Analysis---from R adon Transforms to Machine Learning , pages 245--296. Birkh\" a user/Springer, Cham, 2021

    2021

  16. [24]

    Random quadratic forms and the bootstrap for U -statistics

    Herold Dehling and Thomas Mikosch. Random quadratic forms and the bootstrap for U -statistics. Journal of Multivariate Analysis, 51 0 (2): 0 392--413, 1994

    1994

  17. [25]

    Regularized ERM on random subspaces

    Andrea Della Vecchia, Jaouad Mourtada, Ernesto De Vito, and Lorenzo Rosasco. Regularized ERM on random subspaces. In Arindam Banerjee and Kenji Fukumizu, editors, International Conference on Artificial Intelligence and Statistics (AISTATS), volume 130, pages 4006--4014. PMLR , 2021

    2021

  18. [26]

    Vector Measures

    Joseph Diestel and John Jerry Uhl. Vector Measures. American Mathematical Society, 1977

    1977

  19. [27]

    A pure hypothesis test for inhomogeneous random graph models based on a kernelised S tein discrepancy

    Anum Fatima and Gesine Reinert. A pure hypothesis test for inhomogeneous random graph models based on a kernelised S tein discrepancy. Technical report, 2025. https://arxiv.org/abs/2505.21580

    2025

  20. [28]

    Kernelized S tein discrepancy tests of goodness-of-fit for time-to-event data

    Tamara Fernandez, Nicolas Rivera, Wenkai Xu, and Arthur Gretton. Kernelized S tein discrepancy tests of goodness-of-fit for time-to-event data. In Hal Daumé III and Aarti Singh, editors, International Conference on Machine Learning (ICML) , pages 3112--3122. PMLR, 2020

    2020

  21. [29]

    Kernel measures of conditional dependence

    Kenji Fukumizu, Arthur Gretton, Xiaohai Sun, and Bernhard Sch \"o lkopf. Kernel measures of conditional dependence. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 20, pages 489--496. Curran Associa...

    2007

  22. [30]

    Measuring sample quality with Stein 's method

    Jackson Gorham and Lester Mackey. Measuring sample quality with Stein 's method. In Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, and Roman Garnett, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 28, pages 226--234. Curran Ass...

    2015

  23. [31]

    Measuring sample quality with kernels

    Jackson Gorham and Lester Mackey. Measuring sample quality with kernels. In Doina Precup and Yee Whye Teh, editors, International Conference on Machine Learning (ICML), volume 70, pages 1292--1301. PMLR, 2017

    2017

  24. [32]

    Sriperumbudur

    Arthur Gretton, Kenji Fukumizu, Za \" d Harchaoui, and Bharath K. Sriperumbudur. A fast, consistent kernel two-sample test. In Yoshua Bengio, Dale Schuurmans, John D. Lafferty, Christopher K. I. Williams, and Aron Culotta, editors, Advances in Neural Information Processing Sys...

    2009

  25. [33]

    A kernel two-sample test

    Arthur Gretton, Karsten Borgwardt, Malte Rasch, Bernhard Sch \"o lkopf, and Alexander Smola. A kernel two-sample test. Journal of Machine Learning Research, 13 0 (25): 0 723--773, 2012

    2012

  26. [34]

    Sriperumbudur, and Bing Li

    Omar Hagrass, Bharath K. Sriperumbudur, and Bing Li. Spectral regularized kernel two-sample tests. The Annals of Statistics, 52 0 (3): 0 1076--1101, 2024 a

    2024

  27. [35]

    Sriperumbudur, and Bing Li

    Omar Hagrass, Bharath K. Sriperumbudur, and Bing Li. Spectral regularized kernel goodness-of-fit tests. Journal of Machine Learning Research, 25 0 (309): 0 1--52, 2024 b

    2024

  28. [36]

    Minimax optimal goodness-of-fit testing with kernel S tein discrepancy

    Omar Hagrass, Bharath Sriperumbudur, and Krishnakumar Balasubramanian. Minimax optimal goodness-of-fit testing with kernel S tein discrepancy. Bernoulli, 32 0 (1): 0 299--324, 2026

    2026

  29. [37]

    Multivariate goodness-of-fit tests based on W asserstein distance

    Marc Hallin, Gilles Mordant, and Johan Segers. Multivariate goodness-of-fit tests based on W asserstein distance. Electronic Journal of Statistics, 15 0 (1): 0 1328--1371, 2021

    2021

  30. [38]

    Huggins and Lester Mackey

    Jonathan H. Huggins and Lester Mackey. Random feature S tein discrepancies. In S. Bengio, H. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 31, pages 1899--1909. Curran Associate...

    1909

  31. [39]

    Ingster and Irina A

    Yuri I. Ingster and Irina A. Suslina. Nonparametric Goodness-of-fit Testing under G aussian Models . Springer, 2003

    2003

  32. [40]

    A linear-time kernel goodness-of-fit test

    Wittawat Jitkrittum, Wenkai Xu, Zolt \' a n Szab \' o , Kenji Fukumizu, and Arthur Gretton. A linear-time kernel goodness-of-fit test. In I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Proces...

    2017

  33. [41]

    Nystr \"o m M - H ilbert- S chmidt independence criterion

    Florian Kalinke and Zolt \'a n Szab \'o . Nystr \"o m M - H ilbert- S chmidt independence criterion. In Robin J. Evans and Ilya Shpitser, editors, Conference on Uncertainty in Artificial Intelligence (UAI), volume 216, pages 1005--1015. PMLR, 2023

    2023

  34. [42]

    Sriperumbudur

    Florian Kalinke, Zolt \' a n Szab \' o , and Bharath K. Sriperumbudur. Nyström kernel S tein discrepancy. In Yingzhen Li, Stephan Mandt, Shipra Agrawal, and Emtiyaz Khan, editors, International Conference on Artificial Intelligence and Statistics (AISTATS), volume 258, pages 3...

    2025

  35. [43]

    A kernel S tein test for comparing latent variable models

    Heishiro Kanagawa, Wittawat Jitkrittum, Lester Mackey, Kenji Fukumizu, and Arthur Gretton. A kernel S tein test for comparing latent variable models. Journal of the Royal Statistical Society. Series B (Statistical Methodology), 85 0 (3): 0 986--1011, 2023

    2023

  36. [44]

    \`E. V. Khmaladze. An innovation approach to goodness-of-fit tests in R ^m . The Annals of Statistics, 16 0 (4): 0 1503--1516, 1988

    1988

  37. [45]

    \`E. V. Khmaladze. Goodness of fit problem and scanning innovation martingales. The Annals of Statistics, 21 0 (2): 0 798--829, 1993

    1993

  38. [46]

    N-Distances and Their Applications

    Lev Klebanov. N-Distances and Their Applications. Charles University, Prague, 2005

    2005

  39. [47]

    Kolmogorov

    Andrey N. Kolmogorov. Sulla determinazione empirica delle leggi di probabilita. Giornale dell'Istituto Italiano degli Attuari, 4 0 (1), 1933

    1933

  40. [48]

    Alan J. Laub. Matrix Analysis for Scientists and Engineers. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2004

    2004

  41. [49]

    Lehmann and Joseph P

    Erich L. Lehmann and Joseph P. Romano. Testing Statistical Hypotheses. Springer, 2021

    2021

  42. [50]

    Anne Leucht and Michael H. Neumann. Dependent wild bootstrap for degenerate U - and V -statistics. Journal of Multivariate Analysis, 117: 0 257--280, 2013

    2013

  43. [51]

    Kernel S tein tests for multiple model comparison

    Jen Ning Lim, Makoto Yamada, Bernhard Sch \"o lkopf, and Wittawat Jitkrittum. Kernel S tein tests for multiple model comparison. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d Alch\' e -Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems...

    2019

  44. [52]

    Black-box importance sampling

    Qiang Liu and Jason Lee. Black-box importance sampling . In Aarti Singh and Jerry Zhu, editors, International Conference on Artificial Intelligence and Statistics ( AISTATS ) , volume 54, pages 952--961. PMLR, 2017

    2017

  45. [53]

    A kernelized Stein discrepancy for goodness-of-fit tests

    Qiang Liu, Jason Lee, and Michael Jordan. A kernelized Stein discrepancy for goodness-of-fit tests. In Maria - Florina Balcan and Kilian Q. Weinberger, editors, International Conference on Machine Learning (ICML), volume 48, pages 276--284. PMLR, 2016

    2016

  46. [54]

    On the robustness of kernel goodness-of-fit tests

    Xing Liu and Fran c ois-Xavier Briol. On the robustness of kernel goodness-of-fit tests. Journal of Machine Learning Research, 26 0 (262): 0 1--72, 2025

    2025

  47. [55]

    Sequential kernelized S tein discrepancy

    Diego Martinez-Taboada and Aaditya Ramdas. Sequential kernelized S tein discrepancy. In Yingzhen Li, Stephan Mandt, Shipra Agrawal, and Emtiyaz Khan, editors, International Conference on Artificial Intelligence and Statistics (AISTATS) , volume 258, pages 1288--1296. PMLR, 2025

    2025

  48. [56]

    On the Statistical Approximation of Conditional Expectation Operators

    Mattes Mollenhauer. On the Statistical Approximation of Conditional Expectation Operators. PhD thesis, Freie Universität Berlin (Germany), 2021

    2021

  49. [57]

    Sriperumbudur, and Bernhard Sch \" o lkopf

    Krikamol Muandet, Kenji Fukumizu, Bharath K. Sriperumbudur, and Bernhard Sch \" o lkopf. Kernel mean embedding of distributions: A review and beyond. Foundations and Trends in Machine Learning, 10 0 (1-2): 0 1--141, 2017

    2017

  50. [58]

    Integral probability metrics and their generating classes of functions

    Alfred M \"u ller. Integral probability metrics and their generating classes of functions. Advances in Applied Probability, 29 0 (2): 0 429--443, 1997

    1997

  51. [59]

    o m. \" U ber die P raktische A ufl\

    E. J. Nystr\" o m. \" U ber die P raktische A ufl\" o sung von I ntegralgleichungen mit A nwendungen auf R andwertaufgaben. Acta Mathematica, 54 0 (1): 0 185--204, 1930

    1930

  52. [60]

    Oates, Mark Girolami, and Nicolas Chopin

    Chris J. Oates, Mark Girolami, and Nicolas Chopin. Control functionals for M onte C arlo integration. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 79 0 (3): 0 695--718, 2017

    2017

  53. [61]

    Optimum bounds for the distributions of martingales in B anach spaces

    Iosif Pinelis. Optimum bounds for the distributions of martingales in B anach spaces. The Annals of Probability, 22 0 (4): 0 1679--1706, 1994

    1994

  54. [62]

    Random features for large-scale kernel machines

    Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 20, pages 1177--1184. Curran Associates, Inc., 2007

    2007

  55. [63]

    Less is more: Nystr \"o m computational regularization

    Alessandro Rudi, Raffaello Camoriano, and Lorenzo Rosasco. Less is more: Nystr \"o m computational regularization. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems ( NeurIPS ) , volume 28, pages 1657--16...

    2015

  56. [64]

    Schilling

    Mark F. Schilling. Goodness of fit testing in R m based on the weighted empirical distribution of certain nearest neighbor statistics. The Annals of Statistics, 11 0 (1): 0 1--12, 1983 a

    1983

  57. [65]

    Schilling

    Mark F. Schilling. An infinite-dimensional approximation for nearest neighbor goodness of fit tests. The Annals of Statistics, 11 0 (1): 0 13--24, 1983 b

    1983

  58. [66]

    KSD aggregated goodness-of-fit test

    Antonin Schrab, Benjamin Guedj, and Arthur Gretton. KSD aggregated goodness-of-fit test. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 35, pages 32624--32638. Curran Associates...

    2022

  59. [67]

    Efficient aggregated kernel tests using incomplete U -statistics

    Antonin Schrab, Ilmun Kim, Benjamin Guedj, and Arthur Gretton. Efficient aggregated kernel tests using incomplete U -statistics. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, editors, Advances in Neural Information Processing Systems ( NeurIPS ) , volum...

    2022

  60. [68]

    A kernel test for three-variable interactions

    Dino Sejdinovic, Arthur Gretton, and Wicher Bergsma. A kernel test for three-variable interactions. In C.J. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K.Q. Weinberger, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 26, pages 1124--1132. Cur...

    2013

  61. [69]

    Equivalence of distance-based and RKHS -based statistics in hypothesis testing

    Dino Sejdinovic, Bharath Sriperumbudur, Arthur Gretton, and Kenji Fukumizu. Equivalence of distance-based and RKHS -based statistics in hypothesis testing. Annals of Statistics, 41 0 (5): 0 2263--2291, 2013 b

    2013

  62. [70]

    Serfling

    Robert J. Serfling. Approximation Theorems of Mathematical Statistics. John Wiley & Sons, 1980

    1980

  63. [71]

    Mathematical Statistics

    Jun Shao. Mathematical Statistics. Springer, second edition, 2003

    2003

  64. [72]

    Learning theory estimates via integral operators and their approximations

    Steve Smale and Ding-Xuan Zhou. Learning theory estimates via integral operators and their approximations. Constructive Approximation, 26 0 (2): 0 153--172, 2007

    2007

  65. [73]

    Nikolai V. Smirnov. Table for estimating the goodness of fit of empirical distributions. Annals of Mathematical Statistics, 19: 0 279--281, 1948

    1948

  66. [74]

    A H ilbert space embedding for distributions

    Alexander Smola, Arthur Gretton, Le Song, and Bernhard Sch \"o lkopf. A H ilbert space embedding for distributions. In Marcus Hutter, Rocco A. Servedio, and Eiji Takimoto, editors, Algorithmic Learning Theory (ALT), pages 13--31. Springer, 2007

    2007

  67. [75]

    Hilbert space embeddings and metrics on probability measures

    Bharath Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Bernhard Sch \"o lkopf, and Gert Lanckriet. Hilbert space embeddings and metrics on probability measures. Journal of Machine Learning Research, 11 0 (50): 0 1517--1561, 2010

    2010

  68. [76]

    Sriperumbudur and Nicholas Sterge

    Bharath K. Sriperumbudur and Nicholas Sterge. Approximate kernel PCA : Computational versus statistical trade-off. The Annals of Statistics, 50 0 (5): 0 2713--2736, 2022

    2022

  69. [77]

    Sriperumbudur and Zolt \'a n Szab \'o

    Bharath K. Sriperumbudur and Zolt \'a n Szab \'o . Optimal rates for random F ourier features. In C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 28, pages 1144--1152. Curran Associates, ...

    2015

  70. [78]

    A bound for the error in the normal approximation to the distribution of a sum of dependent random variables

    Charles Stein. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In Berkeley Symposium on Mathematical Statistics and Probability, pages 583--602. Univ. California Press, Berkeley, CA, 1972

    1972

  71. [79]

    Support Vector Machines

    Ingo Steinwart and Andreas Christmann. Support Vector Machines. Springer, 2008

    2008

  72. [80]

    Mercer's theorem on general domains: On the interaction between measures, kernels, and RKHS s

    Ingo Steinwart and Clint Scovel. Mercer's theorem on general domains: On the interaction between measures, kernels, and RKHS s. Constructive Approximation, 35 0 (3): 0 363--417, 2012

    2012

  73. [81]

    Sriperumbudur

    Zolt \'a n Szab \'o and Bharath K. Sriperumbudur. On kernel derivative approximation with random F ourier features. In Kamalika Chaudhuri and Masashi Sugiyama, editors, International Conference on Artificial Intelligence and Statistics (AISTATS), volume 89, pages 827--836. PMLR, 2019

    2019

  74. [82]

    Testing for equal distributions in high dimension

    G \'a bor Sz \'e kely and Maria Rizzo. Testing for equal distributions in high dimension. InterStat, 5: 0 1249--1272, 2004

    2004

  75. [83]

    A new test for multivariate normality

    G \'a bor Sz \'e kely and Maria Rizzo. A new test for multivariate normality. Journal of Multivariate Analysis, 93 0 (1): 0 58--80, 2005

    2005

  76. [84]

    Weak Convergence and Empirical Processes: With Applications to Statistics

    Aad van der Vaart and Jon Wellner. Weak Convergence and Empirical Processes: With Applications to Statistics. Springer, 1996

    1996

  77. [85]

    van der Vaart

    Aad W. van der Vaart. Asymptotic Statistics. Cambridge University Press, 1998

    1998

  78. [86]

    High-Dimensional Probability

    Roman Vershynin. High-Dimensional Probability. Cambridge University Press, 2018

    2018

  79. [87]

    Using the N ystr \" o m method to speed up kernel machines

    Christopher Williams and Matthias Seeger. Using the N ystr \" o m method to speed up kernel machines. In T. Leen, T. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems (NeurIPS), volume 13, pages 682--688. MIT Press, 2001

    2001

  80. [88]

    Kasprzak, and Andrew B

    George Wynne, Miko aj J. Kasprzak, and Andrew B. Duncan. A F ourier representation of kernel S tein discrepancy with application to goodness-of-fit tests for measures on infinite dimensional H ilbert spaces. Bernoulli, 31 0 (2): 0 868--893, 2025

    2025

  81. [89]

    A S tein goodness-of-fit test for directional distributions

    Wenkai Xu and Takeru Matsuda. A S tein goodness-of-fit test for directional distributions. In Silvia Chiappa and Roberto Calandra, editors, International Conference on Artificial Intelligence and Statistics (AISTATS), volume 108, pages 320--330. PMLR, 2020

    2020

  82. [90]

    Interpretable S tein goodness-of-fit tests on R iemannian manifold

    Wenkai Xu and Takeru Matsuda. Interpretable S tein goodness-of-fit tests on R iemannian manifold. In Marina Meila and Tong Zhang, editors, International Conference on Machine Learning (ICML) , volume 139, pages 11502--11513. PMLR, 2021

    2021

  83. [91]

    A S tein goodness-of-test for exponential random graph models

    Wenkai Xu and Gesine Reinert. A S tein goodness-of-test for exponential random graph models. In Arindam Banerjee and Kenji Fukumizu, editors, International Conference on Artificial Intelligence and Statistics ( AISTATS ) , volume 130, pages 415--423. PMLR, 2021

    2021

  84. [92]

    Goodness-of-fit testing for discrete distributions via S tein discrepancy

    Jiasen Yang, Qiang Liu, Vinayak Rao, and Jennifer Neville. Goodness-of-fit testing for discrete distributions via S tein discrepancy. In Jennifer Dy and Andreas Krause, editors, International Conference on Machine Learning ( ICML ) , volume 80, pages 5561--5570. PMLR, 2018

    2018

  85. [93]

    Rao, and Jennifer Neville

    Jiasen Yang, Vinayak A. Rao, and Jennifer Neville. A Stein - Papangelou goodness-of-fit test for point processes. In Kamalika Chaudhuri and Masashi Sugiyama, editors, International Conference on Artificial Intelligence and Statistics ( AISTATS ) , pages 226--235. PMLR, 2019

    2019

  86. [94]

    Sums and G aussian Vectors

    Vadim Yurinsky. Sums and G aussian Vectors . Springer, 1995

    1995

  87. [95]

    Zinger, A

    A. Zinger, A. Kakosyan, and L. Klebanov. A characterization of distributions by mean values of statistics and certain probabilistic metrics. Journal of Soviet Mathematics, 59 0 (4): 0 914--920, 1992

    1992

  88. [96]

    Zolotarev

    V. Zolotarev. Probability metrics. Theory of Probability and its Applications, 28: 0 278--302, 1983

    1983

Pith tools

Reviewed June 29, 2026 · model on record in the stance chip above.