.png){kind=icon}
.png){kind=icon}
Return
Boosting as a kernel-based method
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-019-05797-z.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Boosting combines weak (biased) learners to obtain effective learning algorithms for classification and prediction. In this paper, we showa connection between boosting and kernel-based methods, highlighting both theoretical and practical applications. In the l(2) context, we show that boosting with a weak learner defined by a kernel K is equivalent to estimation with a special boosting kernel. The number of boosting iterations can then be modeled as a continuous hyperparameter, and fit (along with other parameters) using standard techniques. We then generalize the boosting kernel to a broad new class of boosting approaches for general weak learners, including those based on the l(1), hinge and Vapnik losses. We develop fast hyperparameter tuning for this class, which has a wide range of applications including robust regression and classification. We illustrate several applications using synthetic and real data.
Keywords:
Boosting
Weak learners
Kernel-based methods
Reproducing kernel Hilbert spaces
Robust estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W