On-line balancing of random inputs
From MaRDI portal
Publication:3386519
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 734955 (Why is no real title available?)
- Deterministic discrepancy minimization
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- On Khintchine inequalities with a weight
- On a class of balancing games
- On a lemma of Littlewood and Offord
- Six Standard Deviations Suffice
- Twice-Ramanujan sparsifiers
Cited in
(9)- Vector Balancing Games with Aging
- Vector balancing games with aging
- On the atypical solutions of the symmetric binary perceptron
- Balancing game with a buffer
- 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)