唯一对策的谱算法
Spectral Algorithms for Unique Games
摘要:
我们给出了一个新的算法,独特的游戏,这是纯粹的{\em频谱}技术的基础上,在该领域的以前的工作,这在很大程度上依赖于半定规划(SDP)。给定一个高度可满足的独特游戏实例,我们的算法能够恢复一个很好的分配。近似保证仅取决于游戏的完整性,而不是字母表的大小,而运行时间取决于与唯一游戏的实例相关联的{\em Label-Extended}图的谱属性。我们进一步证明了在输入Khot和Vishnoi的完整性缺口实例时,我们的算法在准多项式时间内运行,并判定该实例是高度不可满足的。值得注意的是,当在该实例上运行时,Unique Games {\em}的标准SDP松弛失败。作为特殊情况,我们还重新推导了一个多项式时间算法的唯一游戏的扩展约束图。我们的算法的主要成分是一种技术,有效地使用底层图的全谱,而不仅仅是第二个特征值,这是独立的利益。如何在算法设计中利用图的全谱的问题经常被研究,但在此之前没有取得重大进展。
英文摘要:
We give a new algorithm for Unique Games which is based on purely {\em spectral} techniques, in contrast to previous work in the area, which relies heavily on semidefinite programming (SDP). Given a highly satisfiable instance of Unique Games, our algorithm is able to recover a good assignment. The approximation guarantee depends only on the completeness of the game, and not on the alphabet size, while the running time depends on spectral properties of the {\em Label-Extended} graph associated with the instance of Unique Games. We further show that on input the integrality gap instance of Khot and Vishnoi, our algorithm runs in quasi-polynomial time and decides that the instance if highly unsatisfiable. Notably, when run on this instance, the standard SDP relaxation of Unique Games {\em fails}. As a special case, we also re-derive a polynomial time algorithm for Unique Games on expander constraint graphs. The main ingredient of our algorithm is a technique to effectively use the full spectrum of the underlying graph instead of just the second eigenvalue, which is of independent interest. The question of how to take advantage of the full spectrum of a graph in the design of algorithms has been often studied, but no significant progress was made prior to this work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。