@misc{beygelzimer2010error-correcting,
author = {Beygelzimer, Alina and Langford, John and Ravikumar, Pradeep},
title = {Error-Correcting Tournaments},
howpublished = {https://arxiv.org/abs/0902.3176},
year = {2010},
month = {February},
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. The results improve on the PECOC construction \cite[SECOC] with an exponential improvement in computation, from O(k) to O(log2k), and the removal of a square root in the regret dependence, matching the best possible computation and regret up to a constant.},
url = {http://approjects.co.za/?big=en-us/research/publication/error-correcting-tournaments/},
}