Differentially Private Neural Network Training Under the Hidden State Assumption
Not on the map. Why?
Abstract (arXiv)
Current differentially private learning paradigms face a severe utility bottleneck: DP-SGD degrades performance through noise accumulation over training steps, while aggregation-based approaches such as PATE suffer from data inefficiency due to disjoint data partitioning. We propose Differentially Private Decoupled Training (DP-DT), a framework that decouples representation learning from privacy enforcement. DP-DT confines noise injection to the weight aggregation stage and employs auxiliary models, continuously synchronized with a global model, to perform noise-free feature extraction on private data shards. We prove that DP-DT converges globally to a limit point under non-convex objectives, via a Lyapunov potential analysis combined with the Kurdyka--Lojasiewicz property. Under the Hidden State Assumption, where adversaries observe only the final published model, we further prove that DP-DT's privacy loss can converge to a constant bound rather than accumulating with iterations. Empirical results across vision and language benchmarks confirm that DP-DT significantly mitigates utility degradation, achieving state-of-the-art privacy-utility trade-offs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 34 references that are in the map. First posted on arXiv 11 Jul 2024.
Builds on
20 of 34 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2016Deep Learning with Differential Privacycited by 2,682
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2016Semi-supervised Knowledge Transfer for Deep Learning from Private Training Datacited by 347
- 2022Deduplicating Training Data Mitigates Privacy Risks in Language Modelscited by 309
- 2018Scalable Private Learning with PATEcited by 266
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 118
- 2018Privacy Amplification by Iterationcited by 97
- 2022Automatic Clipping: Differentially Private Deep Learning Made Easier and Strongercited by 87
8 more
- 2021Do Not Let Privacy Overbill Utility: Gradient Embedding Perturbation for Private Learningcited by 86
- 2021Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descentcited by 71
- 2022Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Losscited by 60
- 2022Differentially Private Learning Needs Hidden State (Or Much Faster Convergence)cited by 45
- 2019Privacy Amplification by Mixing and Diffusion Mechanismscited by 21
- 2017Linearized ADMM for Non-convex Non-smooth Optimization with Convergence Analysiscited by 12
- 2018A Unified Framework of DNN Weight Pruning and Weight Clustering/Quantization Using ADMMcited by 10
- 2020A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based On the Augmented Lagrangiancited by 5
Built on by
Not cited yet.