Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again

arXiv:2606.30995 · cs.LG, stat.ML · Submitted 2026-06-30 · Read on arXiv

cs.LG, stat.ML

Submitted: 2026-06-30

Updated: 2026-09-08

License: http://creativecommons.org/licenses/by/4.0/

The gist: Recent work has shown that well-optimized individual decision trees can match complex black box models in some settings, primarily in noisy domains.

Terminology

Abstract

Recent work has shown that well-optimized individual decision trees can match complex black box models in some settings, primarily in noisy domains. For the remaining settings, however, complex ensembled compositions of trees often achieve higher accuracy at the cost of interpretability, leaving practitioners with difficult modeling decisions along an accuracy-interpretability tradeoff. Ideally, we would like to classify as much of the data as possible with one or a small number of trees, achieving interpretability for most samples while maintaining state-of-the-art accuracy. We introduce Multistage Defer Trees: a sequence of sparse decision trees that each make predictions for most samples, while deferring a small proportion to the next tree in the sequence or, ultimately, to a black box. We demonstrate that we can train this model class to match the performance of complex tree-based ensembles while routing most samples through only one or a small number of sparse decision trees. We discuss a range of techniques for training these models while maintaining simplicity. Our method expands the accuracy--interpretability frontier in settings where single-tree methods remain insufficient, demonstrating that even when complex models are necessary, they need not be fully opaque.

Sources

Related papers