Vector Balancing in Lebesgue Spaces

A tantalizing conjecture in discrete mathematics is the one of Komlos, suggesting that for any vectors $\mathbf{a}_1,\ldots,\mathbf{a}_n \in B_2^m$ there exist signs $x_1, \dots, x_n \in \{ -1,1\}$ so that $\|\sum_{i=1}^n x_i\mathbf{a}_i\|_\infty \le O(1)$. It is a natural extension to ask what $\ell_q$-norm bound to expect for $\mathbf{a}_1,\ldots,\mathbf{a}_n \in B_p^m$. We prove that, for $2 \le p \le q \le \infty$, such vectors admit fractional colorings $x_1, \dots, x_n \in [-1,1]$ with a linear number of $\pm 1$ coordinates so that $\|\sum_{i=1}^n x_i\mathbf{a}_i\|_q \leq O(\sqrt{\min(p,\log(2m/n))}) \cdot n^{1/2-1/p+ 1/q}$, and that one can obtain a full coloring at the expense of another factor of $\frac{1}{1/2 - 1/p + 1/q}$. In particular, for $p \in (2,3]$ we can indeed find signs $\mathbf{x} \in \{ -1,1\}^n$ with $\|\sum_{i=1}^n x_i\mathbf{a}_i\|_\infty \le O(n^{1/2-1/p} \cdot \frac{1}{p-2})$. Our result generalizes Spencer's theorem, for which $p = q = \infty$, and is tight for $m = n$. Additionally, we prove that for any fixed constant $\delta>0$, in a centrally symmetric body $K \subseteq \mathbb{R}^n$ with measure at least $e^{-\delta n}$ one can find such a fractional coloring in polynomial time. Previously this was known only for a small enough constant -- indeed in this regime classical nonconstructive arguments do not apply and partial colorings of the form $\mathbf{x} \in \{ -1,0,1\}^n$ do not necessarily exist.

[1]  Thomas Rothvoß,et al.  Constructive Discrepancy Minimization for Convex Sets , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[2]  Wojciech Banaszczyk,et al.  Balancing vectors and Gaussian measures of n-dimensional convex bodies , 1998, Random Struct. Algorithms.

[3]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[4]  Shachar Lovett,et al.  Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem , 2016, APPROX-RANDOM.

[5]  J. Spencer Six standard deviations suffice , 1985 .

[6]  W. Banaszczyk Balancing vectors and convex bodies , 1993 .

[7]  Aleksandar Nikolov,et al.  Balancing Vectors in Any Norm , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  E. Gluskin EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES , 1989 .

[9]  Dariusz Matlak,et al.  Royen’s Proof of the Gaussian Correlation Inequality , 2015, 1512.08776.

[10]  Z. Šidák Rectangular Confidence Regions for the Means of Multivariate Normal Distributions , 1967 .

[11]  A. Giannopoulos On some vector balancing problems , 1997 .

[12]  Mohit Singh,et al.  Efficient algorithms for discrepancy minimization in convex sets , 2014, Random Struct. Algorithms.

[13]  Shachar Lovett,et al.  The Gram-Schmidt walk: a cure for the Banaszczyk blues , 2017, STOC.

[14]  R. Handel Probability in High Dimension , 2014 .

[15]  Avi Levy,et al.  Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method , 2016, IPCO.

[16]  C. G. Khatri,et al.  On Certain Inequalities for Normal Distributions and their Applications to Simultaneous Confidence Bounds , 1967 .

[17]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[18]  T. Royen,et al.  A simple proof of the Gaussian correlation conjecture extended to multivariate gamma distributions , 2014, 1408.1028.

[19]  Nicholas Weaver The Kadison-Singer problem in discrepancy theory , 2004, Discret. Math..

[20]  V. Milman,et al.  Asymptotic Geometric Analysis, Part I , 2015 .

[21]  Anastasios Zouzias,et al.  A Matrix Hyperbolic Cosine Algorithm and Applications , 2011, ICALP.

[22]  Shachar Lovett,et al.  Constructive Discrepancy Minimization by Walking on the Edges , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[23]  H. König,et al.  Asymptotic Geometric Analysis , 2015 .

[24]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[25]  Alain Pajor,et al.  Convex bodies with few faces , 1989 .

[26]  S. Mendelson,et al.  A probabilistic approach to the geometry of the ℓᵨⁿ-ball , 2005, math/0503650.