discrepancy minimization by walking on the edges
Download
Skip this Video
Download Presentation
Discrepancy Minimization by Walking on the Edges

Loading in 2 Seconds...

play fullscreen
1 / 24

Discrepancy Minimization by Walking on the Edges - PowerPoint PPT Presentation


  • 141 Views
  • Uploaded on

Discrepancy Minimization by Walking on the Edges. Raghu Meka (IAS/DIMACS) Shachar Lovett (IAS). Discrepancy. Subsets Color with or - to minimize imbalance. 1 2 3 4 5. 1 2 3 4 5. 3. 1. 1. 0. 1. Discrepancy Examples. Fundamental combinatorial concept.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Discrepancy Minimization by Walking on the Edges' - penha


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
discrepancy minimization by walking on the edges

Discrepancy Minimization by Walking on the Edges

Raghu Meka (IAS/DIMACS)

Shachar Lovett (IAS)

discrepancy
Discrepancy
  • Subsets
  • Color with or -to minimize imbalance

1 2 3 4 5

123 45

3

1

1

0

1

discrepancy examples
Discrepancy Examples
  • Fundamental combinatorial concept
  • Arithmetic Progressions

Roth 64:

Matousek, Spencer 96:

discrepancy examples1
Discrepancy Examples
  • Fundamental combinatorial concept
  • Halfspaces

Alexander 90:

Matousek 95:

discrepancy examples2
Discrepancy Examples
  • Fundamental combinatorial concept
  • Axis-aligned boxes

Beck 81:

Srinivasan 97:

why discrepancy
Why Discrepancy?

Complexity theory

Communication Complexity

Computational Geometry

Pseudorandomness

Many more!

spencer s six sigma theorem
Spencer’s Six Sigma Theorem

Spencer 85: System with n sets has discrepancy at most .

“Six standard deviations suffice”

  • Central result in discrepancy theory.
  • Beats random:
  • Tight: Hadamard.
a conjecture and a disproof
A Conjecture and a Disproof

Conjecture (Alon, Spencer): No efficient algorithm can find one.

Bansal 10: Can efficiently get discrepancy .

Spencer 85: System with n sets has discrepancy at most .

  • Non-constructive pigeon-hole proof
this work
This Work

Main: Can efficiently find a coloring with discrepancy

New elemantary constructive proof of Spencer’s result

  • Truly constructive
  • Algorithmic partial coloring lemma
  • Extends to other settings

EDGE-WALK: New algorithmic tool

outline
Outline

Partial coloring Method

EDGE-WALK: Geometric picture

partial coloring method
Partial Coloring Method

Lemma: Can do this in randomized

time.

Input:

Output:

  • Focus on m = n case.
outline1
Outline

Partial coloring Method

EDGE-WALK: Geometric picture

discrepancy geometric view
Discrepancy: Geometric View
  • Subsets
  • Color with or -to minimize imbalance

123 45

3

1

1

0

1

discrepancy geometric view1
Discrepancy: Geometric View
  • Vectors
  • Want

123 45

discrepancy geometric view2
Discrepancy: Geometric View
  • Vectors
  • Want

Polytope view used earlier by Gluskin’ 88.

Goal: Find non-zero lattice points in

edge walk
Edge-Walk

Claim: Will find good partial coloring.

  • Start at origin
  • Gaussian walk until you hit a face
  • Gaussian walk within the face

Goal: Find non-zero lattice point in

edge walk algorithm
Edge-Walk: Algorithm

Gaussian random walk in subspaces

  • Subspace V, rate
  • Gaussian walk in V

Standard normal in V:

Orthonormal basis change

edge walk algorithm1
Edge-Walk Algorithm

Discretization issues: hitting faces

  • Might not hit face
  • Slack: face hit if close to it.
edge walk algorithm2
Edge-Walk: Algorithm
  • Input: Vectors
  • Parameters:

For

Cube faces nearly hit by .

Disc. faces nearly hit by .

Subspace orthongal to

edge walk intuition
Edge-Walk: Intuition

Discrepancy faces much farther than cube’s

Hit cube more often!

100

1

summary
Summary

Spencer’s Theorem

Edge-Walk: Algorithmic partial coloring lemma

Recurseon unfixed variables

open problems
Open Problems
  • Some promise: our PCL “stronger” than Beck’s

Q:

Beck-Fiala Conjecture 81: Discrepancy for degree t.

Q: Other applications?

General IP’s, Minkowski’s theorem?

main partial coloring lemma
Main Partial Coloring Lemma

Th: Given thresholds

Can find with

1.

2.

Algorithmic partial coloring lemma

ad