Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization

Cite

Text

Abernethy et al. "Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization." Annual Conference on Computational Learning Theory, 2008.

Markdown

[Abernethy et al. "Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization." Annual Conference on Computational Learning Theory, 2008.](https://mlanthology.org/colt/2008/abernethy2008colt-competing/)

BibTeX

@inproceedings{abernethy2008colt-competing,
  title     = {{Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization}},
  author    = {Abernethy, Jacob D. and Hazan, Elad and Rakhlin, Alexander},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2008},
  pages     = {263-274},
  url       = {https://mlanthology.org/colt/2008/abernethy2008colt-competing/}
}