4.7 Article

Deletion and Insertion Tests in Regression Models

期刊

出版社

MICROTOME PUBL

关键词

Aumann-Shapley value; Deletion test; Explainable AI; Insertion test; Integrated gradients; Shapley value

向作者/读者索取更多资源

An important task in explainable AI is to identify the most important features behind a prediction made by a black box function. The quality of algorithms that rank pixels by importance for classification can be evaluated using insertion and deletion tests. Based on regression problems, we establish a formula to calculate the area under the curve (AUC) criteria for feature ranking. We propose an alternative area calculation for regression settings and compare different methods of computing feature importances.
A basic task in explainable AI (XAI) is to identify the most important features behind a prediction made by a black box function f. The insertion and deletion tests of Petsiuk et al. (2018) can be used to judge the quality of algorithms that rank pixels from most to least important for a classification. Motivated by regression problems we establish a formula for their area under the curve (AUC) criteria in terms of certain main effects and interactions in an anchored decomposition of f. We find an expression for the expected value of the AUC under a random ordering of inputs to f and propose an alternative area above a straight line for the regression setting. We use this criterion to compare feature importances computed by integrated gradients (IG) to those computed by Kernel SHAP (KS) as well as LIME, DeepLIFT, vanilla gradient and inputxgradient methods. KS has the best overall performance in two datasets we consider but it is very expensive to compute. We find that IG is nearly as good as KS while being much faster. Our comparison problems include some binary inputs that pose a challenge to IG because it must use values between the possible variable levels and so we consider ways to handle binary variables in IG. We show that sorting variables by their Shapley value does not necessarily give the optimal ordering for an insertion-deletion test. It will however do that for monotone functions of additive models, such as logistic regression.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据