14 citations · 35 across the 16 of their papers we have counts for
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2025
An RKHS Perspective on Tree Ensembles
Mehdi Dagdoug, Clement Dombry, Jean-Jil Duchamps
Random Forests and Gradient Boosting are among the most effective algorithms for supervised learning on tabular data. Both belong to the class of tree-based ensemble methods, where…
stat.ML2022
A large sample theory for infinitesimal gradient boosting
Clement Dombry, Jean-Jil Duchamps
Infinitesimal gradient boosting (Dombry and Duchamps, 2021) is defined as the vanishing-learning-rate limit of the popular tree-based gradient boosting algorithm from machine learn…
stat.ML2021
Infinitesimal gradient boosting
Clément Dombry, Jean-Jil Duchamps
We define infinitesimal gradient boosting as a limit of the popular tree-based gradient boosting algorithm from machine learning. The limit is considered in the vanishing-learning-…