Noise stability of functions with low influences:

Slides:



Advertisements
Similar presentations
Ryan Donnell Carnegie Mellon University O. 1. Describe some TCS results requiring variants of the Central Limit Theorem. Talk Outline 2. Show a flexible.
Advertisements

Subhash Khot IAS Elchanan Mossel UC Berkeley Guy Kindler DIMACS Ryan O’Donnell IAS.
Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05.
Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.
Dana Moshkovitz MIT Joint work with Subhash Khot, NYU 1.
The Max-Cut problem: Election recounts? Majority vs. Electoral College? 7812.
Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra University of Washington Seattle.
Ryan O’Donnell Carnegie Mellon University analysisofbooleanfunctions.org.
Gillat Kol joint work with Irit Dinur Covering CSPs.
Uniqueness of Optimal Mod 3 Circuits for Parity Frederic Green Amitabha Roy Frederic Green Amitabha Roy Clark University Akamai Clark University Akamai.
Kevin Matulef MIT Ryan O’Donnell CMU Ronitt Rubinfeld MIT Rocco Servedio Columbia.
Constraint Satisfaction over a Non-Boolean Domain Approximation Algorithms and Unique Games Hardness Venkatesan Guruswami Prasad Raghavendra University.
Derandomized parallel repetition theorems for free games Ronen Shaltiel, University of Haifa.
Introduction to PCP and Hardness of Approximation Dana Moshkovitz Princeton University and The Institute for Advanced Study 1.
1/17 Optimal Long Test with One Free Bit Nikhil Bansal (IBM) Subhash Khot (NYU)
Dictator tests and Hardness of approximating Max-Cut-Gain Ryan O’Donnell Carnegie Mellon (includes joint work with Subhash Khot of Georgia Tech)
1 By Gil Kalai Institute of Mathematics and Center for Rationality, Hebrew University, Jerusalem, Israel presented by: Yair Cymbalista.
Vol.1: Geometry Subhash Khot IAS Elchanan Mossel UC Berkeley Guy Kindler DIMACS Ryan O’Donnell IAS.
Ryan O'Donnell (CMU, IAS) Yi Wu (CMU, IBM) Yuan Zhou (CMU)
1 Discrete Structures CS 280 Example application of probability: MAX 3-SAT.
Ryan ’Donnell Carnegie Mellon University O. Ryan ’Donnell Carnegie Mellon University.
Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.
A Fourier-Theoretic Perspective on the Condorcet Paradox and Arrow ’ s Theorem. By Gil Kalai, Institute of Mathematics, Hebrew University Presented by:
Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)
Ryan O’Donnell Carnegie Mellon University. Part 1: A. Fourier expansion basics B. Concepts: Bias, Influences, Noise Sensitivity C. Kalai’s proof of Arrow’s.
Ryan ’Donnell Carnegie Mellon University O. f : {−1, 1} n → {−1, 1} is “quasirandom” iff fixing O(1) input coords changes E[f(x)] by only o (1)
Primer on Fourier Analysis Dana Moshkovitz Princeton University and The Institute for Advanced Study.
1 Elections and Manipulations: Ehud Friedgut, Gil Kalai, and Noam Nisan Hebrew University of Jerusalem and EF: U. of Toronto, GK: Yale University, NN:
Yuan Zhou Carnegie Mellon University Joint works with Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan Kelner, Ryan O'Donnell and David Steurer.
C&O 355 Mathematical Programming Fall 2010 Lecture 16 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)
Shorter Long Codes and Applications to Unique Games 1 Boaz Barak (MSR, New England) Parikshit Gopalan (MSR, SVC) Johan Håstad (KTH) Prasad Raghavendra.
C&O 355 Lecture 24 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A A A A A A A.
Unique Games Approximation Amit Weinstein Complexity Seminar, Fall 2006 Based on: “Near Optimal Algorithms for Unique Games" by M. Charikar, K. Makarychev,
Yuan Zhou, Ryan O’Donnell Carnegie Mellon University.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
Boaz Barak (MSR New England) Fernando G.S.L. Brandão (Universidade Federal de Minas Gerais) Aram W. Harrow (University of Washington) Jonathan Kelner (MIT)
Yuan Zhou Carnegie Mellon University Joint works with Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan Kelner, Ryan O'Donnell and David Steurer.
Non Linear Invariance Principles with Applications Elchanan Mossel U.C. Berkeley
P & NP.
Information geometry.
New Characterizations in Turnstile Streams with Applications
Dana Ron Tel Aviv University
Joint Probability Distributions and Random Samples
Worst case to Average case Reductions for Polynomials
Primer on Fourier Analysis
Gil Kalai Einstein Institute of Mathematics
Sensitivity of voting coin tossing protocols, Nov 1
Sensitivity of voting schemes and coin tossing protocols
Reconstruction on trees and Phylogeny 1
Dana Moshkovitz The Institute For Advanced Study
On Sensitivity and Chaos
Sum of Squares, Planted Clique, and Pseudo-Calibration
Possibilities and Limitations in Computation
Background: Lattices and the Learning-with-Errors problem
Subhash Khot Dept of Computer Science NYU-Courant & Georgia Tech
Linear sketching with parities
Venkatesan Guruswami Yuan Zhou (Carnegie Mellon University)
Linear sketching over
§2-3 Observability of Linear Dynamical Equations
Introduction to PCP and Hardness of Approximation
Linear Programming Duality, Reductions, and Bipartite Matching
Linear sketching with parities
Applied Discrete Mathematics Week 9: Integer Properties
Imperfectly Shared Randomness
Affine Spaces Def: Suppose
Small Set Expansion in The Johnson Graph
Recursion.
Small Set Expansion in The Johnson Graph
Presentation transcript:

Noise stability of functions with low influences: Invariance & Optimality Elchanan Mossel (Statistics, Berkeley) Ryan O'Donnell (Microsoft Research) Krzysztof Oleszkiewicz (Mathematics, Warsaw) 11/14/2018

Influences and Noise-Stability The Influence of the i’th variable on f : {-1,1}n ! {-1,1} measures how much f depends on the i’th coordinate: Ii(f) := P[f(x1,…,xi-1,-1,xi+1,…,xn)  f(x1,…xi-1,1,xi+1,…,xn)] Let I(f) := maxi I(f) . The -Noise-Stability of f : {-1,1}n ! R is the correlation between the values of f on two inputs that are -correlated: S(f) := E[f(x) f(y)] where zi = (xi,yi) are independent with E[xi] = E[yi] = 0 and E[xi yi] =  (P[xi = yi] = (1+)/2) Definition of Ii and I extends to f : {-1,1}n ! R by: Ii(f) := E[Vari[f]] = E[ Var[ f | x1,…xi-1,xi+1,…,xn ] ] 11/14/2018

Low influences, Stability and UGC Often, using unique-games-conjecture (Khot 2002), after constructing the outer-verifier, (Very) roughly speaking the hardness of approximation factor is given by c/s where c = lim ! 0 supn,f {S(f) : I(f) · , E[f] = 0} s = supn,f E[S(f) : E[f] = 0} for an appropriate value of  (sometimes need variant of S) s is typically easy to analyze – it is maximized by a dictator. It is harder to find c. 11/14/2018

Majority is Stablest Conj (Khot-Kindler-M-O’Donnell-04) Thm(M-O’Donnell-Oleskiewicz-05): “Majority is Stablest”: For all  ¸ 0, lim ! 0 sup[S(f) : f: {-1,1}n ! [-1,1], I(f) · , E[f] = 0] = (2 arcsin )/ p Majn(x) := sgn(i=1n xi) has I(Majn) ! 0 and S(Majn) ! (2 arcsin )/ 11/14/2018

Tight hardness factors assuming UCG Maj-Stablest + UGC implies: (From Khot 2002): (1-,1-O(1/2)) hardness for MAX-2-LIN (mod 2) and MAX-2-SAT. From (Khot-Kindler-M-O’Donnell 2005): Goemans-Williamson algorithm achieves tight approximation factor (0.878…) for MAX-CUT. 8  > 0 9 q() such that MAX-2-LIN(mod q) has (1-,) hardness. MAX-q-CUT has (1-1/q+o(1/q)) hardness factor (matches Frieze & Jerrum semi-definite algorithm). 11/14/2018

First attempt at Maj-Stablest Instead of proving it – assume it and let f : Rk ! [-1,1]. N,M = standard normal vectors & E[Ni Mj] =  (i = j). Define S(f) = E[f(N) f(M)]. “Majority is Stablest” ) Thm B: sup { S(f) : E[f] = 0} = 2 arcsin  / . Pf: Approximate f by fn : {-1,1}k n ! {-1,1} with low influences and use Majority is Stablest and the Central Limit Theorem. Thm B was proven by Borell 85. The optimizer f is the indicator of a half space. N M 11/14/2018

From Gaussian to discrete stability Is there a way to deduce the discrete results from the Gaussian result? Let’s look at the CLT: CLT: If |a|2 = 1 and supi |ai| ·  then supx |P[i ai xi · x] – P[N · x]| · O() Different formulation: Let f : {-1,1}n ! R be a linear function: f(x) =  ai xi and |f|2 = 1. I(f) · . Then supt |P[i ai xi · t] – P[i ai Ni · t]| · O(), where Ni are i.i.d. Gaussians. 11/14/2018

From Gaussian to discrete stability A new limit theorem [M+O’Donnell+Oleszkiewicz(05)]: Let f : {-1,1}n ! R be a degree k multi-linear polynomial, f(x) = 0 < |S| · k aS i 2 S xi such that |f|2 = 1 I (f) · . Then for all t: |P[f · t] - P[0 < |S| · k aS i 2 S Ni · t]| · O(k 1/(4k)) We prove similar result for other discrete spaces. Generalizes: CLT Gaussian chaos results for U and V statistics. 11/14/2018

A proof sketch : maj is stablest Idea: Truncate and follow your nose. Suppose f : {-1,1}n ! [-1,1] has small influences but E[f T f] = is large. Then the same is true for g = T f (() < 1). Let h = |S| · k gS uS then |h-g|2 is small. Let h’ = |S| · k gS i 2 S Ni Then: <h,T h> = <h’, U h’> is large and by the new limit theorem: h’ is close in L2 to a [-1,1] R.V. Take g’(x) = h’(x) if |h’(x)| · 1 and g’(x) = sgn(h’(x)). E[g’ U g’] is too large – contradiction! + 11/14/2018

A proof sketch : new limit theorem Recall: p a degree k multi-linear polynomial with: |p|2 = 1 and Ii(p) ·  for all i. Want to show p(x1,…,xn) ~ p(N1,…,Nn). Suffices to show that 8 smooth F ( |F’’’| · C ), E[F(p(x1,…,xn)] is close to E[F(p(N1,…,Nn))]. Proof similar to Lindberg proof of CLT Uses Hypercontractivity 11/14/2018

Other results in the paper Conj (Kalai-02) Thm: (M-O’Donnell-Oleskiewicz-05): Majority is Stablest ) “The probability of an Arrow Paradox” among all low influence function is minimized by the majority function. It is assumed that voters rank 3 candidates uniformly in S3n A “paradox” is the event that the overall preference is A over B over C over A using an aggregation function f : {-1,1}n ! {-1,1} B A C Conj (Kalai-01) Thm: (M-O’Donnell-Oleskiewicz-05): For f with low influences – “it ain’t over until it’s over.” This means that for every , the probability to be (1-)-“certain” of value of the function given a random fraction  of the inputs goes to 0 as  ! 0. 11/14/2018

Conclusion We prove new invariance principle that allows to translate stability problems between different settings: Discrete spaces Gaussian measures Spherical measures For Maj-Is-Stablest Gaussian analogue is known. Connections suggest interesting future work. In recent work (Dinur+M+Regev) same philosophy applied to show UGC ) hardness of coloring. 11/14/2018

11/14/2018