Homotopy Regularization for Boosting.
Lists
Only you see this
Abstract
In this paper, we present a homotopy regularization algorithm for boosting. We introduce a regularization term with adaptive weight into the boosting framework and compose a homotopy objective function. Optimization of this objective approximately composes a solution path for the regularized boosting. Following this path, we can find suitable solution efficiently using early stopping. Experiments show that this adaptive regularization method gives a more efficient parameter selection strategy than regularized boosting and semi supervised boosting algorithms, and significantly improves the performances of traditional AdaBoost and related methods.
BibTeX
@inproceedings{wang2010homotopy,
author = {Zheng Wang and Yangqiu Song and Changshui Zhang},
title = {{Homotopy Regularization for Boosting.}},
booktitle = {ICDM},
year = {2010},
doi = {10.1109/icdm.2010.14},
}Loading related content...