High-Probability Regret Bounds for Bandit Online Linear Optimization

Cite

Text

Bartlett et al. "High-Probability Regret Bounds for Bandit Online Linear Optimization." Annual Conference on Computational Learning Theory, 2008.

Markdown

[Bartlett et al. "High-Probability Regret Bounds for Bandit Online Linear Optimization." Annual Conference on Computational Learning Theory, 2008.](https://mlanthology.org/colt/2008/bartlett2008colt-high/)

BibTeX

@inproceedings{bartlett2008colt-high,
  title     = {{High-Probability Regret Bounds for Bandit Online Linear Optimization}},
  author    = {Bartlett, Peter L. and Dani, Varsha and Hayes, Thomas P. and Kakade, Sham M. and Rakhlin, Alexander and Tewari, Ambuj},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2008},
  pages     = {335-342},
  url       = {https://mlanthology.org/colt/2008/bartlett2008colt-high/}
}