Counterfactual Explanations for Model Ensembles Using Entropic Risk Measures
Not on the map. Why?
Abstract (arXiv)
Counterfactual explanations indicate the smallest change in input that can translate to a different outcome for a machine learning model. Counterfactuals have generated immense interest in high-stakes applications such as finance, education, hiring, etc. In several use-cases, the decision-making process often relies on an ensemble of models rather than just one. Despite significant research on counterfactuals for one model, the problem of generating a single counterfactual explanation for an ensemble of models has received limited interest. Each individual model might lead to a different counterfactual, whereas trying to find a counterfactual accepted by all models might significantly increase cost (effort). We propose a novel strategy to find the counterfactual for an ensemble of models using the perspective of entropic risk measure. Entropic risk is a convex risk measure that satisfies several desirable properties. We incorporate our proposed risk measure into a novel constrained optimization to generate counterfactuals for ensembles that stay valid for several models. The main significance of our measure is that it provides a knob that allows for the generation of counterfactuals that stay valid under an adjustable fraction of the models. We also show that a limiting case of our entropic-risk-based strategy yields a counterfactual valid for all models in the ensemble (worst-case min-max approach). We study the trade-off between the cost (effort) for the counterfactual and its validity for an ensemble by varying degrees of risk aversion, as determined by our risk parameter knob. We validate our performance on real-world datasets.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 33 of its 66 references that are in the map. First posted on arXiv 11 Mar 2025.
Builds on
33 of 66 references.
References · 33
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,088
- 2018On the Robustness of Interpretability Methodscited by 312
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
- 2019The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasonscited by 115
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 101
- 2020On Counterfactual Explanations under Predictive Multiplicitycited by 74
- 2021On the Adversarial Robustness of Causal Algorithmic Recoursecited by 56
- 2022Robust Counterfactual Explanations for Tree-Based Ensemblescited by 49
- 2022Rashomon Capacity: A Metric for Predictive Multiplicity in Classificationcited by 47
- 2023Robust Counterfactual Explanations for Neural Networks With Probabilistic Guaranteescited by 45
- 2022Predictive Multiplicity in Probabilistic Classificationcited by 44
- 2022Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recoursecited by 40
21 more
- 2021A Survey on the Robustness of Feature Importance and Counterfactual Explanationscited by 38
- 2021Consistent Counterfactuals for Deep Modelscited by 37
- 2021Optimal Counterfactual Explanations in Tree Ensemblescited by 36
- 2019CERTIFAI: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence modelscited by 34
- 2019Issues with post-hoc counterfactual explanations: a discussioncited by 30
- 2024Robust Counterfactual Explanations in Machine Learning: A Surveycited by 29
- 2022Formalising the Robustness of Counterfactual Explanations for Neural Networkscited by 24
- 2020When Ensembling Smaller Models is More Efficient than Single Large Modelscited by 20
- 2023Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisationcited by 20
- 2023Finding Regions of Counterfactual Explanations via Robust Optimizationcited by 19
- 2022Robust Bayesian Recoursecited by 18
- 2021Uncertainty Estimation and Out-of-Distribution Detection for Counterfactual Explanations: Pitfalls and Solutionscited by 16
- 2023Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)cited by 15
- 2024Model Reconstruction Using Counterfactual Explanations: A Perspective From Polytope Theorycited by 13
- 2018Fair lending needs explainable models for responsible recommendationcited by 12
- 2024Counterfactual Explanations with Probabilistic Guarantees on their Robustness to Model Changecited by 10
- 2022Global Counterfactual Explanations: Investigations, Implementations and Improvementscited by 9
- 2023Coverage-Validity-Aware Algorithmic Recoursecited by 4
- 2024Trust Regions for Explanations via Black-Box Probabilistic Certificationcited by 4
- 2025Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimizationcited by 3
- 2024Verified Training for Counterfactual Explanation Robustness under Data Shiftcited by 2
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Provably Robust Bayesian Counterfactual Explanations under Model Changescited by 1
- 2026Axiomatic Foundations of Counterfactual Explanationscited by 1
- 2026The Role of Causality in Algorithmic Recoursecited by 1
- 2026Density-Guided Robust Counterfactual Explanations on Tabular Data under Model Multiplicitycited by 0
- 2026The Role of Causality in Algorithmic Recourse30 Jul 2026
- 2026Density-Guided Robust Counterfactual Explanations on Tabular Data under Model Multiplicity29 May 2026
- 2026Axiomatic Foundations of Counterfactual Explanations3 Feb 2026
- 2026Provably Robust Bayesian Counterfactual Explanations under Model Changes23 Jan 2026