mlsanityData to 14 Oct 2026

DP-FP: Differentially Private Forward Propagation for Large Models

arXiv 2112.14430 ↗First posted 29 Dec 2021cs.LG cs.CRcited by 7

Not on the map. Why?

Abstract (arXiv)

When applied to large-scale learning problems, the conventional wisdom on privacy-preserving deep learning, known as Differential Private Stochastic Gradient Descent (DP-SGD), has met with limited success due to significant performance degradation and high memory overhead when compared to the non-privacy counterpart. We show how to mitigate the performance drop by replacing the DP-SGD with a novel DP Forward-Propagation (DP-FP) followed by an off-the-shelf non-DP optimizer. Our DP-FP employs novel (1) representation clipping followed by noise addition in the forward propagation stage, as well as (2) micro-batch construction via subsampling to achieve DP amplification and reduce noise power to 1/M, where M is the number of micro-batch in a step. When training a classification model, our DP-FP with all of the privacy-preserving operations on the representation is innately free of gradient bias, total noise proportionally to model size, and memory issues in DP-SGD. As a result, our DP-FP outperforms cutting-edge DP-SGD while retaining the same level of privacy, and it approaches non-private baselines and significantly outperforms state-of-the-art DP-SGD variants. When applied to RoBERTa-large on four downstream tasks, for example, DP-FP achieves an average accuracy of 91.34% with privacy budgets less than 3, representing a 3.81% performance improvement over the state-of-the-art DP-SGD and only a 0.9% loss compared to the non-private baseline but with a significantly lower privacy leakage risk.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 29 Dec 2021.

Builds on

25 of 34 references.

References · 25

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  4. 2016Deep Learning with Differential Privacycited by 2,728
  5. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  6. 2020Extracting Training Data from Large Language Modelscited by 2,189
  7. 2017Decoupled Weight Decay Regularizationcited by 1,831
  8. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 864
  9. 2017Renyi Differential Privacycited by 650
  10. 2021Large Language Models Can Be Strong Differentially Private Learnerscited by 412
  11. 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 236
  12. 2019Differentially Private Learning with Adaptive Clippingcited by 220
13 more
  1. 2018Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoisingcited by 218
  2. 2021Numerical Composition of Differential Privacycited by 180
  3. 2020Understanding Gradient Clipping in Private SGD: A Geometric Perspectivecited by 142
  4. 2021Large-Scale Differentially Private BERTcited by 118
  5. 2019Deep Learning with Gaussian Differential Privacycited by 114
  6. 2021Large Scale Private Learning via Low-rank Reparametrizationcited by 88
  7. 2021Optimal Accounting of Differential Privacy via Characteristic Functioncited by 86
  8. 2019Differentially Private Model Publishing for Deep Learningcited by 71
  9. 2020Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorizationcited by 58
  10. 2020Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clippingcited by 47
  11. 2021Dynamic Differential-Privacy Preserving SGDcited by 30
  12. 2021An Efficient DP-SGD Mechanism for Large Scale NLP Modelscited by 27
  13. 2021Adaptive Differentially Private Empirical Risk Minimizationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

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

7 papers.