Open this publication in new window or tab >>2025 (English)In: Proceedings of Machine Learning Research / [ed] Aarti Singh; Maryam Fazel; Daniel Hsu; Simon Lacoste-Julien; Felix Berkenkamp; Tegan Maharaj; Kiri Wagstaff; Jerry Zhu, ML Research Press , 2025, Vol. 267, p. 1056-1101Conference paper, Published paper (Refereed)
Abstract [en]
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.
Place, publisher, year, edition, pages
ML Research Press, 2025
Series
Proceedings of Machine Learning Research (PMLR), E-ISSN 2640-3498 ; 267
National Category
Computer Sciences
Identifiers
urn:nbn:se:oru:diva-126332 (URN)001669603900041 ()2-s2.0-105021828219 (Scopus ID)
Conference
42nd International Conference on Machine Learning (ICML 2025), Vancouver, Canada, July 13-19, 2025
Funder
Wallenberg AI, Autonomous Systems and Software Program (WASP)Swedish Research Council, 2022-06725
2026-01-162026-01-162026-03-10Bibliographically approved