Pith. sign in

REVIEW 1 cited by

DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.02071 v3 pith:BCFYZH62 submitted 2023-06-03 cs.AI cs.GTstat.COstat.ML

classification cs.AIcs.GTstat.COstat.ML
keywords datasetshapleyvaluationproblemvalueapproximationdiscreteefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider the dataset valuation problem, that is, the problem of quantifying the incremental gain, to some relevant pre-defined utility of a machine learning task, of aggregating an individual dataset to others. The Shapley value is a natural tool to perform dataset valuation due to its formal axiomatic justification, which can be combined with Monte Carlo integration to overcome the computational tractability challenges. Such generic approximation methods, however, remain expensive in some cases. In this paper, we exploit the knowledge about the structure of the dataset valuation problem to devise more efficient Shapley value estimators. We propose a novel approximation, referred to as discrete uniform Shapley, which is expressed as an expectation under a discrete uniform distribution with support of reasonable size. We justify the relevancy of the proposed framework via asymptotic and non-asymptotic theoretical guarantees and illustrate its benefits via an extensive set of numerical experiments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Unifying and Optimizing Data Values for Selection via Sequential Decision-Making

    cs.AI 2025-02 reject novelty 6.0 of 10

    Data selection is reframed as dynamic programming over an MDP, existing data values are shown to be myopic linear approximations, and a bipartite coverage surrogate is proposed, but its exact optimality guarantee is unsound.

Pith tools