mlsanityData to 14 Oct 2026

Empowering Decision Trees via Shape Function Branching

arXiv 2510.19040 ↗First posted 21 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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 (S2GT) and multi-way trees (SGTK), and present Shape2CART and ShapeCARTK, extensions to ShapeCART for learning S2GTs and SGTKs, respectively. Experiments on various datasets show that SGTs achieve superior performance with reduced model size compared to traditional axis-aligned linear trees.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 53 references that are in the map. First posted on arXiv 21 Oct 2025.

Builds on

22 of 53 references.

References · 22

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  2. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  3. 2021Tabular Data: Deep Learning is Not All You Needcited by 535
  4. 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 319
  5. 2019Interpretable machine learning: definitions, methods, and applicationscited by 305
  6. 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 246
  7. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  8. 2015Coordinate Descent Algorithmscited by 219
  9. 2020Generalized and Scalable Optimal Sparse Decision Treescited by 100
  10. 2021NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learningcited by 88
  11. 2020Interpretability of machine learning based prediction models in healthcarecited by 75
  12. 2022Neural Basis Models for Interpretabilitycited by 56
10 more
  1. 2020How Interpretable and Trustworthy are GAMs?cited by 44
  2. 2020ExKMC: Expanding Explainable k-Means Clusteringcited by 31
  3. 2021Large Scale Prediction with Decision Treescited by 28
  4. 2019Assessing the Local Interpretability of Machine Learning Modelscited by 23
  5. 2022Hierarchical Shrinkage: improving the accuracy and interpretability of tree-based methodscited by 19
  6. 2020Sparse learning with CARTcited by 12
  7. 2023Scalable Optimal Multiway-Split Decision Trees with Constraintscited by 9
  8. 2025Near Optimal Decision Trees in a SPLIT Secondcited by 8
  9. 2023Breiman meets Bellman: Non-Greedy Decision Trees with MDPscited by 6
  10. 2024NeurCAM: Interpretable Neural Clustering via Additive Modelscited by 3

Built on by

Not cited yet.