1. On the Complexity of Finite Sequences
2. Optimal prefetching via data compression
3. Mirror descent meets fixed share (and feels no regret);cesa-bianchi;Advances in neural information processing systems,2012
4. Minimax regret of switching-constrained online convex optimization: No phase transition;chen;Advances in neural information processing systems,2020
5. Adaptive algorithms for online decision problems;hazan;Electronic Colloquium on Computational Complexity (ECCC),2007