An Algorithm for Stochastic and Adversarial Bandits with Switching Costs

Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi. An Algorithm for Stochastic and Adversarial Bandits with Switching Costs. In Marina Meila, Tong Zhang 0001, editors, Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event. Volume 139 of Proceedings of Machine Learning Research, pages 9127-9135, PMLR, 2021. [doi]

@inproceedings{RouyerSC21,
  title = {An Algorithm for Stochastic and Adversarial Bandits with Switching Costs},
  author = {Chloé Rouyer and Yevgeny Seldin and Nicolò Cesa-Bianchi},
  year = {2021},
  url = {http://proceedings.mlr.press/v139/rouyer21a.html},
  researchr = {https://researchr.org/publication/RouyerSC21},
  cites = {0},
  citedby = {0},
  pages = {9127-9135},
  booktitle = {Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event},
  editor = {Marina Meila and Tong Zhang 0001},
  volume = {139},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}