REVIEW 2 cited by
Robust Counterfactual Explanations in Machine Learning: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Counterfactual explanations (CEs) are advocated as being ideally suited to providing algorithmic recourse for subjects affected by the predictions of machine learning models. While CEs can be beneficial to affected individuals, recent work has exposed severe issues related to the robustness of state-of-the-art methods for obtaining CEs. Since a lack of robustness may compromise the validity of CEs, techniques to mitigate this risk are in order. In this survey, we review works in the rapidly growing area of robust CEs and perform an in-depth analysis of the forms of robustness they consider. We also discuss existing solutions and their limitations, providing a solid foundation for future developments.
Forward citations
Cited by 2 Pith papers
-
Towards Verified and Targeted Explanations through Formal Methods
ViTaX certifies targeted semifactual robustness: a minimal feature subset can be perturbed by ε without flipping a neural network from class y to a user-specified high-risk class t.
-
Robust Counterfactual Explanations under Model Multiplicity Using Multi-Objective Optimization
A Pareto-based multi-objective optimization method generates counterfactual explanations that aim to improve outcomes across several equally accurate machine learning models simultaneously.
Discussion (0). Continue with ORCID to comment.