Making Tree Ensembles Interpretable
Satoshi Hara, Kohei Hayashi

TL;DR
This paper introduces a post-processing method that approximates complex tree ensembles with simpler, interpretable models using an EM algorithm, enhancing understanding without sacrificing much predictive power.
Contribution
It presents a novel EM-based approach to approximate complex tree ensembles with interpretable models after training.
Findings
Synthetic experiments show effective approximation of complex ensembles
Method improves interpretability while maintaining accuracy
Approach applicable to various tree ensemble models
Abstract
Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model interpretability of tree ensembles. After learning a complex tree ensembles in a standard way, we approximate it by a simpler model that is interpretable for human. To obtain the simpler model, we derive the EM algorithm minimizing the KL divergence from the complex ensemble. A synthetic experiment showed that a complicated tree ensemble was approximated reasonably as interpretable.
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
TopicsNeural Networks and Applications · Explainable Artificial Intelligence (XAI) · Bayesian Modeling and Causal Inference
MethodsInterpretability
