arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.04426math.OC
收藏

半定规划的低秩同步方法与社区检测

On the low-rank approach for semidefinite programs arising in synchronization and community detection

Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski

摘要:

为了解决困难的最优化问题,基于半定规划的凸松弛算法在许多领域都很常见。虽然可以在多项式时间内求解,但大型半定程序往往在计算上具有挑战性。十多年前,利用在许多感兴趣的应用中所需的解决方案是低秩的这一事实,Burer和Monteiro提出了一种启发式算法,通过将搜索空间限制在低秩矩阵来解决这种半定规划。伴随的理论并不能解释实证成功的程度。我们专注于同步和社区检测问题,并提供理论保证,揭示这种启发式的显着效率。

英文摘要:

To address difficult optimization problems, convex relaxations based on semidefinite programming are now common place in many fields. Although solvable in polynomial time, large semidefinite programs tend to be computationally challenging. Over a decade ago, exploiting the fact that in many applications of interest the desired solutions are low rank, Burer and Monteiro proposed a heuristic to solve such semidefinite programs by restricting the search space to low-rank matrices. The accompanying theory does not explain the extent of the empirical success. We focus on Synchronization and Community Detection problems and provide theoretical guarantees shedding light on the remarkable efficiency of this heuristic.

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

↑