arXiv:2502.20755math.STcs.LG2025-02被引 4

用随机傅里叶特征实现高效且最优的两样本检验

Minimax Optimal Kernel Two-Sample Tests with Random Features

  • 基于随机傅里叶特征近似核方法,降低计算复杂度
  • 在特征数量足够时保持统计最优性,误差可忽略
  • 自适应调参+置换检验,适合大规模数据应用

再生核希尔伯特空间(RKHS)对概率分布的嵌入已通过最大均值差异(MMD)成为处理一般(非欧几里得)域上分布假设检验的有效手段。尽管已有大量研究,但近期才构建出结合均值项与正则化协方差算子的最小最大最优两样本检验。然而,如同大多数核算法,该方法在样本量上呈立方级增长,限制了其应用。本文提出一种基于随机傅里叶特征(RFF)近似的谱正则化两样本检验,研究统计最优性与计算效率之间的权衡。我们证明:当RFF近似阶数足够大(取决于似然比光滑性和积分算子特征值衰减速率)时,所提检验为最小最大最优。进一步设计了一种可实践的置换检验版本,并采用数据自适应策略选择正则化参数。在模拟与基准数据集上的数值实验表明,该RFF方法计算高效,性能几乎与精确测试相当(仅略有功率下降)。

原文摘要 · Abstract (English)

Reproducing Kernel Hilbert Space (RKHS) embedding of probability distributions has proved to be an effective approach, via MMD (maximum mean discrepancy), for nonparametric hypothesis testing problems involving distributions defined over general (non-Euclidean) domains. While a substantial amount of work has been done on this topic, only recently have minimax optimal two-sample tests been constructed that incorporate, unlike MMD, both the mean element and a regularized version of the covariance operator. However, as with most kernel algorithms, the optimal test scales cubically in the sample size, limiting its applicability. In this paper, we propose a spectral-regularized two-sample test based on random Fourier feature (RFF) approximation and investigate the trade-offs between statistical optimality and computational efficiency. We show the proposed test to be minimax optimal if the approximation order of RFF (which depends on the smoothness of the likelihood ratio and the decay rate of the eigenvalues of the integral operator) is sufficiently large. We develop a practically implementable permutation-based version of the proposed test with a data-adaptive strategy for selecting the regularization parameter. Finally, through numerical experiments on simulated and benchmark datasets, we demonstrate that the proposed RFF-based test is computationally efficient and performs almost similarly (with a small drop in power) to the exact test.

两样本检验随机特征统计最优核方法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。