التفاصيل البيبلوغرافية
| العنوان: |
Proximal boosting: Aggregating weak learners to minimize non-differentiable losses. |
| المؤلفون: |
Fouillen, Erwan1 (AUTHOR), Boyer, Claire1 (AUTHOR), Sangnier, Maxime1 (AUTHOR) maxime.sangnier@sorbonne-universite.fr |
| المصدر: |
Neurocomputing. Feb2023, Vol. 520, p301-319. 19p. |
| مصطلحات موضوعية: |
*BOOSTING algorithms, *APPROXIMATION error |
| مستخلص: |
Gradient boosting is a prediction method that iteratively combines weak learners to produce a complex and accurate model. From an optimization point of view, the learning procedure of gradient boosting mimics a gradient descent on a functional variable. This paper proposes to build upon the proximal point algorithm, when the empirical risk to minimize is not differentiable, in order to introduce a novel boosting approach, called proximal boosting. It comes with a compagnon algorithm inspired by Grubb and Bagnell (2011) and called residual proximal boosting , which is aimed at better controlling the approximation error. Theoretical convergence is proved for these two procedures under different hypotheses on the empirical risk and advantages of leveraging proximal methods for boosting are illustrated by numerical experiments on simulated and real-world data. In particular, we exhibit a favorable comparison over gradient boosting regarding convergence rate and prediction accuracy. [ABSTRACT FROM AUTHOR] |
| قاعدة البيانات: |
Academic Search Index |
