[KKLP17] Satyen Kale, Zohar Karnin, Tengyuan Liang, and David Pal. Adaptive feature selection: Computationally efficient online sparse linear regression under rip. In International Conference on Machine Learning, pages 1780-1788. PMLR, 2017.
[KM16] Vitaly Kuznetsov and Mehryar Mohri. Time series prediction and online learning. In Conference on Learning Theory, pages 1190–1213. PMLR, 2016.
[LLZ09] John Langford, Lihong Li, and Tong Zhang. Sparse online learning via truncated gradient. Journal of Machine Learning Research, 10(3), 2009.
[LS15] Haipeng Luo and Robert E Schapire. Achieving all with no parameters: Adanormalhedge. In Conference on Learning Theory, pages 1286-1304. PMLR, 2015.
[MA13] Brendan McMahan and Jacob Abernethy. Minimax optimal algorithms for unconstrained linear optimization. Advances in Neural Information Processing Systems, 26:2724-2732, 2013.
[Mal08] Stephane Mallat. A Wavelet Tour of Signal Processing: The Sparse Way. Academic Press, 2008.
[MK20] Zakaria Mhammedi and Wouter M Koolen. Lipschitz and comparator-norm adaptivity in online learning. In Conference on Learning Theory, pages 2858-2887. PMLR, 2020.
[MO14] H Brendan McMahan and Francesco Orabona. Unconstrained online linear learning in hilbert spaces: Minimax algorithms and normal approximations. In Conference on Learning Theory, pages 1020-1039. PMLR, 2014.
[OP16] Francesco Orabona and David Pál. Coin betting and parameter-free online learning. Advances in Neural Information Processing Systems, 29, 2016.
[Ora19] Francesco Orabona. A modern introduction to online learning. arXiv preprint arXiv:1912.13213, 2019.
[Pri21] Eric Price. Sparse recovery. In Tim Roughgarden, editor, Beyond the Worst-Case Analysis of Algorithms, page 140–164. Cambridge University Press, 2021.
[RS14a] Alexander Rakhlin and Karthik Sridharan. Online non-parametric regression. In Conference on Learning Theory, pages 1232-1264. PMLR, 2014.
[RS14b] Alexander Rakhlin and Karthik Sridharan. Statistical learning and sequential prediction. Unpublished lecture notes, 2014. http://www.mit.edu/~rakhlin/courses/stat928/stat928_notes.pdf.
$\left[\mathrm{SBG}^{+}21\right]$  Martin G Schultz, Clara Betancourt, Bing Gong, Felix Kleinert, Michael Langguth, Lukas Hubert Leufen, Amirpasha Mozaffari, and Scarlet Stadtler. Can deep learning beat numerical weather prediction? Philosophical Transactions of the Royal Society A, 379(2194):20200097, 2021.
[SM12] Matthew Streeter and Brendan McMahan. No-regret algorithms for unconstrained online convex optimization. Advances in Neural Information Processing Systems, 25, 2012.
[SS11] Shai Shalev-Shwartz. Online learning and online convex optimization. Foundations and trends in Machine Learning, 4(2):107-194, 2011.
[SST11] Shai Shalev-Shwartz and Ambuj Tewari. Stochastic methods for  $L_{1}$ -regularized loss minimization. Journal of Machine Learning Research, 12:1865-1892, 2011.
[Tib96] Robert Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B (Methodological), 58(1):267-288, 1996.
[vdH19] Dirk van der Hoeven. User-specified local differential privacy in unconstrained adaptive online learning. Advances in Neural Information Processing Systems, 32, 2019.
[Vov01] Volodya Vovk. Competitive on-line statistics. International Statistical Review, 69(2):213-248, 2001.
[Xia09] Lin Xiao. Dual averaging method for regularized stochastic learning and online optimization. Advances in Neural Information Processing Systems, 22, 2009.
[YZJY16] Tianbao Yang, Lijun Zhang, Rong Jin, and Jinfeng Yi. Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient. In International Conference on Machine Learning, pages 449-457. PMLR, 2016.