[33] Nick Gravin, Yuval Peres, and Balasubramanian Sivan. Tight lower bounds for multiplicative weights algorithmic families. In 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017. 1, 1
[34] Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, and Uri Stemmer. Adversarily robust streaming algorithms via differential privacy. In Advances in Neural Information Processing Systems (NeurIPS), 2020. 1.2, 2.2, A
[35] David Haussler, Jyrki Kivinen, and Manfred K Warmuth. Tight worst-case loss bounds for predicting with expert advice. In European Conference on Computational Learning Theory (EuroCOLT), 1995. 1.2
[36] David P Helmbold and Robert E Schapire. Predicting nearly as well as the best pruning of a decision tree. Machine Learning, 27(1):51-68, 1997. 1.2
[37] Daniel A Herrmann. Prediction with expert advice applied to the problem of prediction with expert advice. Synthese, 200(4):1-24, 2022. 1.2
[38] Adam Tauman Kalai and Santosh S. Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291-307, 2005. 1, 1.2
[39] Akshay Kamath, Eric Price, and David P Woodruff. A simple proof of a new set disjointness with applications to data streams. In 36th Computational Complexity Conference (CCC), 2021. 1.1, E.4, E.5
[40] Robert D. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. In Advances in Neural Information Processing (NIPS), 2004. A
[41] Aryeh Kontorovich, Menachem Sadigurschi, and Uri Stemmer. Adaptive data analysis with correlated observations. In International Conference on Machine Learning, ICML, pages 11483-11498, 2022. A
[42] Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Inf. Comput., 108(2):212-261, 1994. 1, 1, 1.2
[43] Wolfgang Maass and Manfred K Warmuth. Efficient learning with virtual threshold gates. Information and Computation, 141(1):66-83, 1998. 1.2
[44] H. Brendan McMahan and Avrim Blum. Online geometric optimization in the bandit setting against an adaptive adversary. In 17th Annual Conference on Learning Theory, (COLT), 2004. A
[45] Neri Merhav, Erik Ordentlich, Gadiel Seroussi, and Marcelo J. Weinberger. On sequential strategies for loss functions with memory. IEEE Trans. Inf. Theory, 48(7):1947-1958, 2002. A
[46] Binghui Peng and Aviad Rubinstein. Near optimal memory-regret tradeoff for online learning, 2023. 1.2
[47] Binghui Peng and Fred Zhang. Online prediction in sub-linear space. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023. 1, 1, 1.2, A
[48] Chloe Rouyer, Yevgeny Seldin, and Nicolo Cesa-Bianchi. An algorithm for stochastic and adversarial bandits with switching costs. In Proceedings of the 38th International Conference on Machine Learning (ICML), 2021. A
[49] Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, and Samson Zhou. Memory bounds for the experts problem. In 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC), 2022. 1, 1, 1.1, 1.2, 3.2, 4, 6, D.1, D.1, D.1, D.3, D.1
[50] Eiji Takimoto, Akira Maruoka, and Vladimir Vovk. Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. Theor. Comput. Sci., 261(1):179-209, 2001. 1.2
[51] Flemming Topsøe. Bounds for entropy and divergence for distributions over a two-element set. J. Ineq. Pure & Appl. Math, 2(2):300, 2001. B.1