Random classification noise defeats all convex potential boosters.
P. Long and R. Servedio.
Machine Learning Journal 78(3), 2010, pp. 287--304.
Preliminary version in 25th International Conference on Machine Learning (ICML), 2008, pp. 608--615.


A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class includes AdaBoost, LogitBoost, and other widely used and well-studied boosters.

In this paper we show that for a broad class of convex potential functions, any such boosting algorithm is highly susceptible to random classification noise. We do this by showing that for any such booster and any nonzero random classification noise rate $\eta$, there is a simple data set of examples which is efficiently learnable by such a booster if there is no noise, but which cannot be learned to accuracy better than $1/2$ if there is random classification noise at rate $\eta.$ This holds even if the booster regularizes using early stopping or a bound on the $L_1$ norm of the voting weights.

This negative result is in contrast with known branching program based boosters which do not fall into the convex potential function framework and which can provably learn to high accuracy in the presence of random classification noise.

pdf of conference version

Postscript or pdf of full version

Back to main papers page