arXiv Machine Learning

Are Two Datasets Close Enough With Statistical Significance? A Kernel Distributional Closeness Testing Approach

arXiv:2507. 12843v3 Announce Type: replace Abstract: Are two distributions close to each other with statistical significance?

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
arXiv Machine Learning
Jun 29

Efficient and Stable Multi-Dimensional Kolmogorov-Smirnov Distance

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.

By Peter Matthew Jacobs, Foad Namjoo, Jeff M. Phillips
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
arXiv Machine Learning
Jun 25

Logit Distance Bounds Representational Similarity

arXiv:2602. 15438v3 Announce Type: replace Abstract: For a broad family of discriminative models that includes autoregressive language models, identifiability results imply that if two models induce the same conditional distributions, then their internal representations are equal up to an invertible linear transformation.

By Beatrix M. G. Nielsen, Emanuele Marconato, Luigi Gresele, Andrea Dittadi, Simon Buchholz