Uri Sherman, Tomer Koren. Lazy OCO: Online Convex Optimization on a Switching Budget. In Mikhail Belkin, Samory Kpotufe, editors, Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA. Volume 134 of Proceedings of Machine Learning Research, pages 3972-3988, PMLR, 2021. [doi]
@inproceedings{ShermanK21,
title = {Lazy OCO: Online Convex Optimization on a Switching Budget},
author = {Uri Sherman and Tomer Koren},
year = {2021},
url = {http://proceedings.mlr.press/v134/sherman21a.html},
researchr = {https://researchr.org/publication/ShermanK21},
cites = {0},
citedby = {0},
pages = {3972-3988},
booktitle = {Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA},
editor = {Mikhail Belkin and Samory Kpotufe},
volume = {134},
series = {Proceedings of Machine Learning Research},
publisher = {PMLR},
}