Document Open Access Logo

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing

Authors Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2022.13.pdf
  • Filesize: 0.82 MB
  • 22 pages

Document Identifiers

Author Details

Nikhil Bansal
  • University of Michigan, Ann Arbor, MI, USA
Haotian Jiang
  • University of Washington, Seattle, WA, USA
Raghu Meka
  • University of California, Los Angeles, CA, USA
Sahil Singla
  • Georgia Institute of Technology, Atlanta, GA, USA
Makrand Sinha
  • Simons Institute, Berkeley, CA, USA
  • University of California, Berkeley, CA, USA

Acknowledgements

The authors would like to thank the anonymous reviewers of ITCS 2022 for helpful comments.

Cite AsGet BibTex

Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha. Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 13:1-13:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ITCS.2022.13

Abstract

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 ℝ^d, find ± signs for each of them such that the signed sum vector along any prefix has a small 𝓁_∞-norm? This problem is central to proving upper bounds for the Steinitz problem, and the popular Komlós problem is a special case where one is only concerned with the final signed sum vector instead of all prefixes. Banaszczyk gave an O(√{log d+ log T}) bound for the prefix discrepancy problem. We investigate the tightness of Banaszczyk’s bound and consider natural generalizations of prefix discrepancy: - We first consider a smoothed analysis setting, where a small amount of additive noise perturbs the input vectors. We show an exponential improvement in T compared to Banaszczyk’s bound. Using a primal-dual approach and a careful chaining argument, we show that one can achieve a bound of O(√{log d+ log log T}) with high probability in the smoothed setting. Moreover, this smoothed analysis bound is the best possible without further improvement on Banaszczyk’s bound in the worst case. - We also introduce a generalization of the prefix discrepancy problem to arbitrary DAGs. Here, vertices correspond to unit vectors, and the discrepancy constraints correspond to paths on a DAG on T vertices - prefix discrepancy is precisely captured when the DAG is a simple path. We show that an analog of Banaszczyk’s O(√{log d+ log T}) bound continues to hold in this setting for adversarially given unit vectors and that the √{log T} factor is unavoidable for DAGs. We also show that unlike for prefix discrepancy, the dependence on T cannot be improved significantly in the smoothed case for DAGs. - We conclude by exploring a more general notion of vector balancing, which we call combinatorial vector balancing. In this problem, the discrepancy constraints are generalized from paths of a DAG to an arbitrary set system. We obtain near-optimal bounds in this setting, up to poly-logarithmic factors.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatoric problems
Keywords
  • Prefix discrepancy
  • smoothed analysis
  • combinatorial vector balancing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ryan Alweiss, Yang P. Liu, and Mehtaab Sawhney. Discrepancy minimization via a self-balancing walk. In Proceedings of STOC, 2021. Google Scholar
  2. Wojciech Banaszczyk. Balancing vectors and Gaussian measures of n-dimensional convex bodies. Random Struct. Algorithms, 12(4):351-360, 1998. Google Scholar
  3. Wojciech Banaszczyk. On series of signed vectors and their rearrangements. Random Struct. Algorithms, 40(3):301-316, 2012. Google Scholar
  4. Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha. Online discrepancy minimization for stochastic arrivals. In Proceedings of SODA, pages 2842-2861, 2021. Google Scholar
  5. Nikhil Bansal, Haotian Jiang, Sahil Singla, and Makrand Sinha. Online vector balancing and geometric discrepancy. In Proceedings of STOC, pages 1139-1152, 2020. Google Scholar
  6. Nikhil Bansal and Raghu Meka. On the discrepancy of random low degree set systems. In Proceedings of SODA 2019, pages 2557-2564, 2019. Google Scholar
  7. Imre Bárány. A vector-sum theorem and its application to improving flow shop guarantees. Math. Oper. Res., 6(3):445-452, 1981. Google Scholar
  8. Imre Bárány and Victor S Grinberg. On some combinatorial questions in finite-dimensional spaces. Linear Algebra and its Applications, 41:1-9, 1981. Google Scholar
  9. Kevin Buchin, Jiří Matoušek, Robin A. Moser, and Dömötör Pálvölgyi. Vectors in a box. Math. Program., 135(1-2):323-335, 2012. Google Scholar
  10. Bernard Chazelle. The discrepancy method: randomness and complexity. Cambridge University Press, 2001. Google Scholar
  11. Sergej Chobanyan. Convergence as of rearranged random series in Banach space and associated inequalities. In Probability in Banach Spaces, 9, pages 3-29. Springer, 1994. Google Scholar
  12. Friedrich Eisenbrand and Robert Weismantel. Proximity results and faster algorithms for integer programming using the steinitz lemma. In Proceedings of SODA, pages 808-816, 2018. Google Scholar
  13. Esther Ezra and Shachar Lovett. On the Beck-Fiala conjecture for random set systems. Random Struct. Algorithms, 54(4):665-675, 2019. Google Scholar
  14. Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty. Smoothed analysis with adaptive adversaries. CoRR, abs/2102.08446, 2021. Google Scholar
  15. Rebecca Hoberg and Thomas Rothvoss. A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. In Proceedings of SODA, pages 2547-2556, 2019. Google Scholar
  16. Klaus Jansen and Lars Rohwedder. On integer programming and convolution. In Proceedings of ITCS, pages 43:1-43:17, 2019. Google Scholar
  17. László Lovász, Joel Spencer, and Katalin Vesztergombi. Discrepancy of set-systems and matrices. European Journal of Combinatorics, 7(2):151-160, 1986. Google Scholar
  18. Jiří Matoušek, Aleksandar Nikolov, and Kunal Talwar. Factorization norms and hereditary discrepancy. CoRR, abs/1408.1376, 2014. Google Scholar
  19. Jiří Matousek. Geometric discrepancy: An illustrated guide, volume 18. Springer Science & Business Media, 2009. Google Scholar
  20. Daniele Micciancio and Panagiotis Voulgaris. Faster exponential time algorithms for the shortest vector problem. In Proceedings of SODA, pages 1468-1480, 2010. Google Scholar
  21. Aleksandar Nikolov. Tighter bounds for the discrepancy of boxes and polytopes. Mathematika, 63(3):1091-1113, 2017. Google Scholar
  22. Aditya Potukuchi. A spectral bound on hypergraph discrepancy. In Proceedings of ICALP, pages 93:1-93:14, 2020. Google Scholar
  23. Tim Roughgarden, editor. Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press, 2020. Google Scholar
  24. Sergey Sevast'janov. On some geometric methods in scheduling theory: A survey. Discret. Appl. Math., 55(1):59-82, 1994. Google Scholar
  25. Joel Spencer. Balancing games. J. Comb. Theory, Ser. B, 23(1):68-74, 1977. Google Scholar
  26. Joel Spencer. Balancing vectors in the max norm. Combinatorica, 6(1):55-65, 1986. Google Scholar
  27. Daniel A Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM (JACM), 51(3):385-463, 2004. Google Scholar
  28. Ernst Steinitz. Bedingt konvergente reihen und konvexe systeme.(schluß.). Journal für die reine und angewandte Mathematik, 146:1-52, 1916. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail