Policy Trees for Prediction: Interpretable and Adaptive Model Selection for Machine Learning
Dimitris Bertsimas, Matthew Peroni

TL;DR
This paper introduces Optimal Predictive-Policy Trees (OP2T), a tree-based method for interpretable, adaptive model selection and rejection in machine learning, addressing real-world decision-making challenges.
Contribution
It develops a prescriptive, interpretable tree-based approach for adaptive model selection and rejection, applicable to various data types and model outputs.
Findings
OP2T outperforms baseline methods in accuracy and interpretability
Provides insights into model selection and error-prone scenarios
Works with both structured and unstructured data
Abstract
As a multitude of capable machine learning (ML) models become widely available in forms such as open-source software and public APIs, central questions remain regarding their use in real-world applications, especially in high-stakes decision-making. Is there always one best model that should be used? When are the models likely to be error-prone? Should a black-box or interpretable model be used? In this work, we develop a prescriptive methodology to address these key questions, introducing a tree-based approach, Optimal Predictive-Policy Trees (OP2T), that yields interpretable policies for adaptively selecting a predictive model or ensemble, along with a parameterized option to reject making a prediction. We base our methods on learning globally optimized prescriptive trees. Our approach enables interpretable and adaptive model selection and rejection while only assuming access to model…
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
TopicsExplainable Artificial Intelligence (XAI)
MethodsBalanced Selection
