Empowering Decision Trees via Shape Function Branching
Nakul Upadhya, Eldan Cohen
Abstract
Decision trees are prized for their interpretability and strong performance on tabular data. Yet, their reliance on simple axis-aligned linear splits often forces deep, complex structures to capture non-linear feature effects, undermining human comprehension of the constructed tree. To address this limitation, we propose a novel generalization of a decision tree, the Shape Generalized Tree (SGT), in which each internal node applies a learnable axis-aligned shape function to a single feature, enabling rich, non-linear partitioning in one split. As users can easily visualize each node's shape function, SGTs are inherently interpretable and provide intuitive, visual explanations of the model's decision mechanisms. To learn SGTs from data, we propose ShapeCART, an efficient induction algorithm for SGTs. We further extend the SGT framework to bivariate shape functions (SGT) and multi-way trees (SGT), and present ShapeCART and ShapeCART, extensions to ShapeCART for learning SGTs and SGTs, respectively. Experiments on various datasets show that SGTs achieve superior performance with reduced model size compared to traditional axis-aligned linear trees.
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 bc568b3c-3cbc-45be-8bca-7ebaf91222a0Builds on13
- Neural Additive Models: Interpretable Machine Learning with Neural NetsRishabh Agarwal, Levi Melnick, Nicholas Frosst, Xuezhou Zhang et al.NeurIPS 2021 · 663 citations
- Generalized and Scalable Optimal Sparse Decision TreesJimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin et al.ICML 2020 · 174 citations
- Learning Optimal Decision Trees Using Caching Branch-and-Bound SearchGaël Aglin, Siegfried Nijssen, Pierre SchausAAAI 2020 · 134 citations
- NODE-GAM: Neural Generalized Additive Model for Interpretable Deep LearningChun-Hao Chang, Rich Caruana, Anna GoldenbergICLR 2022 · 114 citations
- Neural Basis Models for InterpretabilityFilip Radenovic, Abhimanyu Dubey, Dhruv MahajanNeurIPS 2022 · 82 citations
Related papers
- Bivariate Decision Trees: Smaller, Interpretable, More AccurateRasul Kairgeldin, Miguel Á. Carreira-PerpiñánKDD 2024 · 1 citation
- Symbolic Regression Enhanced Decision Trees for Classification TasksKei Sen Fong, Mehul MotaniAAAI 2024 · 12 citations
- Convex Polytope Trees and its Application to VAEMohammadreza Armandpour, Ali Sadeghian, Mingyuan ZhouNeurIPS 2021 · 2 citations
- BAMDT: Bayesian Additive Semi-Multivariate Decision Trees for Nonparametric RegressionZhao Tang Luo, Huiyan Sang, Bani K. MallickICML 2022 · 5 citations
- Explaining Kernel Clustering via Decision TreesMaximilian Fleissner, Leena Chennuru Vankadara, Debarghya GhoshdastidarICLR 2024 · 6 citations
