Efficient and Optimal Fixed-Time Regret with Two Experts

Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella. Efficient and Optimal Fixed-Time Regret with Two Experts. In Sanjoy Dasgupta, Nika Haghtalab, editors, International Conference on Algorithmic Learning Theory, 29-1 April 2022, Paris, France. Volume 167 of Proceedings of Machine Learning Research, pages 436-464, PMLR, 2022. [doi]

@inproceedings{GreenstreetHP22,
  title = {Efficient and Optimal Fixed-Time Regret with Two Experts},
  author = {Laura Greenstreet and Nicholas J. A. Harvey and Victor Sanches Portella},
  year = {2022},
  url = {https://proceedings.mlr.press/v167/greenstreet22a.html},
  researchr = {https://researchr.org/publication/GreenstreetHP22},
  cites = {0},
  citedby = {0},
  pages = {436-464},
  booktitle = {International Conference on Algorithmic Learning Theory, 29-1 April 2022, Paris, France},
  editor = {Sanjoy Dasgupta and Nika Haghtalab},
  volume = {167},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}