SA-DPSGD: Differentially Private Stochastic Gradient Descent based on Simulated Annealing
Not on the map. Why?
Abstract (arXiv)
Differential privacy (DP) provides a formal privacy guarantee that prevents adversaries with access to machine learning models from extracting information about individual training points. Differentially private stochastic gradient descent (DPSGD) is the most popular training method with differential privacy in image recognition. However, existing DPSGD schemes lead to significant performance degradation, which prevents the application of differential privacy. In this paper, we propose a simulated annealing-based differentially private stochastic gradient descent scheme (SA-DPSGD) which accepts a candidate update with a probability that depends both on the update quality and on the number of iterations. Through this random update screening, we make the differentially private gradient descent proceed in the right direction in each iteration, and result in a more accurate model finally. In our experiments, under the same hyperparameters, our scheme achieves test accuracies 98.35%, 87.41% and 60.92% on datasets MNIST, FashionMNIST and CIFAR10, respectively, compared to the state-of-the-art result of 98.12%, 86.33% and 59.34%. Under the freely adjusted hyperparameters, our scheme achieves even higher accuracies, 98.89%, 88.50% and 64.17%. We believe that our method has a great contribution for closing the accuracy gap between private and non-private image classification.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 46 references that are in the map. First posted on arXiv 14 Nov 2022.
Builds on
27 of 46 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Deep Learning with Differential Privacycited by 2,728
- 2019Deep Leakage from Gradientscited by 1,021
- 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 864
- 2017Renyi Differential Privacycited by 650
- 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 520
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 460
- 2021Opacus: User-Friendly Differential Privacy Library in PyTorchcited by 383
- 2019Differential Privacy Has Disparate Impact on Model Accuracycited by 316
- 2018Beyond Inferring Class Representatives: User-Level Privacy Leakage From Federated Learningcited by 246
15 more
- 2020Differentially Private Learning Needs Better Features (or Much More Data)cited by 235
- 2020A review of deep learning in medical imaging: Imaging traits, technology trends, case studies with progress highlights, and future promisescited by 231
- 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 204
- 2017Machine Learning Models that Remember Too Muchcited by 169
- 2018An overview of deep learning in medical imaging focusing on MRIcited by 140
- 2020Tempered Sigmoid Activations for Deep Learning with Differential Privacycited by 122
- 2020Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identificationcited by 90
- 2022Automatic Clipping: Differentially Private Deep Learning Made Easier and Strongercited by 88
- 2021Do Not Let Privacy Overbill Utility: Gradient Embedding Perturbation for Private Learningcited by 86
- 2019Hypothesis Testing Interpretations and Renyi Differential Privacycited by 85
- 2022Mixed Differential Privacy in Computer Visioncited by 54
- 2018Concentrated Differentially Private Gradient Descent with Adaptive per-Iteration Privacy Budgetcited by 32
- 2021DPNAS: Neural Architecture Search for Deep Learning with Differential Privacycited by 20
- 2019Automatic Discovery of Privacy-Utility Pareto Frontscited by 16
- 2019An Adaptive and Fast Convergent Approach to Differentially Private Deep Learningcited by 13
Built on by
Citing papers per year: 2025: 1.
1 paper.