图 书 馆
助推新发展的概述Overview of New Developments in Boosting |
|
| 课程网址: | http://videolectures.net/cmulls08_bradley_ond/ |
| 主讲教师: | Joseph K. Bradley |
| 开课单位: | Databricks公司 |
| 开课时间: | 2008-02-21 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | I will give an overview of recent developments in boosting, focusing on three papers which take very different approaches towards making boosting more efficient and effective. Boosters iteratively choose base classifiers via a weak learner and then update a distribution over training examples. Roughly, the three papers show progress on the three issues implicit in this one-sentence description of boosting: the number of iterations required, the computational cost of choosing good base classifiers, and the time and space complexity from maintaining a distribution over training examples. Warmuth, Liao, and Ratsch (2006) propose TotalBoost, which is a "totally corrective" boosting algorithm. Intuitively, on each round, totally corrective boosters choose base classifiers which give more information not present in previously chosen base classifiers. This leads to fewer iterations and smaller final hypotheses. Barutcuoglu, Long, and Servedio (2007) describe an alternative model for boosting where assumptions about the diversity of base classifiers allow the booster to learn in a single pass over the set of base classifiers. This eliminates the need to optimize over all base classifiers on each round. Bradley and Schapire (2007) propose an algorithm called FilterBoost which trains on examples drawn from an oracle rather than a fixed set of examples. This alternative learning framework can model learning via a single pass over the set of training examples and allows the booster to train efficiently on very large datasets. |
| 关 键 词: | 助推器; 替代学习框架; 提高效率 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-03：lxf |
| 阅读次数: | 67 |