Data value estimation on private gradients
Not on the map. Why?
Abstract (arXiv)
For gradient-based machine learning (ML) methods commonly adopted in practice such as stochastic gradient descent, the de facto differential privacy (DP) technique is perturbing the gradients with random Gaussian noise. Data valuation attributes the ML performance to the training data and is widely used in privacy-aware applications that require enforcing DP such as data pricing, collaborative ML, and federated learning (FL). Can existing data valuation methods still be used when DP is enforced via gradient perturbations? We show that the answer is no with the default approach of injecting i.i.d.~random noise to the gradients because the estimation uncertainty of the data value estimation paradoxically linearly scales with more estimation budget, producing estimates almost like random guesses. To address this issue, we propose to instead inject carefully correlated noise to provably remove the linear scaling of estimation uncertainty w.r.t.~the budget. We also empirically demonstrate that our method gives better data value estimates on various ML tasks and is applicable to use cases including dataset valuation and~FL.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 57 references that are in the map. First posted on arXiv 22 Dec 2024.
Builds on
28 of 57 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2016Deep Learning with Differential Privacycited by 2,728
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 629
- 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
- 2013The Composition Theorem for Differential Privacycited by 297
- 2021Numerical Composition of Differential Privacycited by 180
- 2021Practical and Private (Deep) Learning without Sampling or Shufflingcited by 170
- 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 165
- 2022Data Banzhaf: A Robust Data Valuation Framework for Machine Learningcited by 132
- 2020A Principled Approach to Data Valuation for Federated Learningcited by 127
16 more
- 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
- 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 103
- 2018A Marketplace for Data: An Algorithmic Solutioncited by 76
- 2020Collaborative Machine Learning with Incentive-Aware Model Rewardscited by 71
- 2022Improved Differential Privacy for SGD via Optimal Private Linear Operators on Adaptive Streamscited by 59
- 2013Bounding the Estimation Error of Sampling-based Shapley Value Approximationcited by 58
- 2022Multi-Epoch Matrix Factorization Mechanisms for Private Machine Learningcited by 48
- 2013Asymptotically Exact, Embarrassingly Parallel MCMCcited by 30
- 2020Improving Deep Learning with Differential Privacy using Gradient Encoding and Denoisingcited by 30
- 2020A Study of Gradient Variance in Deep Learningcited by 28
- 2020Three Variants of Differential Privacy: Lossless Conversion and Applicationscited by 26
- 2023Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacycited by 18
- 2018Piecewise Strong Convexity of Neural Networkscited by 13
- 2024Incentives in Private Collaborative Machine Learningcited by 10
- 2022Probably Approximate Shapley Fairness with Applications in Machine Learningcited by 6
- 2023Incentivising the federation: gradient-based metrics for data selection and valuation in private decentralised trainingcited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.