ML Anthology

Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret

Edward Moroshko, Koby Crammer
ALT 2012 pp. 245-259
doi:10.1007/978-3-642-34106-9_21 /alt/2012/moroshko2012alt-weighted/
PDF ALT Semantic Scholar

Cite

Text

Moroshko and Crammer. "Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret." International Conference on Algorithmic Learning Theory, 2012. doi:10.1007/978-3-642-34106-9_21

Markdown

[Moroshko and Crammer. "Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret." International Conference on Algorithmic Learning Theory, 2012.](https://mlanthology.org/alt/2012/moroshko2012alt-weighted/) doi:10.1007/978-3-642-34106-9_21

BibTeX

@inproceedings{moroshko2012alt-weighted,
  title     = {{Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret}},
  author    = {Moroshko, Edward and Crammer, Koby},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2012},
  pages     = {245-259},
  doi       = {10.1007/978-3-642-34106-9_21},
  url       = {https://mlanthology.org/alt/2012/moroshko2012alt-weighted/}
}