mlsanityData to 14 Oct 2026

A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacy

arXiv 2405.13453 ↗First posted 22 May 2024cs.LG cs.CRcited by 11

Not on the map. Why?

Abstract (arXiv)

Privacy protection of users' entire contribution of samples is important in distributed systems. The most effective approach is the two-stage scheme, which finds a small interval first and then gets a refined estimate by clipping samples into the interval. However, the clipping operation induces bias, which is serious if the sample distribution is heavy-tailed. Besides, users with large local sample sizes can make the sensitivity much larger, thus the method is not suitable for imbalanced users. Motivated by these challenges, we propose a Huber loss minimization approach to mean estimation under user-level differential privacy. The connecting points of Huber loss can be adaptively adjusted to deal with imbalanced users. Moreover, it avoids the clipping operation, thus significantly reducing the bias compared with the two-stage approach. We provide a theoretical analysis of our approach, which gives the noise strength needed for privacy protection, as well as the bound of mean squared error. The result shows that the new method is much less sensitive to the imbalance of user-wise sample sizes and the tail of sample distributions. Finally, we perform numerical experiments to validate our theoretical analysis.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 38 of its 88 references that are in the map. First posted on arXiv 22 May 2024.

Builds on

38 of 88 references.

References · 38

  1. 2019Advances and Open Problems in Federated Learningcited by 3,046
  2. 2016Deep Learning with Differential Privacycited by 2,728
  3. 2019Federated Learning with Differential Privacy: Algorithms and Performance Analysiscited by 536
  4. 2017Differentially Private Federated Learning: A Client Level Perspectivecited by 459
  5. 2015An Introduction to Matrix Concentration Inequalitiescited by 397
  6. 2019Fair Resource Allocation in Federated Learningcited by 394
  7. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
  8. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  9. 2019Private Stochastic Convex Optimization with Optimal Ratescited by 186
  10. 2020Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 153
  11. 2020The Heavy-Tail Phenomenon in SGDcited by 124
  12. 2018A General Approach to Adding Differential Privacy to Iterative Training Procedurescited by 84
26 more
  1. 2017Being Robust (in High Dimensions) Can Be Practicalcited by 83
  2. 2021Private Stochastic Convex Optimization: Optimal Rates in ℓ1 Geometrycited by 83
  3. 2020Private Mean Estimation of Heavy-Tailed Distributionscited by 73
  4. 2021Learning with User-Level Privacycited by 72
  5. 2021Robust and Differentially Private Mean Estimationcited by 66
  6. 2021Differential privacy and robust statistics in high dimensionscited by 64
  7. 2019Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimationcited by 52
  8. 2021Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanismcited by 50
  9. 2023Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalizationcited by 42
  10. 2020Learning discrete distributions: user vs item-level privacycited by 41
  11. 2021Instance-optimal Mean Estimation Under Differential Privacycited by 37
  12. 2022Optimal Algorithms for Mean Estimation under Local Differential Privacycited by 36
  13. 2023Attention-Enhancing Backdoor Attacks Against BERT-based Modelscited by 32
  14. 2021Differentially private inference via noisy optimizationcited by 27
  15. 2023From Robustness to Privacy and Backcited by 27
  16. 2020Federated Recommendation System via Differential Privacycited by 26
  17. 2016Collecting and Analyzing Data from Smart Device Users with Local Differential Privacycited by 25
  18. 2021Shuffle Private Stochastic Convex Optimizationcited by 17
  19. 2022Discrete Distribution Estimation under User-level Local Differential Privacycited by 17
  20. 2023A Huber Loss Minimization Approach to Byzantine Robust Federated Learningcited by 16
  21. 2022On robustness and local differential privacycited by 15
  22. 2023Federated Linear Contextual Bandits with User-level Differential Privacycited by 12
  23. 2023User-Level Differential Privacy With Few Examples Per Usercited by 12
  24. 2023User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Ratescited by 12
  25. 2023Robust Nonparametric Regression under Poisoning Attackcited by 11
  26. 2023Mean Estimation with User-level Privacy under Data Heterogeneitycited by 8

Built on by

Cited by year

Citing papers per year: 2024: 5; 2025: 6.

11 papers.