Online Non-Linear Gradient Boosting in Multi-Latent Spaces

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Jordan Frery <>
Submitted on : Monday, October 8, 2018 - 11:38:59 AM
Last modification on : Wednesday, October 17, 2018 - 1:11:39 AM
Long-term archiving on : Wednesday, January 9, 2019 - 1:52:21 PM


Files produced by the author(s)


  • HAL Id : hal-01889994, version 1


Jordan Frery, Amaury Habrard, Marc Sebban, Olivier Caelen, Liyun He-Guelton. Online Non-Linear Gradient Boosting in Multi-Latent Spaces. 17th International Symposium on Intelligent Data Analysis (IDA'18), Oct 2018, s-Hertogenbosch, Netherlands. ⟨hal-01889994⟩



Record views


Files downloads