[7] Nicoló Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz. Improved second-order bounds for prediction with expert advice. Mach. Learn., 66:321-352, 2007.
[8] Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu. Online Optimization with Gradual Variations. In Proc. 25th Annu. Conf. Learning Theory, volume 23, pages 6.1-6.20, 2012.
[9] Thomas M Cover. Universal portfolios. Math. Financ., 1991.
[10] Thomas M. Cover and Erick Ordentlich. Universal portfolios with side information. IEEE Trans. Inf. Theory, 42(2):348-363, 1996.
[11] H. Gzyl and F. Nielsen. Geometry of the probability simplex and its connection to the maximum entropy method. J. Appl. Math., Stat. Inf., 16(1):25-35, 2020.
[12] Elad Hazan. Introduction to Online Convex Optimization. The MIT Press, 2022.
[13] Elad Hazan and Satyen Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. Mach. Learn., 80:165-188, 2010.
[14] Elad Hazan and Satyen Kale. An Online Portfolio Selection Algorithm with Regret Logarithmic in Price Variation. Math. Financ., 25(2):288-310, 2015.
[15] David P. Helmbold, Robert E. Schapire, Yoran Singer, and Manfred K. Warmuth. On-Line Portfolio Selection Using Multiplicative Updates. Math. Financ., 8(4):325-347, 1998.
[16] Zihao Hu, Guanghui Wang, and Jacob Abernethy. Minimizing Dynamic Regret on Geodesic Metric Spaces. arXiv preprint arXiv:2302.08652, 2023.
[17] Rémi Jézquel, Dmitrii M. Ostrovskii, and Pierre Gaillard. Efficient and Near-Optimal Online Portfolio Selection. arXiv preprint arXiv:2209.13932, 2022.
[18] Pooria Joulani, András György, and Csaba Szepesvári. A Modular Analysis of Adaptive (Non-) Convex Optimization: Optimism, Composite Objectives, and Variational Bounds. In Proc. 28th Int. Conf. Algorithmic Learning Theory, volume 76, pages 681-720, 2017.
[19] Pooria Joulani, András György, and Csaba Szepesvári. A modular analysis of adaptive (non-) convex optimization: Optimism, composite objectives, variance reduction, and variational bounds. Theor. Comput. Sci., 808:108-138, 2020. Special Issue on Algorithmic Learning Theory.
[20] A. Kalai and S. Vempala. Efficient Algorithms for Universal Portfolios. In Proc. 41st Annu. Symposium on Foundations of Computer Science, pages 486-491, 2000.
[21] Haihao Lu, Robert M. Freund, and Yurii Nesterov. Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim., 28(1):333-354, 2018.
[22] Haipeng Luo, Chen-Yu Wei, and Kai Zheng. Efficient Online Portfolio with Logarithmic Regret. In Adv. Neural Information Processing Systems, volume 31, 2018.
[23] H. Brendan McMahan. A survey of Algorithms and Analysis for Adaptive Online Learning. J. Mach. Learn. Res., 18(90):1-50, 2017.
[24] Zakaria Mhammedi and Alexander Rakhlin. Damped Online Newton Step for Portfolio Selection. In Proc. 35th Annu. Conf. Learning Theory, 2022.
[25] Mehryar Mohri and Scott Yang. Accelerating Online Convex Optimization via Adaptive Prediction. In Proc. 19th Int. Conf. Artificial Intelligence and Statistics, volume 51, pages 848-856, 2016.
[26] Yurii Nesterov. Barrier subgradient method. Math. Program., Ser. B, 127:31-56, 2011.
[27] Yuri Nesterov. Lectures on Convex Optimization. Springer, second edition, 2018.
[28] Francesco Orabona. A Modern Introduction to Online Learning. arXiv preprint arXiv:1912.13213, 2022.