2000 character limit reached
Discrepancy Minimization via a Self-Balancing Walk
Published 24 Jun 2020 in cs.DS, cs.DM, and math.PR | (2006.14009v2)
Abstract: We study discrepancy minimization for vectors in $\mathbb{R}n$ under various settings. The main result is the analysis of a new simple random process in multiple dimensions through a comparison argument. As corollaries, we obtain bounds which are tight up to logarithmic factors for several problems in online vector balancing posed by Bansal, Jiang, Singla, and Sinha (STOC 2020), as well as linear time algorithms for logarithmic bounds for the Koml\'{o}s conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.