RelShap: Relationally Consistent Shapley Explanations

• URL: http://arxiv.org/abs/2608.11508v1
• Date: Tue, 11 Aug 2026 23:45:00 GMT
• Title: RelShap: Relationally Consistent Shapley Explanations
• Abstract summary: We propose RelShap, a framework that incorporates relational constraints and data provenance into Shapley value.<n>The framework is estimator-agnostic and composes with Kernel SHAP, Monte Carlo, and SHAP without altering their sampling or weighting properties.
• Score: 16.81821907834537
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine learning pipelines commonly flatten relational data into single-table representations, discarding structural constraints. Widely used Shapley value-based feature attributions then rely on feature independence, evaluating the model on combinations that could never arise in the underlying data, producing misleading explanations. We propose RelShap, a framework that incorporates relational constraints and data provenance into Shapley value computation, restricting both background data and coalition evaluation to relationally valid configurations. The framework is estimator-agnostic and composes with Kernel SHAP, Monte Carlo, and Leverage SHAP without altering their sampling or weighting properties. Functional dependencies further induce equivalence classes over feature coalitions, which RelShap exploits to reduce runtime without changing Shapley values; we provide a combinatorial characterization of the expected speedup. Experiments across multiple datasets, models, and estimators show that RelShap produces explanations that are more faithful to the data-generating process, correctly identifying the dominant feature in controlled settings where existing methods, including Conditional SHAP and ManifoldShap, do not. Our code is available at: https://github.com/duneag2/relshap.

Related papers

• MinShap: A Modified Shapley Value Approach for Feature Selection [2.635536317968963]
  We propose emphMinShap, a modification of the Shapley value framework along with a suite of other related algorithms.<n>MinShap tends to outperform state-of-the-art feature selection algorithms such as LOCO, GCM and Lasso in terms of both accuracy and stability.
  arXiv  Detail & Related papers  (2026-04-16T15:02:22Z)
• Local Shapley: Model-Induced Locality and Optimal Reuse in Data Valuation [32.861851772914996]
  Shapley is a principled foundation for data valuation, but exact computation is #P-hard due to the exponential coalition space.<n>We formalize this model-induced locality through support sets defined by the model's computational pathway.<n>We propose LSMR, an optimal subset-centric algorithm that trains each influential subset exactly once.
  arXiv  Detail & Related papers  (2026-03-04T02:59:23Z)
• Nonparametric Data Attribution for Diffusion Models [57.820618036556084]
  Data attribution for generative models seeks to quantify the influence of individual training examples on model outputs.<n>We propose a nonparametric attribution method that operates entirely on data, measuring influence via patch-level similarity between generated and training images.
  arXiv  Detail & Related papers  (2025-10-16T03:37:16Z)
• shapr: Explaining Machine Learning Models with Conditional Shapley Values in R and Python [0.6562256987706128]
  shapr is a versatile tool for generating Shapley value based prediction explanations.<n> shaprpy Python library brings the core capabilities of shapr to the Python ecosystem.
  arXiv  Detail & Related papers  (2025-04-02T15:47:30Z)
• 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)
• 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)
• Shapley-NAS: Discovering Operation Contribution for Neural Architecture Search [96.20505710087392]
  We propose a Shapley value based method to evaluate operation contribution (Shapley-NAS) for neural architecture search. We show that our method outperforms the state-of-the-art methods by a considerable margin with light search cost.
  arXiv  Detail & Related papers  (2022-06-20T14:41:49Z)
• 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)
• Partial Order in Chaos: Consensus on Feature Attributions in the Rashomon Set [50.67431815647126]
  Post-hoc global/local feature attribution methods are being progressively employed to understand machine learning models. We show that partial orders of local/global feature importance arise from this methodology. We show that every relation among features present in these partial orders also holds in the rankings provided by existing approaches.
  arXiv  Detail & Related papers  (2021-10-26T02:53:14Z)
• groupShapley: Efficient prediction explanation with Shapley values for feature groups [2.320417845168326]
  Shapley values has established itself as one of the most appropriate and theoretically sound frameworks for explaining predictions from machine learning models. The main drawback with Shapley values is that its computational complexity grows exponentially in the number of input features. The present paper introduces groupShapley: a conceptually simple approach for dealing with the aforementioned bottlenecks.
  arXiv  Detail & Related papers  (2021-06-23T08:16:14Z)
• Fast Hierarchical Games for Image Explanations [78.16853337149871]
  We present a model-agnostic explanation method for image classification based on a hierarchical extension of Shapley coefficients. Unlike other Shapley-based explanation methods, h-Shap is scalable and can be computed without the need of approximation. We compare our hierarchical approach with popular Shapley-based and non-Shapley-based methods on a synthetic dataset, a medical imaging scenario, and a general computer vision problem.
  arXiv  Detail & Related papers  (2021-04-13T13:11:02Z)
• New advances in enumerative biclustering algorithms with online partitioning [80.22629846165306]
  This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical datasets. The improved algorithm is called RIn-Close_CVC3, keeps those attractive properties of RIn-Close_CVC, and is characterized by: a drastic reduction in memory usage; a consistent gain in runtime.
  arXiv  Detail & Related papers  (2020-03-07T14:54:26Z)

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.