Algorithmic discrepancy beyond partial coloring

@article{Bansal2017AlgorithmicDB,
  title={Algorithmic discrepancy beyond partial coloring},
  author={Nikhil Bansal and Shashwat Garg},
  journal={Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing},
  year={2017}
}
  • N. Bansal, S. Garg
  • Published 6 November 2016
  • Mathematics, Computer Science
  • Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number of times, and the errors can add up in an adversarial way. We give a new and general algorithmic framework that overcomes the limitations of the partial coloring method and can be applied in a black-box manner to various problems. Using this framework, we give… 
Improved Algorithms for Combinatorial Discrepancy
Discrepancy theory is a subfield of combinatorics which has branched in Computer Science due to several connections it has to geometric problems, randomized algorithms and complexity theory [13, 8].
Algorithms for combinatorial discrepancy
  • S. Garg
  • Mathematics, Computer Science
  • 2018
TLDR
This thesis first attempted to solve the problem of discrepancy minimization using a convex geometric approach which led to improved algorithms in some regimes, and developed an algorithm for the most important special case when the convex body K is a scaling of the hypercube.
On Shallow Packings and Tusnády's Problem
TLDR
The notion of shallow cell complexity and the shallow packing lemma, together with the chaining technique, is used to obtain an improved decomposition of the set system and yields improved algorithmic bounds on Tusnády's problem.
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
  • N. Bansal, D. Dadush, S. Garg
  • Computer Science, Mathematics
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
TLDR
An efficient algorithm is given that finds a coloring with discrepancy O((t log n)1/2), matching the best known non-constructive bound for the problem due to Banaszczyk, and gives an algorithmic O(log 1/2 n) bound.
A new framework for matrix discrepancy: partial coloring bounds via mirror descent
TLDR
The matrix Spencer conjecture is reduced to the existence of a O(log(m/n) quantum relative entropy net on the spectraplex using a Gaussian measure lower bound of 2−O(n) for a scaling of the discrepancy body.
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing
A well-known result of Banaszczyk in discrepancy theory concerns the prefix discrepancy problem (also known as the signed series problem): given a sequence of T unit vectors in R d , find ± signs for
Tighter Bounds for the Discrepancy of Boxes and Polytopes
TLDR
New discrepancy upper bounds for geometrically defined set systems include sets induced by axis-aligned boxes, whose discrepancy is the subject of the well known Tusnady problem, are proved by extending the approach based on factorization norms previously used by the author and Matousek.
Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization
TLDR
It is shown that the discrepancy of the above problem is sub-polynomial in $n$ and that no algorithm can achieve a constant discrepancy, and a natural generalization of this problem to $2-dimensions where the points arrive uniformly at random in a unit square is obtained.
Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere
TLDR
The algorithm is used to give the first non-trivial lower bounds for the problem of covering a hypersphere by hyperspherical caps of uniform volume at least $2^{-o(\sqrt{n})}$.
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma
TLDR
The Steinitz lemma is used to show that the ℓ1-distance of an optimal integer and fractional solution, also under the presence of upper bounds on the variables, is bounded by m ⋅ (2,m⋅ Δ +1)m.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
Constructive Discrepancy Minimization by Walking on the Edges
TLDR
A new randomized algorithm to find a coloring as in Spencer's result based on a restricted random walk which is “truly” constructive in that it does not appeal to the existential arguments, giving a new proof of Spencer's theorem and the partial coloring lemma.
Efficient algorithms for discrepancy minimization in convex sets
TLDR
A constructive version of the result of Gluskin and Giannopoulos, in which the coloring is attained via the optimization of a linear function is proved, which implies a linear programming based algorithm for combinatorial discrepancy obtaining the same result as Spencer.
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
  • N. Bansal, D. Dadush, S. Garg
  • Computer Science, Mathematics
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
TLDR
An efficient algorithm is given that finds a coloring with discrepancy O((t log n)1/2), matching the best known non-constructive bound for the problem due to Banaszczyk, and gives an algorithmic O(log 1/2 n) bound.
Constructive Discrepancy Minimization for Convex Sets
  • T. Rothvoss
  • Mathematics
    2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
TLDR
It is shown that for any symmetric convex set K with measure at least e-n/500, the following algorithm finds a point y ∈ K ∩ [-1, 1]n with Ω(n) coordinates in ±1: (1) take a random Gaussian vector x, (2) compute the point y in K∩ [- 1, 1)n that is closest to x.
Roth’s estimate of the discrepancy of integer sequences is nearly sharp
TLDR
It is proved that R(N)=N1/4+o(1) thus showing that Roth’s original lower bound was essentially best possible, and the notion ofdiscrepancy of hypergraphs is introduced and derive an upper bound from which the above result follows.
Tighter Bounds for the Discrepancy of Boxes and Polytopes
TLDR
New discrepancy upper bounds for geometrically defined set systems include sets induced by axis-aligned boxes, whose discrepancy is the subject of the well known Tusnady problem, are proved by extending the approach based on factorization norms previously used by the author and Matousek.
Discrepancy Without Partial Colorings
TLDR
This work has devised the first algorithm for Spencer's theorem that directly computes a coloring, without recursively computing partial colorings.
Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems
TLDR
Improved upper bounds on the discrepancy of two well-studied families of sparse matrices: e permutations of [n], and rectangles containing n points in Rk are shown, and a discrepancy bound of O(&logn) is shown for the former, improving on the previous-best O( logn) due to Bohus.
On the Discrepancy for Boxes and Polytopes
Abstract. We consider so-called Tusnády’s problem in dimension d: Given an n-point set P in Rd, color the points of P red or blue in such a way that for any d-dimensional interval B, the number of
...
...