[CWW19] Xi Chen, Yining Wang, and Yu-Xiang Wang. Nonstationary stochastic optimization under  $L_{p,q}$ -variation measures. Operations Research, 67(6):1752-1765, 2019.
[Dau88] Ingrid Daubechies. Orthonormal bases of compactly supported wavelets. Communications on pure and applied mathematics, 41(7):909-996, 1988.
[DGSS15] Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz. Strongly adaptive online learning. In International Conference on Machine Learning, pages 1405-1411. PMLR, 2015.
[DHS11] John Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of machine learning research, 12(7), 2011.
[DSSST10] John C Duchi, Shai Shalev-Shwartz, Yoram Singer, and Ambuj Tewari. Composite objective mirror descent. In  $COLT$ , volume 10, pages 14-26. Citeseer, 2010.
[FKK16] Dean Foster, Satyen Kale, and Howard Karloff. Online sparse linear regression. In Conference on Learning Theory, pages 960-970. PMLR, 2016.
[FKMS17] Dylan J Foster, Satyen Kale, Mehryar Mohri, and Karthik Sridharan. Parameter-free online learning via model selection. Advances in Neural Information Processing Systems, 30, 2017.
[FRS18] Dylan J Foster, Alexander Rakhlin, and Karthik Sridharan. Online learning: Sufficient statistics and the Burkholder method. In Conference On Learning Theory, pages 3028-3064. PMLR, 2018.
[Ger13] Sébastien Gerchinovitz. Sparsity regret bounds for individual sequences in online linear regression. The Journal of Machine Learning Research, 14(1):729-769, 2013.
[GG15] Pierre Gaillard and Sébastien Gerchinovitz. A chaining algorithm for online nonparametric regression. In Conference on Learning Theory, pages 764-796. PMLR, 2015.
[GS16] Andras Gyorgy and Csaba Szepesvári. Shifting regret, mirror descent, and matrices. In International Conference on Machine Learning, pages 2943-2951. PMLR, 2016.
[GW18] Pierre Gaillard and Olivier Wintenberger. Efficient online algorithms for fast-rate regret bounds under sparsity. Advances in Neural Information Processing Systems, 31, 2018.
[GY14] Sébastien Gerchinovitz and Jia Yuan Yu. Adaptive and optimal online linear regression on  $L_{1}$ -balls. Theoretical Computer Science, 519:4-28, 2014.
[Haz16] Elad Hazan. Introduction to online convex optimization. Foundations and Trends® in Optimization, 2(3-4):157-325, 2016.
$\left[\mathrm{HLS}^{+}18\right]$  Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, and Yi Zhang. Spectral filtering for general linear dynamical systems. Advances in Neural Information Processing Systems, 31, 2018.
[HR09] Niall Hurley and Scott Rickard. Comparing measures of sparsity. IEEE Transactions on Information Theory, 55(10):4723-4741, 2009.
[HW01] Mark Herbster and Manfred K Warmuth. Tracking the best linear predictor. The Journal of Machine Learning Research, 1:281-309, 2001.
[HW15] Eric C Hall and Rebecca M Willett. Online convex optimization in dynamic environments. IEEE Journal of Selected Topics in Signal Processing, 9(4):647-662, 2015.
[JC22] Andrew Jacobsen and Ashok Cutkosky. Parameter-free mirror descent. In Conference on Learning Theory, pages 4160-4211. PMLR, 2022.
[Joh19] Iain M Johnstone. Gaussian estimation: Sequence and wavelet models. Unpublished lecture notes, 2019. https://imjohnstone.su Domains/GE_09_16_19.pdf.
[JOWW17] Kwang-Sung Jun, Francesco Orabona, Stephen Wright, and Rebecca Willett. Improved strongly adaptive online learning using coin betting. In Artificial Intelligence and Statistics, pages 943–951. PMLR, 2017.
[JRSS15] Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan. Online optimization: Competing with dynamic comparators. In Artificial Intelligence and Statistics, pages 398-406. PMLR, 2015.
[Kal14] Satyen Kale. Open problem: Efficient online sparse regression. In Conference on Learning Theory, pages 1299-1301. PMLR, 2014.