低度多项式下界用于中等维度下的聚类
Low-degree Lower bounds for clustering in moderate dimension
AI总结:
本文研究了中等维度下聚类问题的低度多项式下界,提出了一种非谱算法,揭示了中等维度下聚类的计算限制。
摘要:
我们研究将n个点划分为K组的问题,这些组来自实数空间R^d中的各向同性高斯混合分布。具体来说,我们研究均值向量之间所需的最小距离Δ,以部分恢复底层划分。虽然Δ的最小化最优阈值已得到充分确立,但该信息论极限与已知多项式时间程序的性能之间存在显著差距。尽管这个差距最近在高维情形(n ≤ dK)中得到了表征,但在中等维度情形(n ≥ dK)中仍鲜有探索。在本文中,我们通过建立新的低度多项式下界来处理这一情形,当d ≥ K时。我们证明,当n ≤ dK时,聚类的困难主要由维度降低和谱方法驱动,而中等维度情形则涉及更微妙的现象,导致“非参数率”。我们提供了一种新的非谱算法,以匹配这一速率,为中等维度下聚类问题的计算限制提供了新的见解。
英文摘要:
We study the fundamental problem of clustering $n$ points into $K$ groups drawn from a mixture of isotropic Gaussians in $\mathbb{R}^d$. Specifically, we investigate the requisite minimal distance $Δ$ between mean vectors to partially recover the underlying partition. While the minimax-optimal threshold for $Δ$ is well-established, a significant gap exists between this information-theoretic limit and the performance of known polynomial-time procedures. Although this gap was recently characterized in the high-dimensional regime ($n \leq dK$), it remains largely unexplored in the moderate-dimensional regime ($n \geq dK$). In this manuscript, we address this regime by establishing a new low-degree polynomial lower bound for the moderate-dimensional case when $d \geq K$. We show that while the difficulty of clustering for $n \leq dK$ is primarily driven by dimension reduction and spectral methods, the moderate-dimensional regime involves more delicate phenomena leading to a "non-parametric rate". We provide a novel non-spectral algorithm matching this rate, shedding new light on the computational limits of the clustering problem in moderate dimension.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。