在认证的小集合扩展器上玩独特的游戏
Playing Unique Games on Certified Small-Set Expanders
摘要:
我们给出了一个算法,用于解决独特的游戏(UG)的情况下,只要低程度的平方和证明良好的边界上的小集合扩展的基础约束图通过超压缩不等式。我们的算法实际上是更通用的,即使当约束图不是一个小集扩展器,只要非扩展的小集的结构(非正式地说)的“特征”是由一个低程度的平方和证明成功。我们的结果是通过四舍五入\emph{low-entropy}解决方案-通过一个新的全球潜在的功能-平方和(SoS)半定方案。这项技术增加了(目前很短)的一般工具列表,用于分析\emph{worst-case}优化问题的SoS松弛。作为推论,我们得到的第一个多项式时间的算法,用于解决任何UG实例中的约束图是\emph{noisy hypercube},\emph{short code}或\emph{Johnson}图。这种情况下的最佳先验算法是Arora、Barak和Steurer(2010)的特征值枚举算法,其对于噪声超立方体需要准多项式时间,对于短码和Johnson图需要近指数时间。我们所有的结果实现了近似的$1-ε$与$δ$ UG实例,其中$ε>0$和$δ> 0$依赖于图的扩展参数,但独立的字母表的大小。
英文摘要:
We give an algorithm for solving unique games (UG) instances whenever low-degree sum-of-squares proofs certify good bounds on the small-set-expansion of the underlying constraint graph via a hypercontractive inequality. Our algorithm is in fact more versatile, and succeeds even when the constraint graph is not a small-set expander as long as the structure of non-expanding small sets is (informally speaking) "characterized" by a low-degree sum-of-squares proof. Our results are obtained by rounding \emph{low-entropy} solutions -- measured via a new global potential function -- to sum-of-squares (SoS) semidefinite programs. This technique adds to the (currently short) list of general tools for analyzing SoS relaxations for \emph{worst-case} optimization problems. As corollaries, we obtain the first polynomial-time algorithms for solving any UG instance where the constraint graph is either the \emph{noisy hypercube}, the \emph{short code} or the \emph{Johnson} graph. The prior best algorithm for such instances was the eigenvalue enumeration algorithm of Arora, Barak, and Steurer (2010) which requires quasi-polynomial time for the noisy hypercube and nearly-exponential time for the short code and Johnson graphs. All of our results achieve an approximation of $1-ε$ vs $δ$ for UG instances, where $ε>0$ and $δ> 0$ depend on the expansion parameters of the graph but are independent of the alphabet size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。