An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction?

Cite

Text

Abernethy and Rakhlin. "An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction?." Annual Conference on Computational Learning Theory, 2009.

Markdown

[Abernethy and Rakhlin. "An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction?." Annual Conference on Computational Learning Theory, 2009.](https://mlanthology.org/colt/2009/abernethy2009colt-efficient/)

BibTeX

@inproceedings{abernethy2009colt-efficient,
  title     = {{An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction?}},
  author    = {Abernethy, Jacob D. and Rakhlin, Alexander},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2009},
  url       = {https://mlanthology.org/colt/2009/abernethy2009colt-efficient/}
}