Random Classification Noise Defeats All Convex Potential Boosters
Published on Aug 06, 20083563 Views
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, L