.png){kind=icon}
.png){kind=icon}
Return
Resealed Boosting in Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2885085.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Boosting is a learning scheme that combines weak learners to produce a strong composite learner, with the underlying intuition that one can obtain accurate learner by combining rough ones. This paper aims at developing a new boosting strategy, called resealed boosting (RBoosting), to accelerate the numerical convergence rate and, consequently, improve learning performances of the original boosting. Our studies show that RBoosting possesses the almost optimal numerical convergence rate in the sense that, up to a logarithmic factor, it can reach the minimax nonlinear approximation rate. We then use RBoosting to tackle classification problems and deduce corresponding statistical consistency and tight generalization error estimates. A series of' theoretical and experimental results shows that RBoosting outperforms boosting in terms of generalization.
Keywords:
Boosting
generalization error
numerical convergence rate
resealed boosting (RBoosting)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W
Organization
View more organizations