# Online Discrepancy Minimization for Stochastic Arrivals

Haotian Jiang
Makrand Sinha

Abstract:

In the stochastic online vector balancing problem, vectors $v_1,v_2,\ldots,v_T$ chosen independently from an arbitrary distribution in $\mathbb{R}^n$ arrive one-by-one and must be immediately given a $\pm$ sign. The goal is to keep the norm of the discrepancy vector, i.e., the signed prefix-sum, as small as possible for a given target n...More

Code:

Data: