A Note on "Towards Efficient Data Valuation Based on the Shapley Value''
Not on the map. Why?
Abstract (arXiv)
The Shapley value (SV) has emerged as a promising method for data valuation. However, computing or estimating the SV is often computationally expensive. To overcome this challenge, Jia et al. (2019) propose an advanced SV estimation algorithm called ``Group Testing-based SV estimator'' which achieves favorable asymptotic sample complexity. In this technical note, we present several improvements in the analysis and design choices of this SV estimator. Moreover, we point out that the Group Testing-based SV estimator does not fully reuse the collected samples. Our analysis and insights contribute to a better understanding of the challenges in developing efficient SV estimation algorithms for data valuation.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 22 Feb 2023.
Builds on
7 of 13 references.
References · 7
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
- 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
- 2020A Principled Approach to Data Valuation for Federated Learningcited by 127
- 2022Data Banzhaf: A Robust Data Valuation Framework for Machine Learningcited by 126
- 2021Improving Cooperative Game Theory-based Data Valuation via Data Utility Learningcited by 13
Built on by
Citing papers per year: 2023: 3; 2024: 6; 2025: 1; 2026: 1.
11 papers.
- 2024Data Shapley in One Training Runcited by 76
- 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
- 2024Capturing the Temporal Dependence of Training Data Influencecited by 34
- 2023Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuationcited by 19
- 2024Efficient Data Shapley for Weighted Nearest Neighbor Algorithmscited by 18
- 2024An Economic Solution to Copyright Challenges of Generative AIcited by 18
- 2023A Note on "Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms"cited by 11
- 2024Incentives in Private Collaborative Machine Learningcited by 10
- 2024One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficientlycited by 9
- 2026In-Run Data Shapley for Adam Optimizercited by 3
- 2025Optimizing Product Provenance Verification using Data Valuation Methodscited by 0
- 2026In-Run Data Shapley for Adam Optimizer30 Jan 2026
- 2025Optimizing Product Provenance Verification using Data Valuation Methods21 Feb 2025
- 2024Capturing the Temporal Dependence of Training Data Influence12 Dec 2024
- 2024One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently31 Oct 2024
- 2024Data Shapley in One Training Run16 Jun 2024
- 2024An Economic Solution to Copyright Challenges of Generative AI22 Apr 2024
- 2024Incentives in Private Collaborative Machine Learning2 Apr 2024
- 2024Efficient Data Shapley for Weighted Nearest Neighbor Algorithms20 Jan 2024
- 2023Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation30 Aug 2023
- 2023LAVA: Data Valuation without Pre-Specified Learning Algorithms28 Apr 2023
- 2023A Note on "Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms"9 Apr 2023