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.
Error-Correcting Tournaments
A. Beygelzimer,J. Langford,Pradeep Ravikumar
Published 2009 in International Conference on Algorithmic Learning Theory
ABSTRACT
PUBLICATION RECORD
- Publication year
2009
- Venue
International Conference on Algorithmic Learning Theory
- Publication date
2009-02-18
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-23 of 23 references · Page 1 of 1
CITED BY
Showing 1-85 of 85 citing papers · Page 1 of 1