mlsanityData to 7 Oct 2026

Privacy Amplification via Random Participation in Federated Learning

arXiv 2205.01556 ↗First posted 3 May 2022cs.LG cs.CRcited by 2

Not on the map. Why?

Abstract (arXiv)

Running a randomized algorithm on a subsampled dataset instead of the entire dataset amplifies differential privacy guarantees. In this work, in a federated setting, we consider random participation of the clients in addition to subsampling their local datasets. Since such random participation of the clients creates correlation among the samples of the same client in their subsampling, we analyze the corresponding privacy amplification via non-uniform subsampling. We show that when the size of the local datasets is small, the privacy guarantees via random participation is close to those of the centralized setting, in which the entire dataset is located in a single host and subsampled. On the other hand, when the local datasets are large, observing the output of the algorithm may disclose the identities of the sampled clients with high confidence. Our analysis reveals that, even in this case, privacy guarantees via random participation outperform those via only local subsampling.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 32 references that are in the map. First posted on arXiv 3 May 2022.

Builds on

20 of 32 references.

References · 20

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2016Deep Learning with Differential Privacycited by 2,682
  4. 2019Deep Leakage from Gradientscited by 1,004
  5. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
  6. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
  7. 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 509
  8. 2017Differentially Private Federated Learning: A Client Level Perspectivecited by 451
  9. 2018Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergencescited by 237
  10. 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 234
  11. 2018Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoisingcited by 216
  12. 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 199
8 more
  1. 2020Client Selection in Federated Learning: Convergence Analysis and Power-of-Choice Selection Strategiescited by 196
  2. 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 163
  3. 2020Optimal Client Sampling for Federated Learningcited by 123
  4. 2019Updates-Leak: Data Set Inference and Reconstruction Attacks in Online Learningcited by 117
  5. 2020Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shufflingcited by 96
  6. 2020Towards Flexible Device Participation in Federated Learningcited by 64
  7. 2020Privacy Amplification via Random Check-Inscited by 39
  8. 2021Privacy Amplification for Federated Learning via User Sampling and Wireless Aggregationcited by 22

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.

2 papers.