The paper introduces a novel method that merges Monte Carlo sampling with linear regression to estimate probabilistic values such as Shapley and Banzhaf values. It generalizes previous algorithms by allowing any efficiently computable function family, enabling the use of tree-based models like XGBoost and cross‑fitting for unbiased estimates. Experiments on eight datasets show the approach achieves state‑of‑the‑art accuracy, reducing error by up to 11× for Shapley values and 390× for general probabilistic values compared to existing methods.
arXiv:2410. 01917v3 Announce Type: replace-cross Abstract: Originally introduced in game theory, Shapley values have emerged as a central tool in explainable machine learning, where they are used to attribute model predictions to specific input features.
arXiv:2605.02827v2 Announce Type: replace Abstract: Probabilistic values, including Shapley values and semivalues, provide a model-agnostic framework to attribute the behavior of a black-box model to...
arXiv:2611.07173v1 Announce Type: cross Abstract: Shapley values are a central tool for attribution in machine learning. Since their exact computation requires evaluating the cooperative game to be e...
arXiv:2606. 02247v1 Announce Type: cross Abstract: Shapley values are a principled attribution measure widely used in interpretable machine learning, but their exact computation scales exponentially with the number of players, motivating a wide range of approximation methods based on value function evaluations of sampled coalitions.
arXiv:2604. 08438v2 Announce Type: replace Abstract: The Shapley value, and its broader family of semi-values, has received much attention in various attribution problems.
arXiv:2412. 11257v4 Announce Type: replace-cross Abstract: For many complex simulation tasks spanning areas such as healthcare, engineering, and finance, Monte Carlo (MC) methods are invaluable due to their unbiased estimates and precise error quantification.
arXiv:2603. 03672v2 Announce Type: replace Abstract: The Shapley value provides a principled foundation for data valuation, but exact computation is #P-hard due to the exponential coalition space.
QuadraSHAP is a method for computing ε-exact Shapley values in product games, where coalition values factor across players. It replaces the exponential coalition sum with a one-dimensional polynomial integral, using Gauss–Legendre quadrature to achieve exact values when ε = 0 and provides a computable error bound for ε > 0. The approach supports weighted sums of product games, enabling baseline and empirical interventional attribution for models such as log-link regression, Cox models, odds-scale classifiers, product-kernel machines, and tree-based models, and achieves logarithmic parallel time with efficient GPU evaluation even for hundreds of thousands of features.
arXiv:2607. 11956v1 Announce Type: cross Abstract: Data Shapley is the standard principled answer to which training points are worth what, and its k-nearest-neighbor (KNN) specialization is the version deployed in practice: the exact estimator shipped by toolkits such as pyDVL and OpenDataVal.
arXiv:2608. 11508v1 Announce Type: new Abstract: Machine learning pipelines commonly flatten relational data into single-table representations, discarding structural constraints.
arXiv:2602. 09326v2 Announce Type: replace Abstract: Shapley values are widely used for model-agnostic data valuation and feature attribution, yet they implicitly assume contributors are interchangeable.
The paper introduces an imprecise Dirichlet model (IDM) approach to evaluate the robustness of Shapley values in tree-based models such as decision trees and random forests. By quantifying interval-valued Shapley values—using pessimistic and averaging principles—when a few unannotated instances are added to tree leaves, the authors derive efficient computational methods and extend the framework to Banzhaf values. Experiments and case studies demonstrate how these interval-valued explanations can be applied to debias uninformative features.