.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
boosting
AdaBoost
large margin classification
coordinate descent
arc-gv
convergence rates
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
Thiol-functionalized silica colloids, grains, and membranes for irreversible adsorption of metal(oxide) nanoparticles用于金属 (氧化物) 纳米颗粒不可逆吸附的硫醇官能化二氧化硅胶体，颗粒和膜OAAI
OAAI分享收藏Purpura Fulminans and Symmetrical Peripheral Gangrene Caused by Capnocytophaga canimorsus (Formerly DF-2) Septicemia—A Complication of Dog Bite.png)
MedicineOAAI
MedicineIF0
OAAI分享收藏
分享收藏
查看更多内容