Timezone: »

A Theory of Multiclass Boosting
Indraneel Mukherjee · Robert E Schapire

Tue Dec 07 10:50 AM -- 11:10 AM (PST) @ Regency Ballroom

Boosting combines weak classifiers to form highly accurate
predictors. Although the case of binary classification is well
understood, in the multiclass setting, the ``correct'' requirements
on the weak classifier, or the notion of the most efficient boosting
algorithms are missing. In this paper, we create a broad and general
framework, within which we make precise and identify the optimal
requirements on the weak-classifier, as well as design the most
effective, in a certain sense, boosting algorithms that assume such

Author Information

Indraneel Mukherjee (Princeton University)
Robert E Schapire (MIcrosoft Research)

Robert Schapire received his ScB in math and computer science from Brown University in 1986, and his SM (1988) and PhD (1991) from MIT under the supervision of Ronald Rivest. After a short post-doc at Harvard, he joined the technical staff at AT&T Labs (formerly AT&T Bell Laboratories) in 1991 where he remained for eleven years. At the end of 2002, he became a Professor of Computer Science at Princeton University. His awards include the 1991 ACM Doctoral Dissertation Award, the 2003 Gödel Prize and the 2004 Kanelakkis Theory and Practice Award (both of the last two with Yoav Freund). His main research interest is in theoretical and applied machine learning.

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors