ITMLAug 27, 2019

Asymptotically Optimal One- and Two-Sample Testing with Kernels

arXiv:1908.10037v211 citations
AI Analysis

This work provides theoretical guarantees for optimal testing in universal settings, which is incremental but important for statistical hypothesis testing and applications like change detection.

The paper characterizes the asymptotic performance of nonparametric one- and two-sample testing using error exponents, showing that certain Maximum Mean Discrepancy (MMD) and Kernel Stein Discrepancy (KSD) based tests achieve optimal type-II error exponents under constraints.

We characterize the asymptotic performance of nonparametric one- and two-sample testing. The exponential decay rate or error exponent of the type-II error probability is used as the asymptotic performance metric, and an optimal test achieves the maximum rate subject to a constant level constraint on the type-I error probability. With Sanov's theorem, we derive a sufficient condition for one-sample tests to achieve the optimal error exponent in the universal setting, i.e., for any distribution defining the alternative hypothesis. We then show that two classes of Maximum Mean Discrepancy (MMD) based tests attain the optimal type-II error exponent on $\mathbb R^d$, while the quadratic-time Kernel Stein Discrepancy (KSD) based tests achieve this optimality with an asymptotic level constraint. For general two-sample testing, however, Sanov's theorem is insufficient to obtain a similar sufficient condition. We proceed to establish an extended version of Sanov's theorem and derive an exact error exponent for the quadratic-time MMD based two-sample tests. The obtained error exponent is further shown to be optimal among all two-sample tests satisfying a given level constraint. Our work hence provides an achievability result for optimal nonparametric one- and two-sample testing in the universal setting. Application to off-line change detection and related issues are also discussed.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes