RobustX: Robust Counterfactual Explanations Made Easy
Not on the map. Why?
Abstract (arXiv)
The increasing use of Machine Learning (ML) models to aid decision-making in high-stakes industries demands explainability to facilitate trust. Counterfactual Explanations (CEs) are ideally suited for this, as they can offer insights into the predictions of an ML model by illustrating how changes in its input data may lead to different outcomes. However, for CEs to realise their explanatory potential, significant challenges remain in ensuring their robustness under slight changes in the scenario being explained. Despite the widespread recognition of CEs' robustness as a fundamental requirement, a lack of standardised tools and benchmarks hinders a comprehensive and effective comparison of robust CE generation methods. In this paper, we introduce RobustX, an open-source Python library implementing a collection of CE generation and evaluation methods, with a focus on the robustness property. RobustX provides interfaces to several existing methods from the literature, enabling streamlined access to state-of-the-art techniques. The library is also easily extensible, allowing fast prototyping of novel robust CE generation and evaluation methods.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 19 of its 26 references that are in the map. First posted on arXiv 19 Feb 2025.
Builds on
19 of 26 references.
References · 19
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2022OpenXAI: Towards a Transparent Evaluation of Model Explanationscited by 125
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2021CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithmscited by 85
- 2021If Only We Had Better Counterfactual Explanations: Five Key Deficits to Rectify in the Evaluation of Counterfactual XAI Techniquescited by 82
- 2021AI in Finance: Challenges, Techniques and Opportunitiescited by 81
- 2021NICE: An Algorithm for Nearest Instance Counterfactual Explanationscited by 62
- 2022Robust Counterfactual Explanations for Tree-Based Ensemblescited by 49
- 2023Robust Counterfactual Explanations for Neural Networks With Probabilistic Guaranteescited by 45
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
7 more
- 2022Formalising the Robustness of Counterfactual Explanations for Neural Networkscited by 24
- 2020Scaling Guarantees for Nearest Counterfactual Explanationscited by 22
- 2023Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisationcited by 20
- 2023Promoting Counterfactual Robustness through Diversitycited by 17
- 2023Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)cited by 15
- 2024Interval Abstractions for Robust Counterfactual Explanationscited by 7
- 2024Rigorous Probabilistic Guarantees for Robust Counterfactual Explanationscited by 6
Built on by
Citing papers per year: 2025: 2; 2026: 4.
6 papers.
- 2026ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Setscited by 2
- 2025Argumentative Ensembling for Robust Recourse under Model Multiplicitycited by 1
- 2025Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational Autoencoderscited by 1
- 2026Evaluating Counterfactual Explanation Methods on Incomplete Inputscited by 0
- 2026RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluationcited by 0
- 2026CEL: Comprehensive Counterfactual Explanations Library and Benchmarkcited by 0
- 2026CEL: Comprehensive Counterfactual Explanations Library and Benchmark24 Jul 2026
- 2026RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluation15 Jun 2026
- 2026Evaluating Counterfactual Explanation Methods on Incomplete Inputs9 Apr 2026
- 2026ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Sets7 Feb 2026
- 2025Synthesising Counterfactual Explanations via Label-Conditional Gaussian Mixture Variational Autoencoders6 Oct 2025
- 2025Argumentative Ensembling for Robust Recourse under Model Multiplicity25 Jun 2025