Counterfactual Metarules for Local and Global Recourse
Not on the map. Why?
Abstract (arXiv)
We introduce T-CREx, a novel model-agnostic method for local and global counterfactual explanation (CE), which summarises recourse options for both individuals and groups in the form of human-readable rules. It leverages tree-based surrogate models to learn the counterfactual rules, alongside 'metarules' denoting their regions of optimality, providing both a global analysis of model behaviour and diverse recourse options for users. Experiments indicate that T-CREx achieves superior aggregate performance over existing rule-based baselines on a range of CE desiderata, while being orders of magnitude faster to run.
Key facts. Cited by 7 papers in the map (data through 13 Oct 2026). Builds on 11 of its 34 references that are in the map. First posted on arXiv 29 May 2024.
Builds on
11 of 34 references.
References · 11
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,143
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,088
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 614
- 2019FACE: Feasible and Actionable Counterfactual Explanationscited by 233
- 2020Multi-Objective Counterfactual Explanationscited by 157
- 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
- 2021Beyond Trivial Counterfactual Explanations with Diverse Valuable Explanationscited by 56
- 2021A Survey on the Robustness of Feature Importance and Counterfactual Explanationscited by 38
- 2023GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanationscited by 27
- 2021Counterfactual Explanations for Arbitrary Regression Modelscited by 22
- 2023Explaining Groups of Instances Counterfactually for XAI: A Use Case, Algorithm and User Study for Group-Counterfactualscited by 9
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 4.
7 papers.
- 2024Learning-Augmented Robust Algorithmic Recoursecited by 4
- 2025Optimal Robust Recourse with Lp-Bounded Model Changecited by 3
- 2025Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational Autoencoderscited by 1
- 2026Optimal Recourse Summaries via Bi-Objective Decision Tree Learningcited by 1
- 2026The Role of Causality in Algorithmic Recoursecited by 1
- 2026CEL: Comprehensive Counterfactual Explanations Library and Benchmarkcited by 0
- 2026Algorithmic Recourse Under Competitioncited by 0
- 2026Algorithmic Recourse Under Competition30 Sep 2026
- 2026The Role of Causality in Algorithmic Recourse30 Jul 2026
- 2026CEL: Comprehensive Counterfactual Explanations Library and Benchmark24 Jul 2026
- 2026Optimal Recourse Summaries via Bi-Objective Decision Tree Learning8 May 2026
- 2025Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational Autoencoders6 Oct 2025
- 2025Optimal Robust Recourse with Lp-Bounded Model Change25 Sep 2025
- 2024Learning-Augmented Robust Algorithmic Recourse2 Oct 2024