Flexible Modeling and Multitask Learning using Differentiable Tree Ensembles
Shibal Ibrahim, Hussein Hazimeh, Rahul Mazumder

TL;DR
This paper introduces a flexible, differentiable tree ensemble framework supporting arbitrary loss functions, missing data, and multi-task learning, with efficient GPU training and significantly more compact models.
Contribution
It presents a novel tensor-based formulation for scalable differentiable trees enabling broader modeling capabilities beyond existing toolkits.
Findings
Achieved up to 100x more compact tree ensembles.
Demonstrated 23% increase in model expressiveness.
Validated on 28 diverse datasets.
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 perform experiments on a collection of 28 real open-source and proprietary datasets, which demonstrate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Computational Physics and Python Applications · Machine Learning and Data Classification
