A Kernel Method for the Two-Sample Problem
Arthur Gretton, Karsten Borgwardt, Malte J. Rasch, Bernhard Scholkopf, Alexander J. Smola
TL;DR
The paper tackles the two-sample problem by introducing the Maximum Mean Discrepancy (MMD), a kernel-based statistic that measures distribution differences via RKHS mean embeddings. It develops three nonparametric tests: two with finite-sample guarantees from uniform convergence bounds and a third based on the asymptotic distribution, along with a linear-time variant for large-scale data. The framework unifies classical distribution metrics and extends to high-dimensional and structured domains such as graphs, enabling robust, scalable hypothesis testing without density estimation. Empirical results in data integration and related domains demonstrate strong performance and practical applicability of MMD-based tests across diverse data types.
Abstract
We propose a framework for analyzing and comparing distributions, allowing us to design statistical tests to determine if two samples are drawn from different distributions. Our test statistic is the largest difference in expectations over functions in the unit ball of a reproducing kernel Hilbert space (RKHS). We present two tests based on large deviation bounds for the test statistic, while a third is based on the asymptotic distribution of this statistic. The test statistic can be computed in quadratic time, although efficient linear time approximations are available. Several classical metrics on distributions are recovered when the function space used to compute the difference in expectations is allowed to be more general (eg. a Banach space). We apply our two-sample tests to a variety of problems, including attribute matching for databases using the Hungarian marriage method, where they perform strongly. Excellent performance is also obtained when comparing distributions over graphs, for which these are the first such tests.
