Threading the Needle of On and Off-Manifold Value Functions for Shapley Explanations

• URL: http://arxiv.org/abs/2202.11919v1
• Date: Thu, 24 Feb 2022 06:22:34 GMT
• Title: Threading the Needle of On and Off-Manifold Value Functions for Shapley Explanations
• Authors: Chih-Kuan Yeh, Kuan-Yun Lee, Frederick Liu, Pradeep Ravikumar
• Abstract summary: We formalize the desiderata of value functions that respect both the model and the data manifold in a set of axioms. We show that there exists a unique value function that satisfies these axioms.
• Score: 40.95261379462059
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A popular explainable AI (XAI) approach to quantify feature importance of a given model is via Shapley values. These Shapley values arose in cooperative games, and hence a critical ingredient to compute these in an XAI context is a so-called value function, that computes the "value" of a subset of features, and which connects machine learning models to cooperative games. There are many possible choices for such value functions, which broadly fall into two categories: on-manifold and off-manifold value functions, which take an observational and an interventional viewpoint respectively. Both these classes however have their respective flaws, where on-manifold value functions violate key axiomatic properties and are computationally expensive, while off-manifold value functions pay less heed to the data manifold and evaluate the model on regions for which it wasn't trained. Thus, there is no consensus on which class of value functions to use. In this paper, we show that in addition to these existing issues, both classes of value functions are prone to adversarial manipulations on low density regions. We formalize the desiderata of value functions that respect both the model and the data manifold in a set of axioms and are robust to perturbation on off-manifold regions, and show that there exists a unique value function that satisfies these axioms, which we term the Joint Baseline value function, and the resulting Shapley value the Joint Baseline Shapley (JBshap), and validate the effectiveness of JBshap in experiments.

Related papers

• Value-Distributional Model-Based Reinforcement Learning [59.758009422067]
  Quantifying uncertainty about a policy's long-term performance is important to solve sequential decision-making tasks. We study the problem from a model-based Bayesian reinforcement learning perspective. We propose Epistemic Quantile-Regression (EQR), a model-based algorithm that learns a value distribution function.
  arXiv  Detail & Related papers  (2023-08-12T14:59:19Z)
• Efficient Shapley Values Estimation by Amortization for Text Classification [66.7725354593271]
  We develop an amortized model that directly predicts each input feature's Shapley Value without additional model evaluations. Experimental results on two text classification datasets demonstrate that our amortized model estimates Shapley Values accurately with up to 60 times speedup.
  arXiv  Detail & Related papers  (2023-05-31T16:19:13Z)
• CS-Shapley: Class-wise Shapley Values for Data Valuation in Classification [24.44357623723746]
  We propose CS-Shapley, a Shapley value with a new value function that discriminates between training instances' in-class and out-of-class contributions. Our results suggest Shapley-based data valuation is transferable for application across different models.
  arXiv  Detail & Related papers  (2022-11-13T03:32:33Z)
• Adaptive LASSO estimation for functional hidden dynamic geostatistical model [69.10717733870575]
  We propose a novel model selection algorithm based on a penalized maximum likelihood estimator (PMLE) for functional hiddenstatistical models (f-HD) The algorithm is based on iterative optimisation and uses an adaptive least absolute shrinkage and selector operator (GMSOLAS) penalty function, wherein the weights are obtained by the unpenalised f-HD maximum-likelihood estimators.
  arXiv  Detail & Related papers  (2022-08-10T19:17:45Z)
• Future-Dependent Value-Based Off-Policy Evaluation in POMDPs [67.21319339512699]
  We study off-policy evaluation (OPE) for partially observable MDPs (POMDPs) with general function approximation. We develop a novel model-free OPE method by introducing future-dependent value functions that take future proxies as inputs. We extend our methods to learning of dynamics and establish the connection between our approach and the well-known spectral learning methods in POMDPs.
  arXiv  Detail & Related papers  (2022-07-26T17:53:29Z)
• Counterfactual Shapley Additive Explanations [6.916452769334367]
  We propose a variant of SHAP, CoSHAP, that uses counterfactual generation techniques to produce a background dataset. We motivate the need within the actionable recourse setting for careful consideration of background datasets when using Shapley values for feature attributions.
  arXiv  Detail & Related papers  (2021-10-27T08:44:53Z)
• Joint Shapley values: a measure of joint feature importance [6.169364905804678]
  We introduce joint Shapley values, which directly extend the Shapley axioms. Joint Shapley values measure a set of features' average effect on a model's prediction. Results for games show that joint Shapley values present different insights from existing interaction indices.
  arXiv  Detail & Related papers  (2021-07-23T17:22:37Z)
• Explaining the data or explaining a model? Shapley values that uncover non-linear dependencies [0.0]
  We introduce and demonstrate the use of the energy distance correlations, affine-invariant distance correlation, and Hilbert-Shmidt independence criterion as Shapley value characteristic functions.
  arXiv  Detail & Related papers  (2020-07-12T15:04:59Z)
• Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functions [55.660255727031725]
  Influence functions explain the decisions of a model by identifying influential training examples. We conduct a comparison between influence functions and common word-saliency methods on representative tasks. We develop a new measure based on influence functions that can reveal artifacts in training data.
  arXiv  Detail & Related papers  (2020-05-14T00:45:23Z)
• Interpretable feature subset selection: A Shapley value based approach [1.511944009967492]
  We introduce the notion of classification game, a cooperative game with features as players and hinge loss based characteristic function. Our major contribution is ($star$) to show that for any dataset the threshold 0 on SVEA value identifies feature subset whose joint interactions for label prediction is significant.
  arXiv  Detail & Related papers  (2020-01-12T16:27:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.