ICML 2022spotlight8 citations
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
Abstract
We study the problem of
BibTeX
@InProceedings{pmlr-v162-saha22b,
title = {Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits},
author = {Saha, Aadirupa and Gupta, Shubham},
booktitle = {Proceedings of the 39th International Conference on Machine Learning},
pages = {19027--19049},
year = {2022},
editor = {Chaudhuri, Kamalika and Jegelka, Stefanie and Song, Le and Szepesvari, Csaba and Niu, Gang and Sabato, Sivan},
volume = {162},
series = {Proceedings of Machine Learning Research},
month = {17--23 Jul},
publisher = {PMLR},
pdf = {https://proceedings.mlr.press/v162/saha22b/saha22b.pdf},
url = {https://proceedings.mlr.press/v162/saha22b.html},
abstract = {We study the problem of