Gaussian discrepancy: A probabilistic relaxation of vector balancing
Gaussian discrepancy: A probabilistic relaxation of vector balancing
复制标题
高斯差异:矢量平衡的概率松弛
DOI:
10.1016/j.dam.2022.08.007
复制
发表时间:
2022
影响因子:
1.1
通讯作者:
Turner, Paxton
中科院分区:
文献类型:
--
作者:
Chewi, Sinho;Gerber, Patrik;Rigollet, Philippe;Turner, Paxton
We introduce a novel relaxation of combinatorial discrepancy calledGaussian discrepancy, whereby binary signings are replaced with correlated standard Gaussian random variables. This relaxation effectively reformulates an optimization problem over the Boolean hypercube into one over the space of correlation matrices. We show that Gaussian discrepancy is a tighter relaxation than the previously studied vector and spherical discrepancy problems, and we construct a fast online algorithm that achieves a version of the Banaszczyk bound for Gaussian discrepancy. This work also raises new questions such as the Komlós conjecture for Gaussian discrepancy, which may shed light on classical discrepancy problems.