Prediction via Shapley Value Regression

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.

Cite

Text

Alkhatib et al. "Prediction via Shapley Value Regression." Proceedings of the 42nd International Conference on Machine Learning, 2025.

Markdown

[Alkhatib et al. "Prediction via Shapley Value Regression." Proceedings of the 42nd International Conference on Machine Learning, 2025.](https://mlanthology.org/icml/2025/alkhatib2025icml-prediction/)

BibTeX

@inproceedings{alkhatib2025icml-prediction,
  title     = {{Prediction via Shapley Value Regression}},
  author    = {Alkhatib, Amr and Bresson, Roman and Boström, Henrik and Vazirgiannis, Michalis},
  booktitle = {Proceedings of the 42nd International Conference on Machine Learning},
  year      = {2025},
  pages     = {1056-1101},
  volume    = {267},
  url       = {https://mlanthology.org/icml/2025/alkhatib2025icml-prediction/}
}