Approximation & Complexity
|
|
- Megan Blair
- 5 years ago
- Views:
Transcription
1 Summer school on semidefinite optimization Approximation & Complexity David Steurer Cornell University Part 1 September 6, 2012
2 Overview Part 1 Unique Games Conjecture & Basic SDP Part 2 SDP Hierarchies: Algorithms Part 3 SDP Hierarchies: Limits
3 Constraint Satisfaction Problems variables,, over finite alphabet Σ list of predicates/constraints... local: only depend on variables only predicates of certain types Goal: satisfy as many predicates as possible
4 Constraint Satisfaction Problems MAX 3SAT variables,, over finite alphabet Σ = {true, false} list of predicates/constraints... = = 9 7 Goal: satisfy as many predicates as possible
5 Constraint Satisfaction Problems MAX CUT variables,, over finite alphabet Σ = list of predicates/constraints... = + = = + = Goal: satisfy as many predicates as possible
6 Constraint Satisfaction Problems UNIQUE GAMES(k) variables,, over finite alphabet Σ = list of predicates/constraints... = + = 4 = + = 9 value of one variable uniquely determines value of other variable Goal: satisfy as many predicates as possible
7 Optimization & Complexity inherent difficulty, required computational resources Goal: understand complexity of optimization problems upper bounds lower bounds What are good algorithms? What are hard instances?
8 Optimization & Complexity Goal: understand complexity of optimization problems require prohibitive resources (assuming P NP) 1970s Most discrete optimization problems are NP-hard [Cook, Karp, Levin] (including MAX 3SAT, MAX CUT, and UNIQUE GAMES) So we can t hope to prove anything and have to resort to heuristics? No! Do not (blindly) trust impossibility results!
9 Optimization is not all or nothing! What about approximate solutions? (Many classical algorithms for convex optimization are fundamentally approximation algorithms) Goal understand trade-off between complexity and approximation
10 Approximation Goal understand trade-off between complexity and approximation How to measure approximation? α-approximating easy to state, but sometimes too coarse ALG OPT (c,s)-approximating finest measure if OPT, then ALG
11 Approximation Goal understand trade-off between complexity and approximation poly-time approximation algorithms: non-trivial approximations for many problems, e.g., approx for MAX CUT [Goemans-Williamson] NP-hardness of approximation as hard as solving it exactly! for many problems, some approximation is NP-hard e.g., approx for MAX CUT [PCP Theorem] For very few problems, upper and lower bounds match!
12 Complexity vs Approximation Trade-off MAX 3SAT complexity Ω [,(astad, Moshkovitz-Raz 8] no guarantee 7/8 exact approximation guarantee
13 Complexity vs Approximation Trade-off Most other problems complexity Ω? no guarantee What algorithms are we missing? exact approximation guarantee What hard instances do we not know of?
14 Unique Games Conjecture (UGC) For every >, there exists k, [Khot ] constraints: = mod k, -approximation for UNIQUE GAMES(k) is NP-hard Implications of UGC [Khot-Regev, Khot-Kindler-Mossel-O Donnell, Mossel-O Donnell-Oleszkiewicz, Raghavendra 8] For every CSP, the Basic SDP relaxation has optimal integrality gap ( higher-degree sum-of-squares relaxation have same gap) Is the conjecture true?
15 Is the conjecture true? subexponential-time algorithm [Arora-Barak-S., Barak-Raghavendra-S. ], -approximation for UG in time exp 1/3 contrast: all known hardness results for CSPs imply Ω -hardness part of framework for rounding SDP hierarchies lower bounds for certain SDP hierarchies subexp.-time essentially optimal within the rounding framework hard instances based on new kind graphs (with extremal spectral properties) sum-of-squares relaxations [Barak-Gopalan-Håstad- Meka-Raghavendra-S. ] [Barak-Brandão-Harrow- Kelner-S.-Zhou ] all known instances of UG are solved in -degree sos relaxation (including instances that are hard for other SDP hierarchies)
16 Generic Approximation Algorithm for CSPs [Raghavendra-S. ] For any CSP X, OPT vs SDP approximation for X = integrality gap of Basic SDP for X ALG vs OPT based on rounding optimal solutions to Basic SDP relaxation new perspective on previous rounding algorithms, like GW no explicit approximation guarantee polynomial-time but huge constants (depending on desired accuracy)
17 Basic SDP Relaxation for Constraint Satisfaction Problems variables,, over finite alphabet Σ list of predicates/constraints first two moments are consistent and positive semidefinite local distributions... = = Goal: maximize expected number of satisfied predicates
18 Approximating CSPs using Folding CSP Instance I approximation algorithm approximate solution for I Folding identification of variables Unfolding of the assignment preserves value of assignment CSP Instance I Brute Force enumerate all assignments optimal solution for I Efficient whenever folding leaves only O distinct variables Challenge: ensure I has a good solution
19 Approximating CSPs using Folding CSP Instance I approximation algorithm approximate solution for I Folding identification of variables Unfolding of the assignment preserves value of assignment CSP Instance I Brute Force enumerate all assignments optimal solution for I Theorem can fold every CSP instance efficiently to y / variables sdp I sdp I optimal rounding scheme
20 How to fold using SDP solutions CSP Instance I Folding guided by SDP solution CSP Instance I optimal solution for Basic-SDP(I) solve SDP Dimension Reduction Discretize Folding identify variables with same vectors solution for SDP(I) average violation < R Project on random -dimensional subspace solution for SDP(I) average violation < R Move vectors to closest point on -net (size < / )
21 How to fold using SDP solutions CSP Instance I Folding guided by SDP solution CSP Instance I found solution for SDP(I ) with value sdp I But: some constraints violated, on average by Robustness property of Basic SDP relaxation can repair violations at proportional cost for objective value sdp I sdp I 4
22 Summer school on semidefinite optimization Approximation & Complexity David Steurer Cornell University Part 2 September 7, 2012
23 Overview Part 1 Unique Games Conjecture & Basic SDP Part 2 SDP Hierarchies: Algorithms Part 3 SDP Hierarchies: Limits
24 Subexponential Algorithm for Unique Games UG in time exp 1Τ 3 via level- 1Τ 3 SDP relaxation General framework for rounding SDP hierarchies (not restricted to Unique Games) [Barak-Raghavendra-S., Guruswami-Sinop ] Potentially applies to wide range of graph problems Examples: MAX CUT, SPARSEST CUT, COLORING, MAX 2-CSP Some more successes (polynomial time algorithms) Approximation scheme for general MAX 2-CSP on constraint graphs with significant eigenvalues [Barak-Raghavendra-S. ] Better 3-COLORING approximation for some graph families [Arora-Ge ] Better approximation for MAX BISECTION (general graphs) [Raghavendra-Tan ] [Austrin-Benabbas-Georgiou ]
25 Subexponential Algorithm for Unique Games UG in time exp 1Τ 3 via level- 1Τ 3 SDP relaxation General framework for rounding SDP hierarchies (not restricted to Unique Games) [Barak-Raghavendra-S., Guruswami-Sinop ] Potentially applies to wide range of graph problems Examples: MAX CUT, SPARSEST CUT, COLORING, MAX 2-CSP Key concept: global correlation
26 Interlude: Pairwise Correlation Two jointly distributed random variables and Correlation measures dependence between and Does the distribution of change if we condition? Examples: (Statistical) distance between {, } and { }{ } Covariance (if and are real-valued) Mutual Information I, = entropy lost due to conditioning
27 Sampling Rounding problem Given random variables,, over Z Pr = for typical constraint = degree-l moments of a distribution over assignments with expected value Sample UG instance + level-l SDP solution with value (l = 1/3 ) distribution over assignments with expected value similar (?) More convenient to think about actual distributions instead of SDP solutions But: proof should only use linear equalities satisfied by these moments and certain linear inequalities, namely non-negativity of squares (Can formalize this restriction as proof system)
28 Sampling by conditioning Pick an index Sample assignment for index from its marginal distribution Condition distribution on this assignment, = If we condition times, we correctly sample the underlying distribution Issue: after conditioning step, know only degree l moments (instead of degree l) Hope: need to condition only a small number of times; then do something else How can conditioning help?
29 How can conditioning help? Allows us to assume: distribution has low global correlation, I, l typical pair of variables almost independent Claim: general cases reduces to case of low global correlation Proof: Idea: significant global correlation conditioning decreases entropy Potential function Φ = Can always find index such that for Φ Φ =,,, Potential can decrease l/ times by more than /l
30 How can conditioning help? Allows us to assume: distribution has low global correlation, I, l typical pair of variables almost pairwise independent How can low global correlation help?
31 How can low global correlation help?, I, l For some problems, this condition alone gives improvement over BASIC SDP Example: MAX BISECTION [Raghavendra-Tan, Austrin-Benabbas-Georgiou ] hyperplane rounding gives near-bisection if global correlation is low
32 How can low global correlation help?, I, l For Unique Games random variables,, over Z Pr = for typical constraint = Extreme cases with low global correlation l equal-sized components 1) no entropy: all variables are fixed 2) many small independent components: all variables have uniform marginal distribution & partition: I, =... inter-component constraint cannot be typical fraction of constraints are inter-component
33 How can low global correlation help?, I, l For Unique Games random variables,, over Z Pr = for typical constraint = Only Extreme cases with low global correlation l equal-sized components 1) no entropy: all variables are fixed 2) many small independent components: all variables have uniform marginal distribution & partition: I, =... Show: no other cases are possible! (informal) inter-component constraint cannot be typical fraction of constraints are inter-component
34 How Idea: can round low components global correlation independently help? & recurse, Ion them, l For How Unique many Games edges ignored in total? (between different components) random We chose variables l = for,, over Z Pr each level = of recursion for typical decrease constraint component = size by factor at most / levels of recursion Only total fraction of ignored edges / Extreme cases with low global correlation -time algorithm for UG 1) no entropy: all variables are fixed l equal-sized components 2) many small independent components: all variables have uniform marginal distribution & partition:... easy to sample
35 How can low global correlation help?, I, l For Unique Games random variables,, over Z Pr = for typical constraint = Only Extreme cases with low global correlation l equal-sized components 1) no entropy: all variables are fixed 2) many small independent components: all variables have uniform marginal distribution & partition:...
36 Suppose: random variables,, over Z with uniform marginals Pr = for typical constraint = global correlation / Then:. & all constraints touching stay inside of except for an / fraction (in constraint graph, S has low expansion) Proof: Define Corr, = max Pr = Correlation Propagation For random walk of length in constraint graph Corr, Corr, Pr 1 = Pr = proof uses non-negativity of squares (sum-of-squares proof) works also for SDP hierarchy
37 Suppose: random variables,, over Z with uniform marginals Pr = for typical constraint = global correlation / Then:. & all constraints touching stay inside of except for an / fraction (in constraint graph, S has low expansion) Proof: Define Corr, = max Pr = = log For random walk of length in constraint graph Correlation Propagation Corr, On the other hand, Corr, / / for typical j random walk from doesn t mix in -steps (actually far from mixing) exist small set around with low expansion low global correlation
38 Suppose: random variables,, over Z with uniform marginals Pr = for typical constraint = global correlation / /l Then: constraint graph has l eigenvalues Proof: a graph has l eigenvalues vectors,, v n (local: typical edge), (global: typical pair),, /l = For graphs with < l such eigenvalues, algorithm runs in time n l Thanks!
39 Summer school on semidefinite optimization Approximation & Complexity David Steurer Cornell University Part 3 September 7, 2012
40 Overview Part 1 Unique Games Conjecture & Basic SDP Part 2 SDP Hierarchies: Algorithms Part 3 SDP Hierarchies: Limits
41 Approximation limits of s.o.s. methods random assignment has value ½ in expectation predicates ഥ [Grigoriev, Schoenebeck 8] For a random instance I of MAX 3XOR, with high probability (1) value of I is at most / +. (2) value of degree-. s.o.s. relaxation for I is at least.99 Corresponding NP-hardness result is known! Why is this result interesting? # predicates # variables independent of P vs NP question suggests random instances are hard evidence that NP-hard problem take exp. time
42 Approximation limits of s.o.s. methods In terms of polynomials: # edges # vertices random -uniform hypergraph, random sign vector ± degree- polynomial = σ Then, w.h.p., Chernoff bound over (1). over ± (2) all s.o.s. certificate for.99 over ± have degree Ω no degree- s.o.s. refutation of the system = =
43 Interlude: Bounded-width Gaussian Elimination system of polynomials over ± system of affine linear forms over = = + + = = width- Gaussian refutation derivation of = by adding equations of width # variables in equation
44 Approximation limits of s.o.s. methods Part 1 random 3-uniform signed hypergraph, corresponding system has elimination width Ω Part 2 For systems we consider, width- Gaussian refutation degree- Nullstellensatz refutation degree- Positivstellensatz refutation
45 Want to show: Random hypergraph system no width-ω Gaussian refutation bipartite graph vertex sets with S < / Ω unique neighbors is product of edge terms has width Γ unique every refutation contains term product of / edges terms (edge) terms variables
46 Want to show: No width- Gaussian refutation no degree- Positivstellensatz refutation How would degree-d s.o.s. refutation look like? degree- multipliers + S. O. S. = To rule out refutation: over ± How to construct M? Gaussian elimination exhibit linear form on polynomials over ± = S. O. S = S. O. S, degree- Q
47 Want to show: No width- Gaussian refutation no degree- Positivstellensatz refutation Let E be set of such that = derived by width- elimination Relation: ~ if = over ± for some E Claim: equivalence relation on degree- terms symmetry uses = transitivity uses width > Define: = 1 if ~ if ~ 0 otherwise
48 Want to show: No width- Gaussian refutation no degree- Positivstellensatz refutation Let E be set of such that = derived by width- elimination Relation: ~ if = over ± for some E = We wanted: 1 if ~ if ~ 0 otherwise = S. O. S S. O. S? =, degree- Q
49 Want to show: No width- Gaussian refutation no degree- Positivstellensatz refutation Let E be set of such that = derived by width- elimination Relation: ~ if = over ± for some E 1 if ~ = if ~ 0 otherwise S. O. S pair up equivalence classes orthogonal unit vectors,, Check: =,
Unique Games Conjecture & Polynomial Optimization. David Steurer
Unique Games Conjecture & Polynomial Optimization David Steurer Newton Institute, Cambridge, July 2013 overview Proof Complexity Approximability Polynomial Optimization Quantum Information computational
More informationLower bounds on the size of semidefinite relaxations. David Steurer Cornell
Lower bounds on the size of semidefinite relaxations David Steurer Cornell James R. Lee Washington Prasad Raghavendra Berkeley Institute for Advanced Study, November 2015 overview of results unconditional
More informationapproximation algorithms I
SUM-OF-SQUARES method and approximation algorithms I David Steurer Cornell Cargese Workshop, 201 meta-task encoded as low-degree polynomial in R x example: f(x) = i,j n w ij x i x j 2 given: functions
More informationApproximating Maximum Constraint Satisfaction Problems
Approximating Maximum Constraint Satisfaction Problems Johan Håstad some slides by Per Austrin Shafi and Silvio celebration, December 10, 2013 The Swedish Angle Today we are celebrating a Turing Award.
More informationSum-of-Squares Method, Tensor Decomposition, Dictionary Learning
Sum-of-Squares Method, Tensor Decomposition, Dictionary Learning David Steurer Cornell Approximation Algorithms and Hardness, Banff, August 2014 for many problems (e.g., all UG-hard ones): better guarantees
More informationUnique Games and Small Set Expansion
Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Unique Games and Small Set Expansion The Unique Games Conjecture (UGC) (Khot [2002]) states that for every ɛ > 0 there is some finite
More informationApproximability of Constraint Satisfaction Problems
Approximability of Constraint Satisfaction Problems Venkatesan Guruswami Carnegie Mellon University October 2009 Venkatesan Guruswami (CMU) Approximability of CSPs Oct 2009 1 / 1 Constraint Satisfaction
More informationLecture 20: Course summary and open problems. 1 Tools, theorems and related subjects
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 20: Course summary and open problems Dec. 7, 2005 Lecturer: Ryan O Donnell Scribe: Ioannis Giotis Topics we discuss in this
More informationThe Unique Games and Sum of Squares: A love hate relationship
Proof, beliefs, and algorithms through the lens of sum-of-squares 1 The Unique Games and Sum of Squares: A love hate relationship Sad to say, but it will be many more years, if ever before we really understand
More informationLecture 17 (Nov 3, 2011 ): Approximation via rounding SDP: Max-Cut
CMPUT 675: Approximation Algorithms Fall 011 Lecture 17 (Nov 3, 011 ): Approximation via rounding SDP: Max-Cut Lecturer: Mohammad R. Salavatipour Scribe: based on older notes 17.1 Approximation Algorithm
More informationNear-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar Konstantin Makarychev Yury Makarychev Princeton University Abstract In this paper we present approximation algorithms
More informationWhat Computers Can Compute (Approximately) David P. Williamson TU Chemnitz 9 June 2011
What Computers Can Compute (Approximately) David P. Williamson TU Chemnitz 9 June 2011 Outline The 1930s-40s: What can computers compute? The 1960s-70s: What can computers compute efficiently? The 1990s-:
More informationLecture 16: Constraint Satisfaction Problems
A Theorist s Toolkit (CMU 18-859T, Fall 2013) Lecture 16: Constraint Satisfaction Problems 10/30/2013 Lecturer: Ryan O Donnell Scribe: Neal Barcelo 1 Max-Cut SDP Approximation Recall the Max-Cut problem
More informationLecture 2: November 9
Semidefinite programming and computational aspects of entanglement IHP Fall 017 Lecturer: Aram Harrow Lecture : November 9 Scribe: Anand (Notes available at http://webmitedu/aram/www/teaching/sdphtml)
More informationOn the efficient approximability of constraint satisfaction problems
On the efficient approximability of constraint satisfaction problems July 13, 2007 My world Max-CSP Efficient computation. P Polynomial time BPP Probabilistic Polynomial time (still efficient) NP Non-deterministic
More informationSDP gaps for 2-to-1 and other Label-Cover variants
SDP gaps for -to-1 and other Label-Cover variants Venkatesan Guruswami 1, Subhash Khot, Ryan O Donnell 1, Preyas Popat, Madhur Tulsiani 3, and Yi Wu 1 1 Computer Science Department Carnegie Mellon University
More informationApproximation Resistance from Pairwise Independent Subgroups
1/19 Approximation Resistance from Pairwise Independent Subgroups Siu On Chan UC Berkeley 2/19 Max-CSP Goal: Satisfy the maximum fraction of constraints Examples: 1 MAX-3XOR: x 1 + x 10 + x 27 = 1 x 4
More informationApproximation Algorithms and Hardness of Approximation May 14, Lecture 22
Approximation Algorithms and Hardness of Approximation May 4, 03 Lecture Lecturer: Alantha Newman Scribes: Christos Kalaitzis The Unique Games Conjecture The topic of our next lectures will be the Unique
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationReed-Muller testing and approximating small set expansion & hypergraph coloring
Reed-Muller testing and approximating small set expansion & hypergraph coloring Venkatesan Guruswami Carnegie Mellon University (Spring 14 @ Microsoft Research New England) 2014 Bertinoro Workshop on Sublinear
More informationLecture 21 (Oct. 24): Max Cut SDP Gap and Max 2-SAT
CMPUT 67: Approximation Algorithms Fall 014 Lecture 1 Oct. 4): Max Cut SDP Gap and Max -SAT Lecturer: Zachary Friggstad Scribe: Chris Martin 1.1 Near-Tight Analysis of the Max Cut SDP Recall the Max Cut
More informationLecture 22: Hyperplane Rounding for Max-Cut SDP
CSCI-B609: A Theorist s Toolkit, Fall 016 Nov 17 Lecture : Hyperplane Rounding for Max-Cut SDP Lecturer: Yuan Zhou Scribe: Adithya Vadapalli 1 Introduction In the previous lectures we had seen the max-cut
More informationarxiv: v4 [cs.cc] 14 Mar 2013
On Unique Games with Negative Weights Peng Cui 1 arxiv:1102.5605v4 [cs.cc] 14 Mar 2013 Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information Resource Management, Renmin
More informationIntroduction to LP and SDP Hierarchies
Introduction to LP and SDP Hierarchies Madhur Tulsiani Princeton University Local Constraints in Approximation Algorithms Linear Programming (LP) or Semidefinite Programming (SDP) based approximation algorithms
More informationOn the Optimality of Some Semidefinite Programming-Based. Approximation Algorithms under the Unique Games Conjecture. A Thesis presented
On the Optimality of Some Semidefinite Programming-Based Approximation Algorithms under the Unique Games Conjecture A Thesis presented by Seth Robert Flaxman to Computer Science in partial fulfillment
More informationOverview. 1 Introduction. 2 Preliminary Background. 3 Unique Game. 4 Unique Games Conjecture. 5 Inapproximability Results. 6 Unique Game Algorithms
Overview 1 Introduction 2 Preliminary Background 3 Unique Game 4 Unique Games Conjecture 5 Inapproximability Results 6 Unique Game Algorithms 7 Conclusion Antonios Angelakis (NTUA) Theory of Computation
More informationA On the Usefulness of Predicates
A On the Usefulness of Predicates Per Austrin, Aalto University and KTH Royal Institute of Technology Johan Håstad, KTH Royal Institute of Technology Motivated by the pervasiveness of strong inapproximability
More informationReductions Between Expansion Problems
Reductions Between Expansion Problems Prasad Raghavendra David Steurer Madhur Tulsiani November 11, 2010 Abstract The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness
More informationGraph Partitioning Algorithms and Laplacian Eigenvalues
Graph Partitioning Algorithms and Laplacian Eigenvalues Luca Trevisan Stanford Based on work with Tsz Chiu Kwok, Lap Chi Lau, James Lee, Yin Tat Lee, and Shayan Oveis Gharan spectral graph theory Use linear
More informationSome Open Problems in Approximation Algorithms
Some Open Problems in Approximation Algorithms David P. Williamson School of Operations Research and Information Engineering Cornell University November 2, 2010 Egerváry Research Group on Combinatorial
More informationSum-of-Squares and Spectral Algorithms
Sum-of-Squares and Spectral Algorithms Tselil Schramm June 23, 2017 Workshop on SoS @ STOC 2017 Spectral algorithms as a tool for analyzing SoS. SoS Semidefinite Programs Spectral Algorithms SoS suggests
More informationConvex and Semidefinite Programming for Approximation
Convex and Semidefinite Programming for Approximation We have seen linear programming based methods to solve NP-hard problems. One perspective on this is that linear programming is a meta-method since
More informationMaximum cut and related problems
Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Maximum cut and related problems Figure 1: The graph of Renato Paes Leme s friends on the social network Orkut, the partition to top
More informationPCP Course; Lectures 1, 2
PCP Course; Lectures 1, 2 Mario Szegedy September 10, 2011 Easy and Hard Problems Easy: Polynomial Time 5n; n 2 ; 4n 3 + n Hard: Super-polynomial Time n log n ; 2 n ; n! Proving that a problem is easy:
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming
princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Matt Weinberg Scribe: Sanjeev Arora One of the running themes in this course is
More informationPCP Theorem and Hardness of Approximation
PCP Theorem and Hardness of Approximation An Introduction Lee Carraher and Ryan McGovern Department of Computer Science University of Cincinnati October 27, 2003 Introduction Assuming NP P, there are many
More informationA Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover Grant Schoenebeck Luca Trevisan Madhur Tulsiani Abstract We study semidefinite programming relaxations of Vertex Cover arising
More informationSome Open Problems in Approximation Algorithms
Some Open Problems in Approximation Algorithms David P. Williamson School of Operations Research and Information Engineering Cornell University February 28, 2011 University of Bonn Bonn, Germany David
More informationHow to Play Unique Games against a Semi-Random Adversary
How to Play Unique Games against a Semi-Random Adversary Study of Semi-Random Models of Unique Games Alexandra Kolla Microsoft Research Konstantin Makarychev IBM Research Yury Makarychev TTIC Abstract
More information8 Approximation Algorithms and Max-Cut
8 Approximation Algorithms and Max-Cut 8. The Max-Cut problem Unless the widely believed P N P conjecture is false, there is no polynomial algorithm that can solve all instances of an NP-hard problem.
More informationLocally Expanding Hypergraphs and the Unique Games Conjecture
Locally Expanding Hypergraphs and the Unique Games Conjecture Eric Purdy September 25, 2008 Abstract We examine the hardness of approximating constraint satisfaction problems with k-variable constraints,
More informationNew Directions in Approximation Algorithms and Hardness of Approximation Thesis proposal
New Directions in Approximation Algorithms and Hardness of Approximation Thesis proposal Yuan Zhou Computer Science Department Carnegie Mellon University January 9, 2014 Abstract This thesis is a collection
More informationLecture 3: Semidefinite Programming
Lecture 3: Semidefinite Programming Lecture Outline Part I: Semidefinite programming, examples, canonical form, and duality Part II: Strong Duality Failure Examples Part III: Conditions for strong duality
More informationMax Cut (1994; 1995; Goemans, Williamson)
Max Cut (1994; 1995; Goemans, Williamson) Alantha Newman Max-Planck-Institut für Informatik http://www.mpi-inf.mpg.de/alantha 1 Index Terms Graph partitioning, Approximation algorithms. 2 Synonyms Maximum
More informationPostprint.
http://www.diva-portal.org Postprint This is the accepted version of a paper presented at 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013 and
More informationApproximating maximum satisfiable subsystems of linear equations of bounded width
Approximating maximum satisfiable subsystems of linear equations of bounded width Zeev Nutov The Open University of Israel Daniel Reichman The Open University of Israel Abstract We consider the problem
More informationFoundations of Machine Learning and Data Science. Lecturer: Avrim Blum Lecture 9: October 7, 2015
10-806 Foundations of Machine Learning and Data Science Lecturer: Avrim Blum Lecture 9: October 7, 2015 1 Computational Hardness of Learning Today we will talk about some computational hardness results
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 2
CPSC 536N: Randomized Algorithms 2014-15 Term 2 Prof. Nick Harvey Lecture 2 University of British Columbia In this lecture we continue our introduction to randomized algorithms by discussing the Max Cut
More informationApproximation algorithm for Max Cut with unit weights
Definition Max Cut Definition: Given an undirected graph G=(V, E), find a partition of V into two subsets A, B so as to maximize the number of edges having one endpoint in A and the other in B. Definition:
More informationPCP Soundness amplification Meeting 2 ITCS, Tsinghua Univesity, Spring April 2009
PCP Soundness amplification Meeting 2 ITCS, Tsinghua Univesity, Spring 2009 29 April 2009 Speaker: Andrej Bogdanov Notes by: Andrej Bogdanov Recall the definition of probabilistically checkable proofs
More informationlinear programming and approximate constraint satisfaction
linear programming and approximate constraint satisfaction Siu On Chan MSR New England James R. Lee University of Washington Prasad Raghavendra UC Berkeley David Steurer Cornell results MAIN THEOREM: Any
More informationHow hard is it to find a good solution?
How hard is it to find a good solution? Simons Institute Open Lecture November 4, 2013 Research Area: Complexity Theory Given a computational problem, find an efficient algorithm that solves it. Goal of
More informationRounding Sum-of-Squares Relaxations
Rounding Sum-of-Squares Relaxations Boaz Barak Jonathan Kelner David Steurer June 10, 2014 Abstract We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares
More informationarxiv: v1 [cs.ds] 19 Dec 2018
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems Sepehr Abbasi-Zadeh Nikhil Bansal Guru Guruganesh Aleksandar Nikolov Roy Schwartz Mohit Singh arxiv:181.7769v1 [cs.ds]
More informationInapproximability Ratios for Crossing Number
Universidade de São Paulo September 14, 2017 Drawings A drawing of a graph G is a function D : G R 2 that maps each vertex to a distinct point and each edge uv E(G) to an arc connecting D(u) to D(v) that
More informationHierarchies. 1. Lovasz-Schrijver (LS), LS+ 2. Sherali Adams 3. Lasserre 4. Mixed Hierarchy (recently used) Idea: P = conv(subset S of 0,1 n )
Hierarchies Today 1. Some more familiarity with Hierarchies 2. Examples of some basic upper and lower bounds 3. Survey of recent results (possible material for future talks) Hierarchies 1. Lovasz-Schrijver
More informationOptimal Sherali-Adams Gaps from Pairwise Independence
Optimal Sherali-Adams Gaps from Pairwise Independence Konstantinos Georgiou Avner Magen Madhur Tulsiani {cgeorg,avner}@cs.toronto.edu, madhurt@cs.berkeley.edu Abstract This work considers the problem of
More informationImproved Hardness of Approximating Chromatic Number
Improved Hardness of Approximating Chromatic Number Sangxia Huang KTH Royal Institute of Technology Stockholm, Sweden sangxia@csc.kth.se April 13, 2013 Abstract We prove that for sufficiently large K,
More informationMaking the long code shorter, with applications to the Unique Games Conjecture
Making the long code shorter, with applications to the Unique Games Conjecture Boaz Barak Parikshit Gopalan Johan Håstad Raghu Meka Prasad Raghavendra November 2, 2011 David Steurer Abstract The long code
More informationNew Directions in Approximation Algorithms and Hardness of Approximation
New Directions in Approximation Algorithms and Hardness of Approximation Yuan Zhou CMU-CS-14-125 August 2014 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee:
More informationORIE 6334 Spectral Graph Theory December 1, Lecture 27 Remix
ORIE 6334 Spectral Graph Theory December, 06 Lecturer: David P. Williamson Lecture 7 Remix Scribe: Qinru Shi Note: This is an altered version of the lecture I actually gave, which followed the structure
More informationLecture 12 Scribe Notes
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 04 Prof. Erik Demaine Lecture Scribe Notes Recap For the past two classes, we ve been covering inapproximability, some of its reduction styles,
More informationParallel Repetition of Fortified Games
Electronic Colloquium on Computational Complexity, Report No. 54 (2014) Parallel Repetition of Fortified Games Dana Moshkovitz April 16, 2014 Abstract The Parallel Repetition Theorem upper-bounds the value
More informationInapproximability of Treewidth, Graph-layout and One-shot Pebbling
Inapproximability of Treewidth, Graph-layout and One-shot Pebbling Per Austrin, Toniann Pitassi, Yu Wu University of Toronto October 20, 2011 1 / 32 Problems we consider One-shot Pebbling game : Pebbling
More informationOn the Usefulness of Predicates
On the Usefulness of Predicates Per Austrin University of Toronto austrin@cs.toronto.edu Johan Håstad KTH Royal Institute of Technology ohanh@kth.se Abstract Motivated by the pervasiveness of strong inapproximability
More informationAPPROXIMATION RESISTANT PREDICATES FROM PAIRWISE INDEPENDENCE
APPROXIMATION RESISTANT PREDICATES FROM PAIRWISE INDEPENDENCE Per Austrin and Elchanan Mossel Abstract. We study the approximability of predicates on k variables from a domain [q], and give a new sufficient
More informationCanonical SDP Relaxation for CSPs
Lecture 14 Canonical SDP Relaxation for CSPs 14.1 Recalling the canonical LP relaxation Last time, we talked about the canonical LP relaxation for a CSP. A CSP(Γ) is comprised of Γ, a collection of predicates
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 8 Luca Trevisan September 19, 2017
U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 8 Luca Trevisan September 19, 2017 Scribed by Luowen Qian Lecture 8 In which we use spectral techniques to find certificates of unsatisfiability
More informationLecture 10. Semidefinite Programs and the Max-Cut Problem Max Cut
Lecture 10 Semidefinite Programs and the Max-Cut Problem In this class we will finally introduce the content from the second half of the course title, Semidefinite Programs We will first motivate the discussion
More informationLecture 13 March 7, 2017
CS 224: Advanced Algorithms Spring 2017 Prof. Jelani Nelson Lecture 13 March 7, 2017 Scribe: Hongyao Ma Today PTAS/FPTAS/FPRAS examples PTAS: knapsack FPTAS: knapsack FPRAS: DNF counting Approximation
More informationThe Complexity of Somewhat Approximation Resistant Predicates
The Complexity of Somewhat Approximation Resistant Predicates C 1. C m x 1. x n Madhur Tulsiani TTI Chicago Joint work with Subhash Khot and Pratik Worah Max-k-CSP Max-k-CSP - n Boolean variables, m constraints
More informationProject in Computational Game Theory: Communities in Social Networks
Project in Computational Game Theory: Communities in Social Networks Eldad Rubinstein November 11, 2012 1 Presentation of the Original Paper 1.1 Introduction In this section I present the article [1].
More informationc 2014 by Naman Agarwal. All rights reserved.
c 014 by Naman Agarwal. All rights reserved. UNIQUE GAMES CONJECTURE : THE BOOLEAN HYPERCUBE AND CONNECTIONS TO GRAPH LIFTS BY NAMAN AGARWAL THESIS Submitted in partial fulfillment of the requirements
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationImproved NP-inapproximability for 2-variable linear equations
Improved NP-inapproximability for 2-variable linear equations Johan Håstad johanh@csc.kth.se Ryan O Donnell odonnell@cs.cmu.edu (full version) Sangxia Huang sangxia@csc.kth.se July 3, 2014 Rajsekar Manokaran
More informationRandom Walks and Evolving Sets: Faster Convergences and Limitations
Random Walks and Evolving Sets: Faster Convergences and Limitations Siu On Chan 1 Tsz Chiu Kwok 2 Lap Chi Lau 2 1 The Chinese University of Hong Kong 2 University of Waterloo Jan 18, 2017 1/23 Finding
More informationSubexponential Algorithms for Unique Games and Related problems
Subexponential Algorithms for Unique Games and Related problems Sanjeev Arora Boaz Barak David Steurer April 8, 2010 Abstract We give subexponential time approximation algorithms for the unique games and
More informationImproved NP-inapproximability for 2-variable linear equations
THEORY OF COMPUTING www.theoryofcomputing.org Improved NP-inapproximability for 2-variable linear equations Johan Håstad Sangxia Huang Rajsekar Manokaran Ryan O Donnell John Wright August 27, 2016 Abstract:
More informationGraph Partitioning and Semi-definite Programming Hierarchies
Graph Partitioning and Semi-definite Programming Hierarchies Ali Kemal Sinop CMU-CS-12-121 May 15, 2012 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Venkatesan
More informationRounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs
Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs Venkatesan Guruswami guruswami@cmu.edu Computer Science Department, Carnegie
More informationLecture 10 + additional notes
CSE533: Information Theorn Computer Science November 1, 2010 Lecturer: Anup Rao Lecture 10 + additional notes Scribe: Mohammad Moharrami 1 Constraint satisfaction problems We start by defining bivariate
More informationAlmost-polynomial Ratio ETH-Hardness of ApproxIMATIng Densest k-subgraph. Pasin Manurangsi UC Berkeley
Almost-polynomial Ratio ETH-Hardness of ApproxIMATIng Densest k-subgraph Pasin Manurangsi UC Berkeley Densest k-subgraph (DkS) G S Input An undirected graph G = (V, E) A positive integer k Goal Find a
More informationAPPROXIMATION RESISTANCE AND LINEAR THRESHOLD FUNCTIONS
APPROXIMATION RESISTANCE AND LINEAR THRESHOLD FUNCTIONS RIDWAN SYED Abstract. In the boolean Max k CSP (f) problem we are given a predicate f : { 1, 1} k {0, 1}, a set of variables, and local constraints
More informationProof Complexity Meets Algebra
ICALP 17, Warsaw 11th July 2017 (CSP problem) P 3-COL S resolution (proof system) Proofs in S of the fact that an instance of P is unsatisfiable. Resolution proofs of a graph being not 3-colorable. Standard
More informationN P-Hardness of Approximately Solving Linear Equations Over Reals
lectronic Colloquium on Computational Complexity, Report No. 11 (010) N P-Hardness of Approximately Solving Linear quations Over Reals Subhash Khot Dana Moshkovitz July 15, 010 Abstract In this paper,
More informationMINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS. Albert Atserias Universitat Politècnica de Catalunya Barcelona
MINI-TUTORIAL ON SEMI-ALGEBRAIC PROOF SYSTEMS Albert Atserias Universitat Politècnica de Catalunya Barcelona Part I CONVEX POLYTOPES Convex polytopes as linear inequalities Polytope: P = {x R n : Ax b}
More informationTwo Query PCP with Sub-Constant Error
Electronic Colloquium on Computational Complexity, Report No 71 (2008) Two Query PCP with Sub-Constant Error Dana Moshkovitz Ran Raz July 28, 2008 Abstract We show that the N P-Complete language 3SAT has
More informationProvable Approximation via Linear Programming
Chapter 7 Provable Approximation via Linear Programming One of the running themes in this course is the notion of approximate solutions. Of course, this notion is tossed around a lot in applied work: whenever
More informationSPECTRAL ALGORITHMS FOR UNIQUE GAMES
SPECTRAL ALGORITHMS FOR UNIQUE GAMES Alexandra Kolla Abstract. We give a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationThe Approximability of Learning and Constraint Satisfaction Problems
The Approximability of Learning and Constraint Satisfaction Problems Yi Wu CMU-CS-10-142 October 7, 2010 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Ryan
More informationNew NP-hardness results for 3-Coloring and 2-to-1 Label Cover
New NP-hardness results for 3-Coloring and -to- Label Cover Per Austrin Ryan O Donnell Li-Yang Tan John Wright July 6, 03 Abstract We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring
More informationCOMPUTATIONAL COMPLEXITY
COMPUTATIONAL COMPLEXITY A Modern Approach SANJEEV ARORA Princeton University BOAZ BARAK Princeton University {Щ CAMBRIDGE Щ0 UNIVERSITY PRESS Contents About this book Acknowledgments Introduction page
More informationImproved NP-inapproximability for 2-variable linear equations
Improved NP-inapproximability for 2-variable linear equations Johan Håstad Sangxia Huang Rajsekar Manokaran Ryan O Donnell John Wright December 23, 2015 Abstract An instance of the 2-Lin(2) problem is
More informationUnique Games Over Integers
Unique Games Over Integers Ryan O Donnell Yi Wu Yuan Zhou Computer Science Department Carnegie Mellon University {odonnell,yiwu,yuanzhou}@cs.cmu.edu Abstract Consider systems of two-variable linear equations
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationLecture 20: LP Relaxation and Approximation Algorithms. 1 Introduction. 2 Vertex Cover problem. CSCI-B609: A Theorist s Toolkit, Fall 2016 Nov 8
CSCI-B609: A Theorist s Toolkit, Fall 2016 Nov 8 Lecture 20: LP Relaxation and Approximation Algorithms Lecturer: Yuan Zhou Scribe: Syed Mahbub Hafiz 1 Introduction When variables of constraints of an
More informationLabel Cover Algorithms via the Log-Density Threshold
Label Cover Algorithms via the Log-Density Threshold Jimmy Wu jimmyjwu@stanford.edu June 13, 2017 1 Introduction Since the discovery of the PCP Theorem and its implications for approximation algorithms,
More informationInapproximability Reductions and Integrality Gaps
Inapproximability Reductions and Integrality Gaps by Preyas Popat A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computer Science
More information