Improved Regret Bounds for Projection-free Bandit Convex Optimization

Dan Garber, Ben Kretzu. Improved Regret Bounds for Projection-free Bandit Convex Optimization. In Silvia Chiappa, Roberto Calandra, editors, The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy]. Volume 108 of Proceedings of Machine Learning Research, pages 2196-2206, PMLR, 2020. [doi]

@inproceedings{GarberK20,
  title = {Improved Regret Bounds for Projection-free Bandit Convex Optimization},
  author = {Dan Garber and Ben Kretzu},
  year = {2020},
  url = {http://proceedings.mlr.press/v108/garber20a.html},
  researchr = {https://researchr.org/publication/GarberK20},
  cites = {0},
  citedby = {0},
  pages = {2196-2206},
  booktitle = {The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy]},
  editor = {Silvia Chiappa and Roberto Calandra},
  volume = {108},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}