Sciweavers

Share
CVPR
2011
IEEE

TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control

8 years 2 months ago
TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical algorithms such as AdaBoost, GradientBoost, or LogitBoost as special cases. Its restriction to the set of canonical losses makes it possible to have boosting algorithms with explicit margin control. A new large family of losses with this property, based on the set of cumulative distributions of zero mean random variables, is then proposed. A novel loss function in this family, the Laplace loss, is finally derived. The combination of this loss and second order TaylorBoost produces a boosting algorithm with explicit margin control.
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas
Added 20 Aug 2011
Updated 20 Aug 2011
Type Journal
Year 2011
Where CVPR
Authors Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vasconcelos
Comments (0)
books