Hedyeh Beyhaghi

Efficient Online Proportional Sampling with Applications to Smoothed Online Learning

Under a $\sigma$-smoothed adaptive adversary, a tight $O(\sqrt{\sigma T})$ bound on the depth of the data structure is proved, and an $O(\log T)$ bound under a random-order adversary is proved -- to the authors' knowledge, the first such results for this class of problems.