MLSTMESep 24, 2017

On the Optimality of Kernel-Embedding Based Goodness-of-Fit Tests

arXiv:1709.08148v130 citations
Originality Incremental advance
AI Analysis

This addresses statistical testing problems in arbitrary domains for researchers, offering an incremental improvement with theoretical guarantees.

The paper analyzes kernel-embedding based goodness-of-fit tests and finds that a vanilla version is suboptimal, proposing a moderated embedding approach that achieves optimality for various deviations and adaptivity over interpolation spaces.

The reproducing kernel Hilbert space (RKHS) embedding of distributions offers a general and flexible framework for testing problems in arbitrary domains and has attracted considerable amount of attention in recent years. To gain insights into their operating characteristics, we study here the statistical performance of such approaches within a minimax framework. Focusing on the case of goodness-of-fit tests, our analyses show that a vanilla version of the kernel-embedding based test could be suboptimal, and suggest a simple remedy by moderating the embedding. We prove that the moderated approach provides optimal tests for a wide range of deviations from the null and can also be made adaptive over a large collection of interpolation spaces. Numerical experiments are presented to further demonstrate the merits of our approach.

Foundations

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

Your Notes