FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test
Ji Zhao, Deyu Meng

TL;DR
FastMMD introduces an efficient Fourier-based approach to accelerate the two-sample MMD test, reducing computational complexity significantly while maintaining accuracy, enabling large-scale applications.
Contribution
This paper proposes FastMMD, a novel Fourier transform-based method that speeds up MMD calculations and provides theoretical guarantees and geometric insights.
Findings
FastMMD reduces MMD computation from quadratic to linear or near-linear time.
FastMMD maintains similar accuracy to exact MMD in experiments.
FastMMD has lower variance and faster speed compared to existing approximations.
Abstract
The maximum mean discrepancy (MMD) is a recently proposed test statistic for two-sample test. Its quadratic time complexity, however, greatly hampers its availability to large-scale applications. To accelerate the MMD calculation, in this study we propose an efficient method called FastMMD. The core idea of FastMMD is to equivalently transform the MMD with shift-invariant kernels into the amplitude expectation of a linear combination of sinusoid components based on Bochner's theorem and Fourier transform (Rahimi & Recht, 2007). Taking advantage of sampling of Fourier transform, FastMMD decreases the time complexity for MMD calculation from to , where and are the size and dimension of the sample set, respectively. Here is the number of basis functions for approximating kernels which determines the approximation accuracy. For kernels that are spherically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
