Towards Efficient Data Valuation Based on the Shapley Value
Published in
International Conference on Artificial Intellig...(2019)External Links:
TL
TL;DR
This paper proposes a repertoire of efficient algorithms for approximating the Shapley value, a popular notion of value which originated in coopoerative game theory and demonstrates the value of each training instance for various benchmark datasets.
Abstract
{\em ``How much is my data worth?''} is an increasingly common question posed by organizations and individuals alike. An answer to this question could allow, for instance, fairly distributing profits among multiple data contributors and determining prospective compensation when data breaches happen. In this paper, we study the problem of \emph{data valuation} by utilizing the Shapley value, a popular notion of value which originated in coopoerative game theory. The Shapley value defines a unique payoff scheme that satisfies many desiderata for the notion of data value. However, the Shapley value often requires \emph{exponential} time to compute. To meet this challenge, we propose a repertoire of efficient algorithms for approximating the Shapley value. We also demonstrate the value of each training instance for various benchmark datasets.
References33 items
1
Finding Influential Training Samples for Gradient Boosted Decision Trees
2
A cooperative game-theoretic approach to quantify the value of personal data in networks
3
A Unified Approach to Interpreting Model Predictions
4
Understanding Black-box Predictions via Influence Functions
5