Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond

@InProceedings{pmlr-v151-baby22a,
  title = 	 { Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond },
  author =       {Baby, Dheeraj and Wang, Yu-Xiang},
  booktitle = 	 {Proceedings of The 25th International Conference on Artificial Intelligence and Statistics},
  pages = 	 {1805--1845},
  year = 	 {2022},
  editor = 	 {Camps-Valls, Gustau and Ruiz, Francisco J. R. and Valera, Isabel},
  volume = 	 {151},
  series = 	 {Proceedings of Machine Learning Research},
  month = 	 {28--30 Mar},
  publisher =    {PMLR},
  pdf = 	 {https://proceedings.mlr.press/v151/baby22a/baby22a.pdf},
  url = 	 {https://proceedings.mlr.press/v151/baby22a.html},
  abstract = 	 { We study the framework of