A generalized decision tree ensemble based on the NeuralNetworks architecture: Distributed Gradient Boosting Forest (DGBF)
Not on the map. Why?
Abstract (arXiv)
Tree ensemble algorithms as RandomForest and GradientBoosting are currently the dominant methods for modeling discrete or tabular data, however, they are unable to perform a hierarchical representation learning from raw data as NeuralNetworks does thanks to its multi-layered structure, which is a key feature for DeepLearning problems and modeling unstructured data. This limitation is due to the fact that tree algorithms can not be trained with back-propagation because of their mathematical nature. However, in this work, we demonstrate that the mathematical formulation of bagging and boosting can be combined together to define a graph-structured-tree-ensemble algorithm with a distributed representation learning process between trees naturally (without using back-propagation). We call this novel approach Distributed Gradient Boosting Forest (DGBF) and we demonstrate that both RandomForest and GradientBoosting can be expressed as particular graph architectures of DGBT. Finally, we see that the distributed learning outperforms both RandomForest and GradientBoosting in 7 out of 9 datasets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 28 references that are in the map. First posted on arXiv 4 Feb 2024.
Builds on
5 of 28 references.
References · 5
- 2021Deep Neural Networks and Tabular Data: A Surveycited by 489
- 2017CatBoost: unbiased boosting with categorical featurescited by 27
- 2016Neural Random Forestscited by 25
- 2018Multi-Layered Gradient Boosting Decision Treescited by 16
- 2018Boosting Random Forests to Reduce Bias; One-Step Boosted Forest and its Variance Estimatecited by 8
Built on by
Not cited yet.