Extracting Optimal Explanations for Ensemble Trees via Logical Reasoning
Not on the map. Why?
Abstract (arXiv)
Ensemble trees are a popular machine learning model which often yields high prediction performance when analysing structured data. Although individual small decision trees are deemed explainable by nature, an ensemble of large trees is often difficult to understand. In this work, we propose an approach called optimised explanation (OptExplain) that faithfully extracts global explanations of ensemble trees using a combination of logical reasoning, sampling and optimisation. Building on top of this, we propose a method called the profile of equivalent classes (ProClass), which uses MAX-SAT to simplify the explanation even further. Our experimental study on several datasets shows that our approach can provide high-quality explanations to large ensemble trees models, and it betters recent top-performers.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Mar 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 2; 2025: 1.
4 papers.
- 2024A survey and taxonomy of methods interpreting random forest modelscited by 2
- 2022MUC-driven Feature Importance Measurement and Adversarial Analysis for Random Forestcited by 1
- 2024Forest-ORE: Mining Optimal Rule Ensemble to interpret Random Forest modelscited by 1
- 2025Reasoning Under Threat: Symbolic and Neural Techniques for Cybersecurity Verificationcited by 1
- 2025Reasoning Under Threat: Symbolic and Neural Techniques for Cybersecurity Verification27 Mar 2025
- 2024A survey and taxonomy of methods interpreting random forest models17 Jul 2024
- 2024Forest-ORE: Mining Optimal Rule Ensemble to interpret Random Forest models26 Mar 2024
- 2022MUC-driven Feature Importance Measurement and Adversarial Analysis for Random Forest25 Feb 2022