Error-Correcting Tournaments

Alina Beygelzimer, John Langford, Pradeep Ravikumar

ALT 2009 pp. 247-262

doi:10.1007/978-3-642-04414-4_22 /alt/2009/beygelzimer2009alt-errorcorrecting/

Abstract

We present a family of pairwise tournaments reducing k-class classification to binary classification. These reductions are provably robust against a constant fraction of binary errors, and match the best possible computation and regret up to a constant.

PDF ALT Semantic Scholar

Cite

Text

Beygelzimer et al. "Error-Correcting Tournaments." International Conference on Algorithmic Learning Theory, 2009. doi:10.1007/978-3-642-04414-4_22

Markdown

[Beygelzimer et al. "Error-Correcting Tournaments." International Conference on Algorithmic Learning Theory, 2009.](https://mlanthology.org/alt/2009/beygelzimer2009alt-errorcorrecting/) doi:10.1007/978-3-642-04414-4_22

BibTeX

@inproceedings{beygelzimer2009alt-errorcorrecting,
  title     = {{Error-Correcting Tournaments}},
  author    = {Beygelzimer, Alina and Langford, John and Ravikumar, Pradeep},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2009},
  pages     = {247-262},
  doi       = {10.1007/978-3-642-04414-4_22},
  url       = {https://mlanthology.org/alt/2009/beygelzimer2009alt-errorcorrecting/}
}