Table of Contents
Fetching ...

FW-Shapley: Real-time Estimation of Weighted Shapley Values

Pranoy Panda, Siddharth Tandon, Vineeth N Balasubramanian

TL;DR

Fast Weighted Shapley (FW-Shapley), an amortized framework for efficiently computing weighted Shapley values using a learned estimator, and shows that the estimator's training procedure is theoretically valid even though it does not use ground truth Weighted Shapley values during training.

Abstract

Fair credit assignment is essential in various machine learning (ML) applications, and Shapley values have emerged as a valuable tool for this purpose. However, in critical ML applications such as data valuation and feature attribution, the uniform weighting of Shapley values across subset cardinalities leads to unintuitive credit assignments. To address this, weighted Shapley values were proposed as a generalization, allowing different weights for subsets with different cardinalities. Despite their advantages, similar to Shapley values, Weighted Shapley values suffer from exponential compute costs, making them impractical for high-dimensional datasets. To tackle this issue, we present two key contributions. Firstly, we provide a weighted least squares characterization of weighted Shapley values. Next, using this characterization, we propose Fast Weighted Shapley (FW-Shapley), an amortized framework for efficiently computing weighted Shapley values using a learned estimator. We further show that our estimator's training procedure is theoretically valid even though we do not use ground truth Weighted Shapley values during training. On the feature attribution task, we outperform the learned estimator FastSHAP by $27\%$ (on average) in terms of Inclusion AUC. For data valuation, we are much faster (14 times) while being comparable to the state-of-the-art KNN Shapley.

FW-Shapley: Real-time Estimation of Weighted Shapley Values

TL;DR

Fast Weighted Shapley (FW-Shapley), an amortized framework for efficiently computing weighted Shapley values using a learned estimator, and shows that the estimator's training procedure is theoretically valid even though it does not use ground truth Weighted Shapley values during training.

Abstract

Fair credit assignment is essential in various machine learning (ML) applications, and Shapley values have emerged as a valuable tool for this purpose. However, in critical ML applications such as data valuation and feature attribution, the uniform weighting of Shapley values across subset cardinalities leads to unintuitive credit assignments. To address this, weighted Shapley values were proposed as a generalization, allowing different weights for subsets with different cardinalities. Despite their advantages, similar to Shapley values, Weighted Shapley values suffer from exponential compute costs, making them impractical for high-dimensional datasets. To tackle this issue, we present two key contributions. Firstly, we provide a weighted least squares characterization of weighted Shapley values. Next, using this characterization, we propose Fast Weighted Shapley (FW-Shapley), an amortized framework for efficiently computing weighted Shapley values using a learned estimator. We further show that our estimator's training procedure is theoretically valid even though we do not use ground truth Weighted Shapley values during training. On the feature attribution task, we outperform the learned estimator FastSHAP by (on average) in terms of Inclusion AUC. For data valuation, we are much faster (14 times) while being comparable to the state-of-the-art KNN Shapley.

Paper Structure

This paper contains 12 sections, 3 theorems, 19 equations, 9 figures, 2 tables.

Key Result

Proposition 2.1

Weighted Shapley values for player $z$ can be computed by solving the following weighted least squares optimization problem ($z$ represents an input feature or a training sample): where $q(\bm{1}^Ts) = \frac{(n-1)\Tilde{w}^{n}_{\alpha,\beta}}{{n \choose \bm{1}^Ts}\bm{1}^Ts(n-\bm{1}^Ts)}$ refers to the subset weighing function. This is equivalent to solving the following expectation minimization p

Figures (9)

  • Figure :
  • Figure : (a) $n = 100$
  • Figure : (a) $n = 100$
  • Figure : (a) $n = 100$
  • Figure : (b) $n = 500$
  • ...and 4 more figures

Theorems & Definitions (6)

  • Proposition 2.1
  • Proposition 2.2
  • Lemma 5.1
  • proof
  • proof
  • proof