The reviewed record of science sign in
Pith

arxiv: 2006.02286 · v3 · pith:WTHNAN7O · submitted 2020-06-03 · cs.LG · stat.ML

Learning Kernel Tests Without Data Splitting

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WTHNAN7Orecord.jsonopen to challenge →

classification cs.LG stat.ML
keywords testapproachdatasplittingsamplediscrepancyhyperparameterskernel
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.