Data valuation: The partial ordinal Shapley value for machine learning

Jie Liu, Peizheng Wang, Chao Wu
5/2/2023
cs.LGcs.AI

No official code found. Best implementation: PeizhengWang/PartialOrdinalShapley (3 stars, MIT, last commit 2023-05-04).

Abstract

Data valuation using Shapley value has emerged as a prevalent research domain in machine learning applications. However, it is a challenge to address the role of order in data cooperation as most research lacks such discussion. To tackle this problem, this paper studies the definition of the partial ordinal Shapley value by group theory in abstract algebra. Besides, since the calculation of the partial ordinal Shapley value requires exponential time, this paper also gives three algorithms for approximating the results. The Truncated Monte Carlo algorithm is derived from the classic Shapley value approximation algorithm. The Classification Monte Carlo algorithm and the Classification Truncated Monte Carlo algorithm are based on the fact that the data points in the same class provide similar information, then we can accelerate the calculation by leaving out some data points in each class.

View on arXivView PDF

Code Implementations(1)

MIT

Official code for our paper "Data valuation: The partial ordinal Shapley value for machine learning"

31PythonApr 29, 20233 years agoMIT

Similar Papers

Cite this paper

@article{liu2023data,
  title  = {Data valuation: The partial ordinal Shapley value for machine learning},
  author = {Jie Liu and Peizheng Wang and Chao Wu},
  year   = {2023},
  eprint = {2305.01660},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.01660v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.01660.svg)](https://codeofpaper.com/paper/2305.01660)

Discussion