通过SDP稳健地实现同步和块模型中的贝叶斯差错率
Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly
摘要:
研究了随机图模型下半定规划(SDP)松弛聚类的统计性能。在$\mathbb{Z}_{2}$同步模型,删失块模型和随机块模型下,我们证明了SDP实现了\[ \exp\Big[-\big(1-o(1)\big)\bar{n} I^* \Big]. \]形式的差错率这里$\bar{n}$是节点数的适当倍数,$I^*$是信噪比的信息论度量。我们提供匹配的下界的贝叶斯误差为每个模型,因此证明SDP方法是贝叶斯最优的。作为一个推论,我们的研究结果意味着,SDP达到最佳的精确恢复阈值下的每个模型。此外,我们证明了SDP是鲁棒的:在半随机版本的模型中,观察到的图被修改的单调对手的上述范围仍然有效。我们的证明是基于一个新的原始-对偶分析的SDP在一个统一的框架下,所有三个模型,分析表明,SDP紧密近似于一个联合多数表决程序。
英文摘要:
We study the statistical performance of semidefinite programming (SDP) relaxations for clustering under random graph models. Under the $\mathbb{Z}_{2}$ Synchronization model, Censored Block Model and Stochastic Block Model, we show that SDP achieves an error rate of the form \[ \exp\Big[-\big(1-o(1)\big)\bar{n} I^* \Big]. \] Here $\bar{n}$ is an appropriate multiple of the number of nodes and $I^*$ is an information-theoretic measure of the signal-to-noise ratio. We provide matching lower bounds on the Bayes error for each model and therefore demonstrate that the SDP approach is Bayes optimal. As a corollary, our results imply that SDP achieves the optimal exact recovery threshold under each model. Furthermore, we show that SDP is robust: the above bound remains valid under semirandom versions of the models in which the observed graph is modified by a monotone adversary. Our proof is based on a novel primal-dual analysis of SDP under a unified framework for all three models, and the analysis shows that SDP tightly approximates a joint majority voting procedure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。