Counterfactual Explanation of Shapley Value in Data Coalitions
Michelle Si, Jian Pei

TL;DR
This paper introduces a method to generate counterfactual explanations for the Shapley value in data coalitions, addressing interpretability challenges by developing heuristics and an algorithm that efficiently approximate these explanations.
Contribution
We formulate the counterfactual explanation problem for Shapley values in data coalitions and propose the SV-Exp heuristic algorithm to efficiently compute approximate explanations.
Findings
Counterfactual explanations always exist for Shapley values.
Exact computation of counterfactuals is NP-hard, necessitating heuristics.
SV-Exp demonstrates efficiency and interpretability on real datasets.
Abstract
The Shapley value is widely used for data valuation in data markets. However, explaining the Shapley value of an owner in a data coalition is an unexplored and challenging task. To tackle this, we formulate the problem of finding the counterfactual explanation of Shapley value in data coalitions. Essentially, given two data owners and such that has a higher Shapley value than , a counterfactual explanation is a smallest subset of data entries in such that transferring the subset from to makes the Shapley value of less than that of . We show that counterfactual explanations always exist, but finding an exact counterfactual explanation is NP-hard. Using Monte Carlo estimation to approximate counterfactual explanations directly according to the definition is still very costly, since we have to estimate the Shapley values of owners and after each…
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
TopicsMobile Crowdsensing and Crowdsourcing · Game Theory and Voting Systems · Auction Theory and Applications
