paper-with-me

Papers

How Well Do Feature-Additive Explainers Explain Feature-Additive Predictors?

2023-10-27 · Zachariah Carmichael, Walter J. Scheirer

Surging interest in deep learning from high-stakes domains has precipitated concern over the inscrutable nature of black box neural networks. Explainable AI (XAI) research has led to an abundance of explanation algorithms for these black boxes. Such post hoc explainers produce human-comprehensible explanations, however, their fidelity with respect to the model is not well understood - explanation evaluation remains one of the most challenging issues in XAI. In this paper, we ask a targeted but important question: can popular feature-additive explainers (e.g., LIME, SHAP, SHAPR, MAPLE, and PDP) explain feature-additive predictors? Herein, we evaluate such explainers on ground truth that is analytically derived from the additive structure of a model. We demonstrate the efficacy of our approach in understanding these explainers applied to symbolic expressions, neural networks, and generalized additive models on thousands of synthetic and several real-world tasks. Our results suggest that all explainers eventually fail to correctly attribute the importance of features, especially when a decision-making process involves feature interactions.

📄 PDF Abstract BibTeX arXiv:2310.18496

Code (1)

craymichael/PostHocExplainerEvaluation 공식 구현 tf

Tasks

Additive modelsAttributeDecision Making

Methods 이 논문이 사용한 방법론

LIME LIME, or Local Interpretable Model-Agnostic Explanations, is an algorithm that can explain the predictions of any classifier or regressor in a faithful way, by…
HOC 설명 없음
SHAP 설명 없음

Similar Papers 제목 키워드 기반

A Framework for Evaluating Post Hoc Feature-Additive Explainers

2021-06-15 · Zachariah Carmichael, Walter J. Scheirer

Many applications of data-driven models demand transparency of decisions, especially in health care, criminal justice, and other high-stakes environments. Modern trends in machine learning research have led to algorithms…

Efficient Explanations from Empirical Explainers

2021-03-29 · EMNLP (BlackboxNLP) 2021 11 · Robert Schwarzenberg, Nils Feldhus, Sebastian Möller

Amid a discussion about Green AI in which we see explainability neglected, we explore the possibility to efficiently approximate computationally expensive explainers. To this end, we propose feature attribution modelling…

The Struggles of Feature-Based Explanations: Shapley Values vs. Minimal Sufficient Subsets

2020-09-23 · Oana-Maria Camburu, Eleonora Giunchiglia, Jakob Foerster, Thomas Lukasiewicz 외

For neural models to garner widespread public trust and ensure fairness, we must have human-intelligible explanations for their predictions. Recently, an increasing number of works focus on explaining the predictions of …

Decision MakingFairness

Generative Causal Explanations for Graph Neural Networks

2021-04-14 · WanYu Lin, Hao Lan, Baochun Li

This paper presents Gem, a model-agnostic approach for providing interpretable explanations for any GNNs on various graph learning tasks. Specifically, we formulate the problem of providing explanations for the decisions…

Graph Learning

Selective Explanations

2024-05-29 · Lucas Monteiro Paes, Dennis Wei, Flavio P. Calmon

Feature attribution methods explain black-box machine learning (ML) models by assigning importance scores to input features. These methods can be computationally expensive for large ML models. To address this challenge, …