mlsanityData to 7 Oct 2026

Leveraging Randomness in Model and Data Partitioning for Privacy Amplification

arXiv 2503.03043 ↗First posted 4 Mar 2025cs.LG cs.CRcited by 7

Not on the map. Why?

Abstract (arXiv)

We study how inherent randomness in the training process -- where each sample (or client in federated learning) contributes only to a randomly selected portion of training -- can be leveraged for privacy amplification. This includes (1) data partitioning, where a sample participates in only a subset of training iterations, and (2) model partitioning, where a sample updates only a subset of the model parameters. We apply our framework to model parallelism in federated learning, where each client updates a randomly selected subnetwork to reduce memory and computational overhead, and show that existing methods, e.g. model splitting or dropout, provide a significant privacy amplification gain not captured by previous privacy analysis techniques. Additionally, we introduce Balanced Iteration Subsampling, a new data partitioning method where each sample (or client) participates in a fixed number of training iterations. We show that this method yields stronger privacy amplification than Poisson (i.i.d.) sampling of data (or clients). Our results demonstrate that randomness in the training process, which is structured rather than i.i.d. and interacts with data in complex ways, can be systematically leveraged for significant privacy amplification.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 26 of its 41 references that are in the map. First posted on arXiv 4 Mar 2025.

Builds on

26 of 41 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019Advances and Open Problems in Federated Learningcited by 3,021
  3. 2016Deep Learning with Differential Privacycited by 2,682
  4. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  5. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 339
  6. 2021Ensemble deep learning: A reviewcited by 283
  7. 2018Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergencescited by 237
  8. 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 234
  9. 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 199
  10. 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 163
  11. 2020The Discrete Gaussian for Differential Privacycited by 134
  12. 2020Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shufflingcited by 96
14 more
  1. 2015Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlocited by 61
  2. 2021Federated Dropout -- A Simple Approach for Enabling Federated Learning on Resource Constrained Devicescited by 56
  3. 2020Privacy Amplification via Random Check-Inscited by 39
  4. 2022Stronger Privacy Amplification by Shuffling for R'enyi and Approximate Differential Privacycited by 29
  5. 2023Privacy Amplification via Compression: Achieving the Optimal Privacy-Accuracy-Communication Trade-off in Distributed Mean Estimationcited by 22
  6. 2024How Private are DP-SGD Implementations?cited by 22
  7. 2020A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergencescited by 21
  8. 2019Distributed Learning of Deep Neural Networks using Independent Subnet Trainingcited by 20
  9. 2021ResIST: Layer-Wise Decomposition of ResNets for Distributed Trainingcited by 18
  10. 2021On the Renyi Differential Privacy of the Shuffle Modelcited by 16
  11. 2025Privacy amplification by random allocationcited by 13
  12. 2021Enabling On-Device Training of Speech Recognition Models with Federated Dropoutcited by 12
  13. 2022Shuffle Gaussian Mechanism for Differential Privacycited by 4
  14. 2024Improved Communication-Privacy Trade-offs in L2 Mean Estimation under Streaming Differential Privacycited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 6.

7 papers.