The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains

Daron Anderson, Douglas J. Leith. The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 5874-5884, 2021. [doi]

@inproceedings{AndersonL21,
  title = {The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains},
  author = {Daron Anderson and Douglas J. Leith},
  year = {2021},
  url = {https://proceedings.neurips.cc/paper/2021/hash/2e907f44e0a9616314cf3d964d4e3c93-Abstract.html},
  researchr = {https://researchr.org/publication/AndersonL21},
  cites = {0},
  citedby = {0},
  pages = {5874-5884},
  booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual},
  editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan},
}