1 research outputs found
Error-Correcting Tournaments
We present a family of pairwise tournaments reducing -class classification
to binary classification. These reductions are provably robust against a
constant fraction of binary errors. The results improve on the PECOC
construction \cite{SECOC} with an exponential improvement in computation, from
to , and the removal of a square root in the regret
dependence, matching the best possible computation and regret up to a constant.Comment: Minor wording improvement