Amortized Linear-time Exact Shapley Value for Product-Kernel Methods
Majid Mohammadi, Siu Lun Chau, Krikamol Muandet

TL;DR
This paper introduces PKeX-Shapley, an efficient algorithm for exactly computing Shapley values in product-kernel models, enabling scalable and interpretable feature attribution.
Contribution
It exploits product kernel structure to compute exact Shapley values in quadratic time and extends to kernel-based statistical measures, improving interpretability and efficiency.
Findings
Exact Shapley values computed in quadratic time for all features.
No sampling or density estimation needed due to the distribution-free value function.
Framework extends to MMD and HSIC, aiding interpretable statistical analysis.
Abstract
Kernel methods are widely used in machine learning and statistics for their flexibility and expressive power, yet their black-box nature limits adoption in high-stakes applications. Shapley value-based attribution methods such as SHAP, and kernel-specific adaptations including RKHS-SHAP, provide a principled framework for explainability -- but exact computation of Shapley values is generally intractable, forcing existing approaches to rely on approximations that incur unavoidable estimation error. We introduce PKeX-Shapley, an algorithm that exploits the multiplicative structure of product kernels to compute exact Shapley values for all features in quadratic time in . The method rests on a distribution-free removal operator intrinsic to the product-kernel structure: removing a feature replaces its kernel factor with the multiplicative identity. This yields a parameter-free value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
