1. Beating the Union Bound by Geometric Techniques Raghu Meka (IAS & DIMACS)

2. “ When you have eliminated the impossible, whatever remains, however improbable, must be the truth ” Union Bound Popularized by Erdos

3. Probabilistic Method 101 Ramsey graphs – Erdos Coding theory – Shannon Metric embeddings – Johnson-Lindenstrauss …

4. Beating the Union Bound Not always enough Constructive: Beck’91, …, Moser’09, …

5. Beating the Union Bound Geometric techniques “Truly” constructive

6. Outline

7. Epsilon Nets Discrete approximations Applications: integration, comp. geometry, …

8. Epsilon Nets for Gaussians Discrete approximations of Gaussian Explicit Even existence not clear!

9. Nets in Gaussian space

10. First: Application to Gaussian Processes and Cover Times 10

11. Gaussian Processes (GPs) Multivariate Gaussian Distribution

12. Supremum of Gaussian Processes (GPs) Supremum is natural: eg., balls and bins

13. When is the supremum smaller? Supremum of Gaussian Processes (GPs) Random Gaussian Covariance matrix More intuitive

14. Why Gaussian Processes? Stochastic Processes Functional analysis Convex Geometry Machine Learning Many more!

15. Aldous-Fill 94: Compute cover time deterministically? Cover times of Graphs

16. Cover Times and GPs Thm (Ding, Lee, Peres 10): O(1) det. poly. time approximation for cover time. Transfer to GPs Compute supremum of GP

17. Question (Lee10, Ding11): PTAS for computing the supremum of GPs? Computing the Supremum

18. Main Result Thm: PTAS for computing the supremum of Gaussian processes. Heart of PTAS: Epsilon net (Dimension reduction ala JL, use exp. size net) Thm: PTAS for computing cover time of bounded degree graphs.

19. Construction of Net 19

20. Simplest possible: univariate to multivariate 1. How fine a net? 2. How big a net?

21. Simplest possible: univariate to multivariate Key point that beats union bound

22. This talk: Analyze ‘step-wise’ approximator

23. Take univariate net and lift to multivariate

24. Dimension Free Error Bounds Proof by “sandwiching” Exploit convexity critically

25. Analysis of Error Why interesting? For any norm,

26. Analysis for Univarate Case Spreading away from origin!

27. Analysis for Univariate Case Push mass towards origin.

28. Analysis for Univariate Case Combining upper and lower:

29. Kanter’s Lemma(77): and unimodal, Lifting to Multivariate Case Key for univariate: “peakedness” Dimension free!

30. Lifting to Multivariate Case Dimension free: key point that beats union bound!

31. Summary of Net Construction

32. Outline

33. 1 2 3 4 5 Discrepancy 1*11* *11*1 11111 ***11 1*1*1 1 2 3 4 5 1*11* *11*1 11111 ***11 1*1*1 3 1 1 0 1

34. Discrepancy Examples Fundamental combinatorial concept Arithmetic Progressions

35. Discrepancy Examples Fundamental combinatorial concept Halfspaces Alexander 90: Matousek 95:

36. Why Discrepancy? Complexity theory Communication Complexity Computational Geometry Pseudorandomness Many more!

37. Spencer’s Six Sigma Theorem Central result in discrepancy theory. Tight: Hadamard Beats union bound: Spencer 85: System with n sets has discrepancy at most. “Six standard deviations suffice”

38. Conjecture (Alon, Spencer): No efficient algorithm can find one. Bansal 10: Can efficiently get discrepancy. A Conjecture and a Disproof Non-constructive pigeon-hole proof Spencer 85: System with n sets has discrepancy at most.

39. Six Sigma Theorem Truly constructive Algorithmic partial coloring lemma Extends to other settings New elementary geometric proof of Spencer’s result EDGE-WALK: New LP rounding method

40. Outline of Algorithm 1.Partial coloring method 2.EDGE-WALK: geometric picture

41. Partial Coloring Method 1*11* *11*1 11111 ***11 1*1*1 1*11* *11*1 11111 ***11 1*1*1 1 -1 1 1 -1 1*11* *11*1 11111 ***11 1*1*1 1 -1 0 0 0 1*11* *11*1 11111 ***11 1*1*1 1*11* *11*1 11111 ***11 1*1*1 1 1 0

42. Lemma: Can do this in randomized time. Partial Coloring Method Input: Output:

43. Outline of Algorithm 1.Partial coloring Method 2.EDGE-WALK: Geometric picture

44. 1*11* *11*1 11111 ***11 1*1*1 Discrepancy: Geometric View 1 1 1 3 1 1 0 1 3 1 1 0 1 1 2 3 4 5

45. 1*11* *11*1 11111 ***11 1*1*1 Discrepancy: Geometric View 1 1 1 3 1 1 0 1 1 2 3 4 5

46. Discrepancy: Geometric View Goal: Find non-zero lattice point inside Gluskin 88: Polytopes, Kanter’s lemma,... !

47. Claim: Will find good partial coloring. Edge-Walk Start at origin Brownian motion till you hit a face Brownian motion within the face Goal: Find non-zero lattice point in

48. Edge-Walk: Algorithm Gaussian random walk in subspaces Standard normal in V: Orthonormal basis change

49. Edge-Walk Algorithm Discretization issues: hitting faces Might not hit face Slack: face hit if close to it.

50. Edge-Walk: Algorithm

51. Edgewalk: Partial Coloring Lem: For with prob 0.1 and

52. Edgewalk: Analysis 1 100 Hit cube more often! Discrepancy faces much farther than cube’s Key point that beats union bound

53. Six Suffice 1.Edge-Walk: Algorithmic partial coloring 2.Recurse on unfixed variables Spencer’s Theorem

54. Summary Geometric techniques Others: Invariance principle for polytopes (Harsha, Klivans, M.’10), …

55. Open Problems Rothvoss’13: Improvements for bin-packing!

56. Thank you

57. Edgewalk Rounding