# Playing Unique Games on Certified Small-Set Expanders

We give an algorithm for solving unique games (UG) instances whose constraints correspond to edges of graphs with a sum-of-squares (SoS) small-set-expansion certificate. As corollaries, we obtain the first polynomial-time algorithms for solving UG on the noisy hypercube and the short code graphs. 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 graph. All of our results achieve an approximation of 1-ϵ vs δ for UG instances, where δ > 0 depends on the expansion parameters of the graph but is independent of the alphabet size. Specifically, say that a regular graph G=(V,E) is a (μ,η) small-set expander (SSE) if for every subset S ⊆ V with |S| ≤μ |V|, the edge-expansion of S is at least η. We say that G is a d-certified (μ,η)-SSE if there is a degree-d SoS certificate for this fact (based on 2 to 4 hypercontractivity). We prove that there is a |V|^f(d,μ,η) time algorithm A (based on the SoS hierarchy) such that for every η>0 and d-certified (μ, η)-SSE G, if I is a 1-η^2/100 satisfiable affine UG instance over G then A(I) is an assignment satisfying at least some positive fraction δ = δ(μ,η) of I's constraints. As a corollary, we get a polynomial-time algorithm A such that if I is a 1-ϵ satisfiable instance over the α-noisy hypercube or short code graph, then A(I) outputs an assignment satisfying an (-O(√(ϵ)/α)) fraction of the constraints. Our techniques can be extended even to graphs that are not SSE, and in particular we obtain a new efficient algorithm for solving UG instances over the Johnson graph.

READ FULL TEXT