Shapley value-based approaches to explain the robustness of classifiers in machine learning
Not on the map. Why?
Abstract (arXiv)
The use of algorithm-agnostic approaches is an emerging area of research for explaining the contribution of individual features towards the predicted outcome. Whilst there is a focus on explaining the prediction itself, a little has been done on explaining the robustness of these models, that is, how each feature contributes towards achieving that robustness. In this paper, we propose the use of Shapley values to explain the contribution of each feature towards the model's robustness, measured in terms of Receiver-operating Characteristics (ROC) curve and the Area under the ROC curve (AUC). With the help of an illustrative example, we demonstrate the proposed idea of explaining the ROC curve, and visualising the uncertainties in these curves. For imbalanced datasets, the use of Precision-Recall Curve (PRC) is considered more appropriate, therefore we also demonstrate how to explain the PRCs with the help of Shapley values. The explanation of robustness can help analysts in a number of ways, for example, it can help in feature selection by identifying the irrelevant features that can be removed to reduce the computational complexity. It can also help in identifying the features having critical contributions or negative contributions towards robustness.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 64 references that are in the map. First posted on arXiv 9 Sep 2022.
Builds on
9 of 64 references.
References · 9
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
- 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 582
- 2020A Survey on the Explainability of Supervised Machine Learningcited by 225
- 2019Explaining individual predictions when features are dependent: More accurate approximations to Shapley valuescited by 205
- 2020Explainability for fair machine learningcited by 33
- 2020Transparency, Auditability and eXplainability of Machine Learning Models in Credit Scoringcited by 26
Built on by
Not cited yet.