On-line balancing of random inputs
From MaRDI portal
Publication:3386519
DOI10.1002/RSA.20955zbMATH Open1454.91051arXiv1903.06898OpenAlexW3080328610MaRDI QIDQ3386519FDOQ3386519
Authors: N. Bansal, Joel Spencer
Publication date: 5 January 2021
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Abstract: We consider an online vector balancing game where vectors , chosen uniformly at random in , arrive over time and a sign must be picked immediately upon the arrival of . The goal is to minimize the norm of the signed sum . We give an online strategy for picking the signs that has value with high probability. Up to constants, this is the best possible even when the vectors are given in advance.
Full work available at URL: https://arxiv.org/abs/1903.06898
Recommendations
Cites Work
- Twice-Ramanujan sparsifiers
- Six Standard Deviations Suffice
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- On a lemma of Littlewood and Offord
- Title not available (Why is that?)
- On Khintchine inequalities with a weight
- On a class of balancing games
- Deterministic discrepancy minimization
Cited In (8)
- Vector balancing games with aging
- Vector Balancing Games with Aging
- On the atypical solutions of the symmetric binary perceptron
- Balancing vectors in the max norm
- Discrepancy theory and related algorithms
- Algorithmic pure states for the negative spherical perceptron
- Searching for (sharp) thresholds in random structures: where are we now?
- Gaussian discrepancy: a probabilistic relaxation of vector balancing
This page was built for publication: On-line balancing of random inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386519)