2022 ACM Conference on Fairness, Accountability, and Transparency 2022
DOI: 10.1145/3531146.3533168
|View full text |Cite
|
Sign up to set email alerts
|

Counterfactual Shapley Additive Explanations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 28 publications
0
12
0
Order By: Relevance
“…• An Algorithm for Robust Counterfactual Explanations (RobX): We propose RobX that generates robust counterfactuals for tree-based ensembles leveraging our metric of counterfactual stability. Our proposed strategy is a post-processing one, i.e., it can be applied after generating counterfactuals using any of the existing methods for tree-based ensembles (that we also refer to as the base method), e.g., Feature Tweaking (FT) [7], FOCUS [8], Nearest Neighbor (NN) [9], FACE [10], etc. Our strategy iteratively refines the counterfactual generated by the base method and moves it towards the conservative counterfactual, until a "stable" counterfactual is found (i.e., one that passes our counterfactual stability test R Φ (x, M ) ≥ τ ).…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…• An Algorithm for Robust Counterfactual Explanations (RobX): We propose RobX that generates robust counterfactuals for tree-based ensembles leveraging our metric of counterfactual stability. Our proposed strategy is a post-processing one, i.e., it can be applied after generating counterfactuals using any of the existing methods for tree-based ensembles (that we also refer to as the base method), e.g., Feature Tweaking (FT) [7], FOCUS [8], Nearest Neighbor (NN) [9], FACE [10], etc. Our strategy iteratively refines the counterfactual generated by the base method and moves it towards the conservative counterfactual, until a "stable" counterfactual is found (i.e., one that passes our counterfactual stability test R Φ (x, M ) ≥ τ ).…”
Section: Methodsmentioning
confidence: 99%
“…• Nearest Neighbor (NN) [9] attempts to find counterfactuals that are essentially the nearest neighbors (L 1 or L 2 cost) to the original data points with respect to the dataset S that lie on the other side of the decision boundary (recall Definition 2).…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…lending company might need to provide reasons for why certain customer had a mortgage request denied by its AI model (Bracke et al [2019]). This type of metric is very present in the recent literature of individual and counterfactual fairness, which builds and is built upon local XAI methods (Ge et al [2022], Albini et al [2022]).…”
Section: Local Vs Globalmentioning
confidence: 99%