Online non-linear gradient boosting in multi-latent spaces

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gradient Boosting is a popular ensemble method that combines linearly diverse and weak hypotheses to build a strong classifier. In this work, we propose a new Online Non-Linear gradient Boosting (ONLB) algorithm where we suggest to jointly learn different combinations of the same set of weak classifiers in order to learn the idiosyncrasies of the target concept. To expand the expressiveness of the final model, our method leverages the non linear complementarity of these combinations. We perform an experimental study showing that ONLB (i) outperforms most recent online boosting methods in both terms of convergence rate and accuracy and (ii) learns diverse and useful new latent spaces.

Cite

CITATION STYLE

APA

Frery, J., Habrard, A., Sebban, M., Caelen, O., & He-Guelton, L. (2018). Online non-linear gradient boosting in multi-latent spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11191 LNCS, pp. 99–110). Springer Verlag. https://doi.org/10.1007/978-3-030-01768-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free