.png){kind=icon}
Return
Analysis of boosting algorithms using the smooth margin function
.png){kind=icon}
OA
AI
DOI：10.1214/009053607000000785.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a useful tool for analyzing boosting algorithms called the smooth margin function, a differentiable approximation of the usual margin for boosting algorithms. We present two boosting algorithms based on this smooth margin, coordinate ascent boosting and approximate coordinate ascent boosting, which are similar to Freund and Schapire's AdaBoost algorithm and Breiman's arc-gv algorithm. We give convergence rates to the maximum margin solution for both of our algorithms and for arc-gv. We then study AdaBoost's convergence properties using the smooth margin function. We precisely bound the margin attained by AdaBoost when the edges of the weak classifiers fall within a specified range. This shows that a previous bound proved by Ratsch and Warmuth is exactly tight. Furthermore, we use the smooth margin to capture explicit properties of AdaBoost in cases where cyclic behavior occurs.
Keywords:
boosting
AdaBoost
large margin classification
coordinate descent
arc-gv
convergence rates
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
Cited Papers
ShareSavePurpura Fulminans and Symmetrical Peripheral Gangrene Caused by Capnocytophaga canimorsus (Formerly DF-2) Septicemia—A Complication of Dog Bite.png)
MedicineOAAI
MedicineIF0
OAAIShareSaveShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more