Flexible Modeling and Multitask Learning using Differentiable Tree Ensembles
Shibal Ibrahim, Hussein Hazimeh, Rahul Mazumder
Abstract
Decision tree ensembles are widely used and competitive learning models. Despite their success, popular toolkits for learning tree ensembles have limited modeling capabilities. For instance, these toolkits support a limited number of loss functions and are restricted to single task learning. We propose a flexible framework for learning tree ensembles, which goes beyond existing toolkits to support arbitrary loss functions, missing responses, and multi-task learning. Our framework builds on differentiable (a.k.a. soft) tree ensembles, which can be trained using first-order methods. However, unlike classical trees, differentiable trees are difficult to scale. We therefore propose a novel tensor-based formulation of differentiable trees that allows for efficient vectorization on GPUs. We introduce FASTEL: a new toolkit (based on Tensorflow 2) for learning differentiable tree ensembles. We perform experiments on a collection of 28 real open-source and proprietary datasets, which demonstrate that our framework can lead to 100x more compact and 23% more expressive tree ensembles than those obtained by popular toolkits.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0573cfd2-dee1-4222-b61a-693add38f036Cited by top-tier papers2
- GRAND-SLAMIN' Interpretable Additive Modeling with Structural ConstraintsShibal Ibrahim, Gabriel Afriat, Kayhan Behdin, Rahul MazumderNeurIPS 2023 · 15 citations
- COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local SearchShibal Ibrahim, Wenyu Chen, Hussein Hazimeh, Natalia Ponomareva et al.KDD 2023 · 2 citations
Builds on3
- The Tree Ensemble Layer: Differentiability meets Conditional ComputationHussein Hazimeh, Natalia Ponomareva, Petros Mol, Zhenyu Tan et al.ICML 2020 · 95 citations
- A Scalable MIP-based Method for Learning Optimal Multivariate Decision TreesHaoran Zhu, Pavankumar Murali, Dzung T. Phan, Lam M. Nguyen et al.NeurIPS 2020 · 47 citations
- Smaller, more accurate regression forests using tree alternating optimizationArman Zharmagambetov, Miguel Á. Carreira-PerpiñánICML 2020 · 34 citations
Related papers
- Learning Binary Decision Trees by Argmin DifferentiationValentina Zantedeschi, Matt J. Kusner, Vlad NiculaeICML 2021 · 16 citations
- Treebeard: An Optimizing Compiler for Decision Tree Based ML InferenceAshwin Prasad, Sampath Rajendra, Kaushik Rajan, R. Govindarajan et al.MICRO 2022 · 8 citations
- A Neural Tangent Kernel Perspective of Infinite Tree EnsemblesRyuichi Kanoh, Mahito SugiyamaICLR 2022 · 7 citations
- Analyzing Tree Architectures in Ensembles via Neural Tangent KernelRyuichi Kanoh, Mahito SugiyamaICLR 2023
- Neural Oblivious Decision Ensembles for Deep Learning on Tabular DataSergei Popov, Stanislav Morozov, Artem BabenkoICLR 2020 · 407 citations
