mlsanityData to 14 Oct 2026

PriPrune: Quantifying and Preserving Privacy in Pruned Federated Learning

arXiv 2310.19958 ↗First posted 30 Oct 2023cs.LG cs.CR cs.ITcited by 4

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) is a paradigm that allows several client devices and a server to collaboratively train a global model, by exchanging only model updates, without the devices sharing their local training data. These devices are often constrained in terms of communication and computation resources, and can further benefit from model pruning -- a paradigm that is widely used to reduce the size and complexity of models. Intuitively, by making local models coarser, pruning is expected to also provide some protection against privacy attacks in the context of FL. However this protection has not been previously characterized, formally or experimentally, and it is unclear if it is sufficient against state-of-the-art attacks. In this paper, we perform the first investigation of privacy guarantees for model pruning in FL. We derive information-theoretic upper bounds on the amount of information leaked by pruned FL models. We complement and validate these theoretical findings, with comprehensive experiments that involve state-of-the-art privacy attacks, on several state-of-the-art FL pruning schemes, using benchmark datasets. This evaluation provides valuable insights into the choices and parameters that can affect the privacy protection provided by pruning. Based on these insights, we introduce PriPrune -- a privacy-aware algorithm for local model pruning, which uses a personalized per-client defense mask and adapts the defense pruning rate so as to jointly optimize privacy and model performance. PriPrune is universal in that can be applied after any pruned FL scheme on the client, without modification, and protects against any inversion attack by the server. Our empirical evaluation demonstrates that PriPrune significantly improves the privacy-accuracy tradeoff compared to state-of-the-art pruned FL schemes that do not take privacy into account.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 37 of its 56 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

37 of 56 references.

References · 37

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  8. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
  9. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  10. 2019Deep Leakage from Gradientscited by 1,021
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2018LEAF: A Benchmark for Federated Settingscited by 792
25 more
  1. 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
  2. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
  3. 2018MINE: Mutual Information Neural Estimationcited by 683
  4. 2019Importance Estimation for Neural Network Pruningcited by 541
  5. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  6. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  7. 2020iDLG: Improved Deep Leakage from Gradientscited by 382
  8. 2021See through Gradients: Image Batch Recovery via GradInversioncited by 326
  9. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  10. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  11. 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 222
  12. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
  13. 2019Robust Anomaly Detection and Backdoor Attack Detection Via Differential Privacycited by 95
  14. 2021Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacycited by 69
  15. 2021LightSecAgg: a Lightweight and Versatile Design for Secure Aggregation in Federated Learningcited by 64
  16. 2020Lookahead: A Far-Sighted Alternative of Magnitude-based Pruningcited by 61
  17. 2019Federated Learning with Bayesian Differential Privacycited by 60
  18. 2020LotteryFL: Personalized and Communication-Efficient Federated Learning with Lottery Ticket Hypothesis on Non-IID Datasetscited by 60
  19. 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 55
  20. 2021Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?cited by 52
  21. 2021Securing Secure Aggregation: Mitigating Multi-Round Privacy Leakage in Federated Learningcited by 39
  22. 2022Gradient Obfuscation Gives a False Sense of Security in Federated Learningcited by 39
  23. 2022How Much Privacy Does Federated Learning with Secure Aggregation Guarantee?cited by 19
  24. 2023Dynamic Structure Pruning for Compressing CNNscited by 5
  25. 2023Efficient Federated Learning with Enhanced Privacy via Lottery Ticket Pruning in Edge Computingcited by 5

Built on by

Cited by year (2026 to 14 Oct)

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

4 papers.