← Back to all news
arXiv Machine Learning By Peter Matthew Jacobs, Foad Namjoo, Jeff M. Phillips

Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance

Read the original on arXiv Machine Learning →

arXiv:2504. 11299v2 Announce Type: replace-cross Abstract: We revisit extending the Kolmogorov-Smirnov distance between probability distributions to the multi-dimensional setting, and make new arguments about the proper way to approach this generalization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 28

Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

arXiv:2607. 24235v1 Announce Type: cross Abstract: Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others.

By Jose Cribeiro-Ramallo, Florian Kalinke, Zolt\'an Szab\'o
rag
More like this →
arXiv Machine Learning
Jul 20

Testing Distributions Against Bounded Distinguishers

arXiv:2607. 15645v1 Announce Type: cross Abstract: Motivated by the challenge of testing distributions over high-dimensional or continuous domains, we study distribution testing with respect to bounded classes of distinguishers.

By Mark Bun, Rathin Desai, Renato Ferreira Pinto Jr
More like this →
arXiv Machine Learning
Aug 18

The Observable Wasserstein Distance

arXiv:2605. 09916v2 Announce Type: replace-cross Abstract: We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal transport in large-scale, non-Euclidean datasets.

By Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio, Tom Needham
More like this →
arXiv Statistics ML
3d ago

PTED: A multi-dimensional two-sample test for scientific inference and generative machine learning

The article introduces PTED, a Python implementation of a permutation test based on the Energy Distance for two-sample testing in multiple dimensions. PTED uses pairwise distances to compute a test statistic that works in high dimensions, on learned feature representations, and for any data type where a distance can be defined. The authors demonstrate that PTED scales linearly with dimensions and sample size while retaining strong discriminative power, and show it outperforms other multi‑dimensional tests in sensitivity.

By Connor Stone
More like this →