arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.16613stat.MLcs.CCcs.DScs.LG
收藏

在KS阈值附近通过节点鲁棒算法实现最优社区检测率

Rate-optimal community detection near the KS threshold via node-robust algorithms

ETH Zürich(苏黎世联邦理工学院);Princeton University(普林斯顿大学)

Jingqiu Ding, Yiding Hua, Kasper Lindberg, David Steurer, Aleksandr Storozhenko

AI总结:

本文提出了一种多项式时间算法,在KS阈值附近实现最优社区检测率,通过鲁棒化多数投票和新型图二分算法改进了误分类率。

摘要:

我们研究了对称k-随机块模型中的社区检测问题,其中n个节点被均等地分成k个簇,簇内和簇间连接概率分别为p和q。我们的主要结果是一个多项式时间算法,能够实现最小最大最优误分类率exp(-(1±o(1))C/k),其中C=(sqrt(pn)-sqrt(qn))²,当C≥Kk²logk(K为通用常数)时,该结果与Kesten-Stigum(KS)阈值相差一个logk因子。值得注意的是,即使在对手篡改η≤exp(-(1±o(1))C/k)分数的节点的情况下,该速率仍然成立。据我们所知,最小最大速率之前只能通过计算效率低的程序[ZZ15]或需要严格更强假设的多项式时间算法[GMZZ17]实现。在节点鲁棒设置中,已知的最佳算法需要显著更强的条件C≥Kk¹⁰²[LM22]。我们的结果通过提供第一个多项式时间算法,实现了在两种设置中接近KS阈值的最小最大速率。我们的工作有两个关键技术贡献:(1)我们通过求和平方框架鲁棒化多数投票;(2)我们开发了一种新的图二分算法,通过鲁棒多数投票,使初始估计在KS阈值附近的误分类率显著提高到1/poly(k)。

英文摘要:

We study community detection in the \emph{symmetric $k$-stochastic block model}, where $n$ nodes are evenly partitioned into $k$ clusters with intra- and inter-cluster connection probabilities $p$ and $q$, respectively. Our main result is a polynomial-time algorithm that achieves the minimax-optimal misclassification rate \begin{equation*} \exp \Bigl(-\bigl(1 \pm o(1)\bigr) \tfrac{C}{k}\Bigr), \quad \text{where } C = (\sqrt{pn} - \sqrt{qn})^2, \end{equation*} whenever $C \ge K\,k^2\,\log k$ for some universal constant $K$, matching the Kesten--Stigum (KS) threshold up to a $\log k$ factor. Notably, this rate holds even when an adversary corrupts an $η\le \exp\bigl(- (1 \pm o(1)) \tfrac{C}{k}\bigr)$ fraction of the nodes. To the best of our knowledge, the minimax rate was previously only attainable either via computationally inefficient procedures [ZZ15] or via polynomial-time algorithms that require strictly stronger assumptions such as $C \ge K k^3$ [GMZZ17]. In the node-robust setting, the best known algorithm requires the substantially stronger condition $C \ge K k^{102}$ [LM22]. Our results close this gap by providing the first polynomial-time algorithm that achieves the minimax rate near the KS threshold in both settings. Our work has two key technical contributions: (1) we robustify majority voting via the Sum-of-Squares framework, (2) we develop a novel graph bisection algorithm via robust majority voting, which allows us to significantly improve the misclassification rate to $1/\mathrm{poly}(k)$ for the initial estimation near the KS threshold.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑