arXiv Machine Learning July 10, 2026 By Aaron Wei, Milad Jalali, Danica J. Sutherland

Maximum Mean Discrepancy with Unequal Sample Sizes via Generalized U-Statistics

Read the original on arXiv Machine Learning →

arXiv:2512. 13997v2 Announce Type: replace-cross Abstract: Existing two-sample testing techniques, particularly those based on choosing a kernel for the Maximum Mean Discrepancy (MMD), often assume equal sample sizes from the two distributions.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 9

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?

By Zhijian Zhou, Liuhua Peng, Xunye Tian, Mingming Gong, Feng Liu

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

arXiv Machine Learning

Jul 23

Directional Kernel Mean Difference: A Fast Signed Statistic for Univariate Distribution Comparison

arXiv:2607. 20119v1 Announce Type: cross Abstract: We introduce the Directional Kernel Mean Difference (DKMD), a signed statistic for univariate distribution comparison that preserves the direction of distributional shifts.

By Shijie Zhong, Jiangfeng Fu

rag benchmarks

arXiv Machine Learning

1d ago

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds

arXiv:2504. 19952v2 Announce Type: replace-cross Abstract: We present two general lower bounds for stopping times of sequential tests between arbitrary composite nulls $\mathcal P$ and alternatives $\mathcal Q$.

By Shubhada Agrawal, Ashwin Ram, Aaditya Ramdas

arXiv Machine Learning

Jun 26

No Free Lunch: Non-Asymptotic Analysis of Prediction-Powered Inference

arXiv:2505. 20178v2 Announce Type: replace-cross Abstract: Prediction-Powered Inference (PPI) is a popular strategy for combining gold-standard and possibly noisy pseudo-labels to perform statistical estimation.

By Pranav Mani, Peng Xu, Zachary C. Lipton, Michael Oberst

arXiv Machine Learning

Jun 2

Approximating $f$-Divergences with Rank Statistics

arXiv:2601. 22784v2 Announce Type: replace-cross Abstract: We introduce a rank-statistic approximation of $f$-divergences that avoids explicit density-ratio estimation by working directly with the distribution of ranks.

By Viktor Stein, Jos\'e Manuel de Frutos

benchmarks

Related stories

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

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

Directional Kernel Mean Difference: A Fast Signed Statistic for Univariate Distribution Comparison

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds

No Free Lunch: Non-Asymptotic Analysis of Prediction-Powered Inference

Approximating $f$-Divergences with Rank Statistics