Error-Correcting Tournaments

We present a family of adaptive pairwise tournaments that are provably robust against large error fractions when used to determine the largest element in a set. The tournaments use nk pairwise comparisons but have only O(k +log n) depth, where n is the number of players and k is the robustness parameter (for reasonable values of n and k). These tournaments also give a reduction from multiclass to binary classification in machine learning, yielding the best known analysis for the problem.

• Type: Conference
• Year: 2009
• Where: ALT
• Authors: Alina Beygelzimer, John Langford, Pradeep Ravikumar
• Keywords: Adaptive Pairwise Tournaments, ALT 2009, Large Error Fractions, Machine Learning, Nk Pairwise Comparisons