TRUST: Transparent, Robust and Ultra-Sparse Trees

Albert Dorador
6/18/2025
stat.MEcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Piecewise-constant regression trees remain popular for their interpretability, yet often lag behind black-box models like Random Forest in predictive accuracy. In this work, we introduce TRUST (Transparent, Robust, and Ultra-Sparse Trees), a novel regression tree model that combines the accuracy of Random Forests with the interpretability of shallow decision trees and sparse linear models. TRUST further enhances transparency by leveraging Large Language Models to generate tailored, user-friendly explanations. Extensive validation on synthetic and real-world benchmark datasets demonstrates that TRUST consistently outperforms other interpretable models -- including CART, Lasso, and Node Harvest -- in predictive accuracy, while matching the accuracy of Random Forest and offering substantial gains in both accuracy and interpretability over M5', a well-established model that is conceptually related.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dorador2025trust,
  title  = {TRUST: Transparent, Robust and Ultra-Sparse Trees},
  author = {Albert Dorador},
  year   = {2025},
  eprint = {2506.15791},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.15791v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.15791.svg)](https://codeofpaper.com/paper/2506.15791)

Discussion