Most General Explanations of Tree Ensembles (Extended Version)
Not on the map. Why?
Abstract (arXiv)
Explainable Artificial Intelligence (XAI) is critical for attaining trust in the operation of AI systems. A key question of an AI system is ``why was this decision made this way''. Formal approaches to XAI use a formal model of the AI system to identify abductive explanations. While abductive explanations may be applicable to a large number of inputs sharing the same concrete values, more general explanations may be preferred for numeric inputs. So-called inflated abductive explanations give intervals for each feature ensuring that any input whose values fall withing these intervals is still guaranteed to make the same prediction. Inflated explanations cover a larger portion of the input space, and hence are deemed more general explanations. But there can be many (inflated) abductive explanations for an instance. Which is the best? In this paper, we show how to find a most general abductive explanation for an AI decision. This explanation covers as much of the input space as possible, while still being a correct formal explanation of the model's behaviour. Given that we only want to give a human one explanation for a decision, the most general explanation gives us the explanation with the broadest applicability, and hence the one most likely to seem sensible. (The paper has been accepted at IJCAI2025 conference.)
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 23 of its 64 references that are in the map. First posted on arXiv 16 May 2025.
Builds on
23 of 64 references.
References · 23
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,206
- 2019Fooling LIME and SHAP: Adversarial Attacks on Post hoc Explanation Methodscited by 443
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 367
- 2018Abduction-Based Explanations for Machine Learning Modelscited by 160
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 140
- 2018A Symbolic Approach to Explaining Bayesian Network Classifierscited by 131
- 2021On Explaining Random Forests with SATcited by 57
- 2022On Tackling Explanation Redundancy in Decision Treescited by 44
- 2022Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networkscited by 42
11 more
- 2022Eliminating The Impossible, Whatever Remains Must Be Truecited by 23
- 2023Logic for Explainable AIcited by 23
- 2023Explainability is NOT a Gamecited by 23
- 2024Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementationcited by 21
- 2022On Computing Probabilistic Abductive Explanationscited by 18
- 2023On Formal Feature Attribution and Its Approximationcited by 11
- 2023Axiomatic Aggregations of Abductive Explanationscited by 10
- 2023Anytime Approximate Formal Feature Attributioncited by 9
- 2023A New Class of Explanations for Classifiers with Non-Binary Featurescited by 8
- 2023Locally-Minimal Probabilistic Explanationscited by 6
- 2024Efficient Contrastive Explanations on Demandcited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2026Circuit Representations of Random Forests with Applications to XAIcited by 2
- 2025Uncovering Bugs in Formal Explainers: A Case Study with PyXAIcited by 1
- 2025Efficient & Correct Predictive Equivalence for Decision Treescited by 0
- 2026Concisely Explaining the Doubt: Minimum-Size Abductive Explanations for Linear Models with a Reject Optioncited by 0
- 2026Rigorous Explanations for Tree Ensemblescited by 0
- 2026Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approachcited by 0
- 2026Beyond Explaining Predictions: Logic-Based Explanations for Confidence in Machine Learning Modelscited by 0
- 2026Beyond Explaining Predictions: Logic-Based Explanations for Confidence in Machine Learning Models9 Jun 2026
- 2026Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach13 May 2026
- 2026Rigorous Explanations for Tree Ensembles31 Mar 2026
- 2026Concisely Explaining the Doubt: Minimum-Size Abductive Explanations for Linear Models with a Reject Option14 Mar 2026
- 2026Circuit Representations of Random Forests with Applications to XAI9 Feb 2026
- 2025Uncovering Bugs in Formal Explainers: A Case Study with PyXAI5 Nov 2025
- 2025Efficient & Correct Predictive Equivalence for Decision Trees22 Sep 2025