mlsanityData to 7 Oct 2026

Learning Kernel Tests Without Data Splitting

arXiv 2006.02286 ↗First posted 3 Jun 2020cs.LG stat.MLcited by 19

Not on the map. Why?

Abstract (arXiv)

Modern large-scale kernel-based tests such as maximum mean discrepancy (MMD) and kernelized Stein discrepancy (KSD) optimize kernel hyperparameters on a held-out sample via data splitting to obtain the most powerful test statistics. While data splitting results in a tractable null distribution, it suffers from a reduction in test power due to smaller test sample size. Inspired by the selective inference framework, we propose an approach that enables learning the hyperparameters and testing on the full sample without data splitting. Our approach can correctly calibrate the test in the presence of such dependency, and yield a test threshold in closed form. At the same significance level, our approach's test power is empirically larger than that of the data-splitting approach, regardless of its split proportion.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 4; 2023: 5; 2024: 2; 2025: 3.

19 papers.

Sort: