Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
Liuqing Yang, Yongdao Zhou, Haoda Fu, Min-Qian Liu, Wei Zheng

TL;DR
This paper introduces a novel DOE-based sampling method for efficiently approximating Shapley values, significantly improving accuracy and speed over traditional random sampling, with applications in complex network analysis.
Contribution
It proposes a new order-of-addition experimental design approach for unbiased and more accurate Shapley value estimation, outperforming simple random sampling.
Findings
DOE-based sampling outperforms SRS in accuracy
The method is slightly faster than SRS
It can sometimes exactly recover the Shapley value
Abstract
Shapley value is originally a concept in econometrics to fairly distribute both gains and costs to players in a coalition game. In the recent decades, its application has been extended to other areas such as marketing, engineering and machine learning. For example, it produces reasonable solutions for problems in sensitivity analysis, local model explanation towards the interpretable machine learning, node importance in social network, attribution models, etc. However, its heavy computational burden has been long recognized but rarely investigated. Specifically, in a -player coalition game, calculating a Shapley value requires the evaluation of or marginal contribution values, depending on whether we are taking the permutation or combination formulation of the Shapley value. Hence it becomes infeasible to calculate the Shapley value when is reasonably large. A common…
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.
Taxonomy
TopicsOptimal Experimental Design Methods · Game Theory and Applications · Innovation Diffusion and Forecasting
MethodsSticker Response Selector
