English

A Higher-Order Kolmogorov-Smirnov Test

Machine Learning 2019-03-26 v1 Machine Learning

Abstract

We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order total variation ball, recovering the original KS test as its simplest case. We give an exact representer result for our IPM, which generalizes the fact that the original KS test statistic can be expressed in equivalent variational and CDF forms. For small enough orders (k5k \leq 5), we develop a linear-time algorithm for computing our higher-order KS test statistic; for all others (k6k \geq 6), we give a nearly linear-time approximation. We derive the asymptotic null distribution for our test, and show that our nearly linear-time approximation shares the same asymptotic null. Lastly, we complement our theory with numerical studies.

Keywords

Cite

@article{arxiv.1903.10083,
  title  = {A Higher-Order Kolmogorov-Smirnov Test},
  author = {Veeranjaneyulu Sadhanala and Yu-Xiang Wang and Aaditya Ramdas and Ryan J. Tibshirani},
  journal= {arXiv preprint arXiv:1903.10083},
  year   = {2019}
}

Comments

18 pages, AISTATS 2019

R2 v1 2026-06-23T08:17:38.795Z