Error-Correcting Tournaments

A. Beygelzimer,J. Langford,Pradeep Ravikumar

Published 2009 in International Conference on Algorithmic Learning Theory

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.

PUBLICATION RECORD

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