Prediction via Shapley Value Regression

Amr Alkhatib, Roman Bresson, Henrik Boström, Michalis Vazirgiannis
5/7/2025
cs.LG

No official code found. Best implementation: amrmalkhatib/ViaSHAP (8 stars, MIT, last commit 2025-05-19).

Abstract

Shapley values have several desirable, theoretically well-supported, properties for explaining black-box model predictions. Traditionally, Shapley values are computed post-hoc, leading to additional computational cost at inference time. To overcome this, 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. Two approaches to implement the proposed method are explored; one based on the universal approximation theorem and the other on the Kolmogorov-Arnold representation theorem. Results from a large-scale empirical investigation are presented, showing that ViaSHAP using Kolmogorov-Arnold Networks performs on par with state-of-the-art algorithms for tabular data. It is also shown that the explanations of ViaSHAP are significantly more accurate than the popular approximator FastSHAP on both tabular data and images.

View on arXivView PDF

Code Implementations(1)

MIT
81Python, Jupyter NotebookJul 30, 20241 years agoMIT

Similar Papers

Cite this paper

@article{alkhatib2025prediction,
  title  = {Prediction via Shapley Value Regression},
  author = {Amr Alkhatib and Roman Bresson and Henrik Boström and Michalis Vazirgiannis},
  year   = {2025},
  eprint = {2505.04775},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.04775v2},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.04775.svg)](https://codeofpaper.com/paper/2505.04775)

Discussion