1 / 42

Subhash Khot IAS Elchanan Mossel UC Berkeley

Hardness of approximating MAX CUT. Vol.2 Two Conjectures. Subhash Khot IAS Elchanan Mossel UC Berkeley. Guy Kindler DIMACS Ryan O’Donnell IAS. Our main theorem. Unique Games Conjecture + Majority Is Stablest Conjecture 

kagami
Download Presentation

Subhash Khot IAS Elchanan Mossel UC Berkeley

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Hardness of approximating MAX CUT Vol.2 Two Conjectures Subhash KhotIAS Elchanan MosselUC Berkeley Guy KindlerDIMACS Ryan O’DonnellIAS

  2. Our main theorem • Unique Games Conjecture • + • Majority Is Stablest Conjecture •  • It is NP-hard to approximate MAX-CUT to within any factor better than αGW = .878…

  3. Conjectures? What? • Usual modus operandi in Mathematics: • Prove theorem, give talk. • Non-usual modus operandi in Mathematics: • Fail to prove two theorems, give talk.

  4. Why this is still interesting • Part 1: The status of the conjectures

  5. Unique Games conjecture • [Khot ’02]: A certain graph-coloring problem is NP-hard. • A simple way to think about it: • MAX-2LIN(m) • Input: Some two-variable linear equations mod m=10⁶, over n variables. You are promised that there is an assignment satisfying 99% of them. • Goal: Find an assignment satisfying 1% of them. • Status of UGC: ???. It would be a pity if it were false.

  6. Majority Is Stablest conjecture • Roughly speaking: among all boolean functions in which each coordinate has “small influence,” the Majority function is least susceptible to noise in the input. • Status of MISC: Almost certainly true, we claim. • Preponderance of published evidence supports it • Preponderance of expert opinion supports it • We have some partial results

  7. How we want you tointerpret our result • “Beating Goemans-Williamson – i.e., approximating MAX-CUT to a factor .879 –is formally harder* than the problem ofsatisfying 1% of a given set of 99%-satisfiable two-variable linear equations mod 10⁶.” • So, Uri Zwick et al, • please work on this problem, • rather than this problem.

  8. Why this is still interesting • Part 2: More justification

  9. More justification • Natural, simple problem; no progress made on it in years. • Seemed as though there ought to be plenty of room for improving the GW algorithm. • αGW is a funny number. • Insight into the Unique Games Conjecture. • Fourier methods and results independently interesting. • Motivates algorithmic progress on other 2-variable CSPs: MAX-2SAT, MAX-2LIN(m), …

  10. Plan for the talk: • 1. Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • 3. Sketch proof of main theorem. • Evidence for Majority Is Stablest Conjecture. • Conclusions and open problems

  11. Plan for the talk: • 1.Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • 3. Sketch proof of main theorem. • Evidence for Majority Is Stablest Conjecture. • Conclusions and open problems

  12. πuv πuv πuv πuv n πuv πuv Bijections πuv πuv πuv πuv: πuv Unique Games Conjecture • “Unique Label Cover” with m colors: Labels [m] πuv Input

  13. πuv πuv πuv πuv n πuv πuv Bijections πuv πuv πuv πuv: πuv Unique Games Conjecture • “Unique Label Cover” with m colors: Labels [m] πuv Solution

  14. Unique Games Conjecture • Unique Games Conjecture [Khot ’02]: • “For every constant ε> 0, • there exists a constant m = m(ε) • such that • it is NP-hard to distinguish between • (1−ε)-satisfiable and ε-satisfiable • instances of Unique Label Cover with m labels.”

  15. Unique Games Conjecture • A strengthening of the PCP Theorem of AS+ALMSS+Raz • Implies hardness of MAX-2LIN(m). • Implies MIN-2SAT-Deletion hard to approximate to within any constant factor [Khot ’02, Håstad], Vertex-Cover hard to approximate to within any factor smaller than 2 [Khot-Regev ’03] • These results need an appropriate “Inner Verifier” – correctness follows from deep theorem in Fourier analysis. [Bourgain ’02; Friedgut ’98]

  16. Plan for the talk: • 1. Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • 3. Sketch proof of main theorem. • Discuss the Majority Is Stablest Conjecture. • Conclusions and open problems

  17. Majority Is Stablest Conjecture • Introduced formally by us in the present work. • A related conjecture was made in [G. Kalai ’02], a paper about “Social Choice” theory from economics. • Folkloric inklings of it have existed for a while. [Ben-Or-Linial ‘90, Benjamini-Kalai-Schramm ’98, Mossel-O. ’02, Bourgain ’02] • To state it, a few definitions are needed.

  18. Influences on boolean functions • Let f : {−1,1}ⁿ {−1,1} be a boolean function. • We view {−1,1}ⁿ as a probability space, uniform distribution. • Def: Let i  [n]. Pick x at random and let y be x with the ith bit flipped. The influence of i on f is • Infi(f)=Pr[f(x) ≠ f(y)].

  19. Influence examples • Let f be the Dictator function, f(x) = x1. Inf1(f)= 1, Infi(f)= 0 for all i ≠ 1. • Let f be the Parity function on n bits. Infi(f)= 1 for all i. • Let f be the Majority function on n bits. Infi(f)= + o(1) for all i. √2/π √n

  20. Noise sensitivity • Let −1 < ρ < 1. Given a string x, “applying ρ-noise” means:Pick y at random by choosing each coord. independently and w.p. s.t. E[xi yi] = ρ. (Hence E[x,y] = ρn.) • For ρ> 0, this means for each bit of x, leave it alone w.p. ρ, replace it with a random bit w.p. 1−ρ.[For ρ< 0, first set x = −x, ρ = −ρ, then do the above.] • Def: The noise sensitivity of f at ρ is • NSρ(f)=Pr[f(x) ≠ f(y)].

  21. Noise sensitivity examples • Let f be the Dictator function. NSρ(f) = ½ − ½ ρ. • Let f be the Parity function on n bits. NSρ(f)= ½ − ½ ρⁿ. • Let f be the Majority function on n bits. NSρ(f) = (arccos ρ)/π± o(1). [Central Lim. Th.]

  22. NS 1 ½ ρ −1 −.69 =:ρ* 0 1 • NSρ(Dict) = ½ − ½ ρ NSρ( Maj) = (arccos ρ)/π 87.8%

  23. Majority Is Stablest Conjecture • Conjecture: • “Fix 0 < ρ < 1. • Let f : {−1,1}ⁿ {−1,1} be any boolean function* satisfying • f is balanced: E[f] = 0; • f has small influences: Infi(f)< δfor all i. • Then • NSρ(f) ≥ (arccos ρ)/π − oδ(1).”

  24. Plan for the talk: • 1. Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • 3. Sketch proof of main theorem. • Evidence for Majority Is Stablest Conjecture. • Conclusions and open problems

  25. Sketch of the main theorem • The main theorem gives a (poly-time) reduction from Unique Label Cover to Gap-MAX-CUT. • The reduction is parameterized by −1 < ρ < 1. • (1−ε)-satisfiable ULC instances MAP TO: weighted graphs with cuts of weight ½ − ½ ρ− oε(1) • ε-satisfiable ULC instances MAP TO: weighted graphs with no cuts more than (arccos ρ)/π+ oε(1) • We choose our favorite ρ, viz. ρ*, and then MAX-CUT hardness is ratio of second quantity to first quantity.

  26. Sketch of the main theorem

  27. Sketch of the main theorem · · · (1,1,1) (1,1,−1) (−1,−1,−1) {−1,1}m

  28. fv fv πuv πuv fv fv fv fv fv fv fv fv Sketch of the main theorem

  29. Plan for the talk: • 1. Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • Sketch proof of main theorem. • 4. Evidence for Majority Is Stablest Conjecture. • 5. Conclusions and open problems.

  30. Noise stability • In working on the Majority Is Stablest Conjecture it is more convenient to work with a linear fcn. of noise sensitivity. • Def: The stability of f at ρ is • Sρ(f) = 1 − 2 NSρ(f). • Note: Sρ(f) = 1 − 2 Pr[f(x) ≠ f(y)] = 1 − 2 E[ ½ − ½ f(x)f(y) ] = E[f(x) f(y)].

  31. Sρ(Dict) = ρ Sρ( Maj) = (2/π) arcsin ρ S 1 ρ 0 −1 1 − 1

  32. Evidence for Maj. Is Stablest • Note that Majority is “Uniformly Stable” – for fixed ρ, as n∞, Sρ( Majorityn) is bounded away from 0. • On the other hand, Parity is “Asymptotically Sensitive” – for fixed ρ, as n∞, Sρ( Parityn) = ρⁿ 0. • The family of all boolean halfspaces – functions of the form sign(a1 x1 + · · · + an xn) – are Uniformly Stable ([BKS ’98, Peres ’98]), • and in fact more is true…

  33. Evidence for Maj. Is Stablest • [BKS ’98] shows that the set of boolean halfspaces “asymptotically span” the Uniformly Stable functions: • Uniformly Stable families of functions have Ω(1) correlation with the family of boolean halfspaces • (monotone) function families are Asymptotically Sensitive iff they are asymptotically orthogonal to the set of boolean halfspaces • Theorem [us]: The Majority Is Stablest Conjecture is true when restricted to the set of boolean halfspaces.

  34. Fourier detour • Any g : {−1,1}ⁿR can be expressed as a multilinear polynomial: • Def: For 0 ≤ k ≤ n, the weight of g at level k is • w(k) = Σĝ(S)² g(x) = ΣcS· Πxi g(x) = Σĝ(S)· Πxi S  [n] i S |S| = k

  35. Fourier facts • if g : {−1,1}ⁿ [−1,1], • Σkw(k) ≤ 1 (equality if {−1,1}) • if g is balanced (E[g] = 0), then w(0) = 0 • Infi(g) = Σĝ(S)² • Sρ(g) =Σkw(k) · ρk • “The more g’s weight is at lower levels, the stabler g is.” S i

  36. Maj. Is Stablest evidence • Conjecture [Kalai ’02]: The “symmetric” boolean-valued function [“symmetric” implies small influences] with most weight on levels 1… k is Majority. • Thm [Bourgain ’02]: Boolean-valued functions with small influences have at least as much weight beyond level k as Majority (asymptotically). • Thm [us]: Bounded functions with small influences have no more weight at level 1 than 2/π, precisely the weight of Majority at level 1.

  37. Corollary of our level-1 result • Weakened version of Majority Is Stablest Conjecture: • Thm: If f : {−1,1}ⁿ [−1,1] has small influences and ρ< 0, • NSρ(f) ≥ ½ − ρ/π− (½ − 1/π)ρ³ − o(1).

  38. NS 1 ½ ρ −1 0 1 −½ =:ρ* ¾ + 1/2π

  39. Corollary of our level-1 result • Weakened version of Majority Is Stablest Conjecture: • Thm: If f : {−1,1}ⁿ [−1,1] has small influences and ρ< 0, • NSρ(f) ≥ ½ − ρ/π− (½ − 1/π)ρ³ − o(1). • Cor: The Unique Games Conjecture implies it is NP-hard to approximate MAX-CUT to any factor larger than • ¾ + 1/2π = .909… < 16/17 = .941…

  40. Plan for the talk: • 1. Describe the Unique Games Conjecture. • 2. State the Majority Is Stablest Conjecture. • Sketch proof of main theorem. • 4. Evidence for Majority Is Stablest Conjecture. • 5. Conclusions and open problems.

  41. Conclusions and open problems • “Beating Goemans-Williamson is harder than cracking Unique Label Cover or MAX-2LIN(m).” • Open problems: • Prove Majority Is Stablest Conjecture. • What balanced m-ary function f : [m]ⁿ [m] is stablest? • A conjecture: Plurality. • Thm [us]: Noise stability of Plurality is • m(ρ-1)/(ρ+1) + o(1).

  42. Conclusions and open problems • Connections between stability conjectures and Unique Games Conjecture: • Proving that m-ary stability is om(1) is probably enough to show that UGC implies hardness of (hence, essentially, equivalence with) MAX-2LIN(m). • Proving a sharp bound for the m-ary stability problem would give strong results for the UGC w.r.t. how big m needs to be as a function of ε.

More Related