Shapley Values: Paired-Sampling Approximations

• URL: http://arxiv.org/abs/2508.12947v1
• Date: Mon, 18 Aug 2025 14:23:34 GMT
• Title: Shapley Values: Paired-Sampling Approximations
• Authors: Michael Mayer, Mario V. Wüthrich,
• Abstract summary: Shapley values have become a very popular tool to explain machine learning predictions.<n>Based on Shapley's fairness axioms, every input (feature component) gets a credit how it contributes to an output (prediction)<n>The only limitation in computing the Shapley values (credits) for many different predictions is of computational nature.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Originally introduced in cooperative game theory, Shapley values have become a very popular tool to explain machine learning predictions. Based on Shapley's fairness axioms, every input (feature component) gets a credit how it contributes to an output (prediction). These credits are then used to explain the prediction. The only limitation in computing the Shapley values (credits) for many different predictions is of computational nature. There are two popular sampling approximations, sampling KernelSHAP and sampling PermutationSHAP. Our first novel contributions are asymptotic normality results for these sampling approximations. Next, we show that the paired-sampling approaches provide exact results in case of interactions being of maximal order two. Furthermore, the paired-sampling PermutationSHAP possesses the additive recovery property, whereas its kernel counterpart does not.

Related papers

• An Odd Estimator for Shapley Values [19.262788739385012]
  The Shapley value is a framework for attribution in machine learning, encompassing feature importance, data valuation, and causal inference.<n>We prove that the Shapley value depends exclusively on the odd component of the set function, and that paired samplingizes the objective regression to filter out the irrelevant even component.<n>We propose OddSHAP, a consistent estimator that performs regression solely on the odd subspace.
  arXiv  Detail & Related papers  (2026-02-01T19:07:16Z)
• PolySHAP: Extending KernelSHAP with Interaction-Informed Polynomial Regression [26.711792479550954]
  We show that KernelSHAP avoids the exponential cost of approximating Shapley values by approximating the game as a linear function.<n>We also prove that paired sampling produces exactly the same value approximations as second-order PolySHAP, without ever fitting a degree 2.
  arXiv  Detail & Related papers  (2026-01-26T15:47:45Z)
• One Sample is Enough to Make Conformal Prediction Robust [53.78604391939934]
  We show that conformal prediction attains some robustness even with a forward pass on a single randomly perturbed input.<n>Our approach returns robust sets with smaller average set size compared to SOTA methods which use many (e.g. around 100) passes per input.
  arXiv  Detail & Related papers  (2025-06-19T19:14:25Z)
• Prediction via Shapley Value Regression [18.708235771482205]
  A novel method, called ViaSHAP, is proposed that learns a function to compute Shapley values, from which the predictions can be derived directly by summation.<n>Results from a large-scale empirical investigation are presented.
  arXiv  Detail & Related papers  (2025-05-07T19:51:17Z)
• Improving the Weighting Strategy in KernelSHAP [0.8057006406834466]
  In Explainable AI (XAI) Shapley values are a popular framework for explaining predictions made by complex machine learning models.<n>We propose a novel modification of KernelSHAP which replaces the deterministic weights with ones to reduce the variance of the resulting Shapley value approximations.<n>Our methods can reduce the required number of contribution function evaluations by $5%$ to $50%$ while preserving the same accuracy of the approximated Shapley values.
  arXiv  Detail & Related papers  (2024-10-07T10:02:31Z)
• Explaining a probabilistic prediction on the simplex with Shapley compositions [11.009289275721283]
  We introduce Shapley compositions as a well-founded way to properly explain a multiclass probabilistic prediction.<n>We prove that the Shapley composition is the unique quantity satisfying linearity, symmetry and efficiency on the Aitchison simplex.
  arXiv  Detail & Related papers  (2024-08-02T16:40:58Z)
• Shapley Pruning for Neural Network Compression [63.60286036508473]
  This work presents the Shapley value approximations, and performs the comparative analysis in terms of cost-benefit utility for the neural network compression. The proposed normative ranking and its approximations show practical results, obtaining state-of-the-art network compression.
  arXiv  Detail & Related papers  (2024-07-19T11:42:54Z)
• Probabilistic Contrastive Learning for Long-Tailed Visual Recognition [78.70453964041718]
  Longtailed distributions frequently emerge in real-world data, where a large number of minority categories contain a limited number of samples. Recent investigations have revealed that supervised contrastive learning exhibits promising potential in alleviating the data imbalance. We propose a novel probabilistic contrastive (ProCo) learning algorithm that estimates the data distribution of the samples from each class in the feature space.
  arXiv  Detail & Related papers  (2024-03-11T13:44:49Z)
• Fast Shapley Value Estimation: A Unified Approach [71.92014859992263]
  We propose a straightforward and efficient Shapley estimator, SimSHAP, by eliminating redundant techniques. In our analysis of existing approaches, we observe that estimators can be unified as a linear transformation of randomly summed values from feature subsets. Our experiments validate the effectiveness of our SimSHAP, which significantly accelerates the computation of accurate Shapley values.
  arXiv  Detail & Related papers  (2023-11-02T06:09:24Z)
• 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)
• Sampling from Arbitrary Functions via PSD Models [55.41644538483948]
  We take a two-step approach by first modeling the probability distribution and then sampling from that model. We show that these models can approximate a large class of densities concisely using few evaluations, and present a simple algorithm to effectively sample from these models.
  arXiv  Detail & Related papers  (2021-10-20T12:25:22Z)

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.