FastMMD:有效两样本检验的圆形离散的扩充
FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test
摘要:
最大平均差异(MMD)是最近提出的两样本检验统计量。然而,它的二次时间复杂度,极大地阻碍了其大规模应用的可用性。为了加速MMD计算,在这项研究中,我们提出了一种高效的方法称为FastMMD。FastMMD的核心思想是基于Bochner定理和傅立叶变换将具有移位不变核的MMD等效地变换为正弦分量的线性组合的幅度期望(Rahimi & Recht,2007)。FastMMD算法利用傅立叶变换的采样特性,将MMD计算的时间复杂度从$O(N^2 d)$降低到$O(L N d)$,其中$N$和$d$分别是样本集的大小和维数。这里,$L$是用于确定近似精度的近似核的基函数的数量。对于球形不变的内核,可以通过使用Fastfood技术将计算进一步加速到$O(L N \log d)$(Le等人,2013年)的报告。在无偏估计和有偏估计下,我们的方法的一致收敛性也得到了理论证明。我们进一步提供了我们的方法的几何解释,即集合的圆形差异,这有助于我们理解MMD的洞察力,并希望有助于引起更广泛的衡量两个样本的测试。实验结果表明,FastMMD具有与精确MMD相似的精度,而与现有的MMD近似方法相比,具有更快的计算速度和更低的方差。
英文摘要:
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 $O(N^2 d)$ to $O(L N d)$, where $N$ and $d$ are the size and dimension of the sample set, respectively. Here $L$ is the number of basis functions for approximating kernels which determines the approximation accuracy. For kernels that are spherically invariant, the computation can be further accelerated to $O(L N \log d)$ by using the Fastfood technique (Le et al., 2013). The uniform convergence of our method has also been theoretically proved in both unbiased and biased estimates. We have further provided a geometric explanation for our method, namely ensemble of circular discrepancy, which facilitates us to understand the insight of MMD, and is hopeful to help arouse more extensive metrics for assessing two-sample test. Experimental results substantiate that FastMMD is with similar accuracy as exact MMD, while with faster computation speed and lower variance than the existing MMD approximation methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。