New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees

Dan Garber, Ben Kretzu. New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees. In Po-Ling Loh, Maxim Raginsky, editors, Conference on Learning Theory, 2-5 July 2022, London, UK. Volume 178 of Proceedings of Machine Learning Research, pages 2326-2359, PMLR, 2022. [doi]

@inproceedings{GarberK22,
  title = {New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees},
  author = {Dan Garber and Ben Kretzu},
  year = {2022},
  url = {https://proceedings.mlr.press/v178/garber22a.html},
  researchr = {https://researchr.org/publication/GarberK22},
  cites = {0},
  citedby = {0},
  pages = {2326-2359},
  booktitle = {Conference on Learning Theory, 2-5 July 2022, London, UK},
  editor = {Po-Ling Loh and Maxim Raginsky},
  volume = {178},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}