Efficient Bandit Convex Optimization: Beyond Linear Losses

Arun Sai Suggala, Pradeep Ravikumar, Praneeth Netrapalli. Efficient Bandit Convex Optimization: Beyond Linear Losses. 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 4008-4067, PMLR, 2021. [doi]

@inproceedings{SuggalaRN21,
  title = {Efficient Bandit Convex Optimization: Beyond Linear Losses},
  author = {Arun Sai Suggala and Pradeep Ravikumar and Praneeth Netrapalli},
  year = {2021},
  url = {http://proceedings.mlr.press/v134/suggala21a.html},
  researchr = {https://researchr.org/publication/SuggalaRN21},
  cites = {0},
  citedby = {0},
  pages = {4008-4067},
  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},
}