Interpreting Models via Single Tree Approximation
Not on the map. Why?
Abstract (arXiv)
We propose a procedure to build a decision tree which approximates the performance of complex machine learning models. This single approximation tree can be used to interpret and simplify the predicting pattern of random forests (RFs) and other models. The use of a tree structure is particularly relevant in medical questionnaires where it enables an adaptive shortening of the questionnaire, reducing response burden. We study the asymptotic behavior of splits and introduce an improved splitting method designed to stabilize tree structure. Empirical studies on both simulation and real data sets illustrate that our method can simultaneously achieve high approximation power and stability.
Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Oct 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 4; 2023: 2; 2024: 3; 2025: 0; 2026: 2.
17 papers.
Sort:
- 2021Trustworthy AI: From Principles to Practicescited by 207
- 2021Benchmarking and Survey of Explanation Methods for Black Box Modelscited by 136
- 2021Fast Sparse Decision Tree Optimization via Reference Ensemblescited by 38
- 2021Provably efficient, succinct, and precise explanationscited by 32
- 2024Towards a theory of model distillationcited by 15
- 2021Conclusive Local Interpretation Rules for Random Forestscited by 9
- 2022Superpolynomial Lower Bounds for Decision Tree Learning and Testingcited by 9
- 2022A Query-Optimal Algorithm for Finding Counterfactualscited by 7
- 2023Properly Learning Decision Trees with Queries Is NP-Hardcited by 5
- 2024Decision Predicate Graphs: Enhancing Interpretability in Tree Ensemblescited by 5
- 2022Explainable Models via Compression of Tree Ensemblescited by 3
- 2023On the Relationship Between Interpretability and Explainability in Machine Learningcited by 3
5 more
- 2024GLEAMS: Bridging the Gap Between Local and Global Explanationscited by 2
- 2022BELLATREX: Building Explanations through a LocaLly AccuraTe Rule EXtractorcited by 1
- 2026PACE: Prune-And-Compress Ensemble Modelscited by 1
- 2021Pedagogical Rule Extraction to Learn Interpretable Models - an Empirical Studycited by 0
- 2026Minimax Rates and Spectral Distillation for Tree Ensemblescited by 0
- 2026Minimax Rates and Spectral Distillation for Tree Ensembles12 May 2026
- 2026PACE: Prune-And-Compress Ensemble Models7 May 2026
- 2024GLEAMS: Bridging the Gap Between Local and Global Explanations9 Aug 2024
- 2024Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles3 Apr 2024
- 2024Towards a theory of model distillation14 Mar 2024
- 2023On the Relationship Between Interpretability and Explainability in Machine Learning20 Nov 2023
- 2023Properly Learning Decision Trees with Queries Is NP-Hard9 Jul 2023
- 2022Superpolynomial Lower Bounds for Decision Tree Learning and Testing12 Oct 2022
- 2022A Query-Optimal Algorithm for Finding Counterfactuals14 Jul 2022
- 2022Explainable Models via Compression of Tree Ensembles16 Jun 2022
- 2022BELLATREX: Building Explanations through a LocaLly AccuraTe Rule EXtractor29 Mar 2022
- 2021Pedagogical Rule Extraction to Learn Interpretable Models - an Empirical Study25 Dec 2021
5 more
- 2021Fast Sparse Decision Tree Optimization via Reference Ensembles1 Dec 2021
- 2021Provably efficient, succinct, and precise explanations1 Nov 2021
- 2021Trustworthy AI: From Principles to Practices4 Oct 2021
- 2021Conclusive Local Interpretation Rules for Random Forests13 Apr 2021
- 2021Benchmarking and Survey of Explanation Methods for Black Box Models25 Feb 2021
- 2021Trustworthy AI: From Principles to Practicescited by 207
- 2021Benchmarking and Survey of Explanation Methods for Black Box Modelscited by 136
- 2021Fast Sparse Decision Tree Optimization via Reference Ensemblescited by 38
- 2021Provably efficient, succinct, and precise explanationscited by 32
- 2024Towards a theory of model distillationcited by 15
- 2021Conclusive Local Interpretation Rules for Random Forestscited by 9
- 2022Superpolynomial Lower Bounds for Decision Tree Learning and Testingcited by 9
- 2022A Query-Optimal Algorithm for Finding Counterfactualscited by 7
- 2023Properly Learning Decision Trees with Queries Is NP-Hardcited by 5
- 2024Decision Predicate Graphs: Enhancing Interpretability in Tree Ensemblescited by 5
- 2022Explainable Models via Compression of Tree Ensemblescited by 3
- 2023On the Relationship Between Interpretability and Explainability in Machine Learningcited by 3
12 most cited of 17 All 17 (JSON)
- 2026Minimax Rates and Spectral Distillation for Tree Ensembles12 May 2026
- 2026PACE: Prune-And-Compress Ensemble Models7 May 2026
- 2024GLEAMS: Bridging the Gap Between Local and Global Explanations9 Aug 2024
- 2024Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles3 Apr 2024
- 2024Towards a theory of model distillation14 Mar 2024
- 2023On the Relationship Between Interpretability and Explainability in Machine Learning20 Nov 2023
- 2023Properly Learning Decision Trees with Queries Is NP-Hard9 Jul 2023
- 2022Superpolynomial Lower Bounds for Decision Tree Learning and Testing12 Oct 2022
- 2022A Query-Optimal Algorithm for Finding Counterfactuals14 Jul 2022
- 2022Explainable Models via Compression of Tree Ensembles16 Jun 2022
- 2022BELLATREX: Building Explanations through a LocaLly AccuraTe Rule EXtractor29 Mar 2022
- 2021Pedagogical Rule Extraction to Learn Interpretable Models - an Empirical Study25 Dec 2021
12 newest of 17 All 17 (JSON)