mlsanityData to 7 Oct 2026

Towards Understanding Generalization in DP-GD: A Case Study in Training Two-Layer CNNs

arXiv 2511.22270 ↗First posted 27 Nov 2025stat.ML cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Modern deep learning techniques focus on extracting intricate information from data to achieve accurate predictions. However, the training datasets may be crowdsourced and include sensitive information, such as personal contact details, financial data, and medical records. As a result, there is a growing emphasis on developing privacy-preserving training algorithms for neural networks that maintain good performance while preserving privacy. In this paper, we investigate the generalization and privacy performances of the differentially private gradient descent (DP-GD) algorithm, which is a private variant of the gradient descent (GD) by incorporating additional noise into the gradients during each iteration. Moreover, we identify a concrete learning task where DP-GD can achieve superior generalization performance compared to GD in training two-layer Huberized ReLU convolutional neural networks (CNNs). Specifically, we demonstrate that, under mild conditions, a small signal-to-noise ratio can result in GD producing training models with poor test accuracy, whereas DP-GD can yield training models with good test accuracy and privacy guarantees if the signal-to-noise ratio is not too small. This indicates that DP-GD has the potential to enhance model performance while ensuring privacy protection in certain learning tasks. Numerical simulations are further conducted to support our theoretical results.

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

Builds on

24 of 46 references.

References · 24

  1. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  2. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  3. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
  4. 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 292
  5. 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 199
  6. 2019Private Stochastic Convex Optimization with Optimal Ratescited by 183
  7. 2018Gradient descent aligns the layers of deep linear networkscited by 182
  8. 2020Directional convergence and alignment in deep learningcited by 172
  9. 2020Stability of Stochastic Gradient Descent on Nonsmooth Convex Lossescited by 172
  10. 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
  11. 2020Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 152
  12. 2020Feature Purification: How Adversarial Training Performs Robust Deep Learningcited by 107
12 more
  1. 2021Private Stochastic Convex Optimization: Optimal Rates in ℓ1 Geometrycited by 83
  2. 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
  3. 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
  4. 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
  5. 2017Efficient Private ERM for Smooth Objectivescited by 61
  6. 2024Implicit Bias of AdamW: ℓ_∞ Norm Constrained Optimizationcited by 54
  7. 2021Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settingscited by 45
  8. 2021On the Convergence and Calibration of Deep Learning with Differential Privacycited by 36
  9. 2024The Implicit Bias of Adam on Separable Datacited by 32
  10. 2021Does Momentum Change the Implicit Regularization on Separable Data?cited by 21
  11. 2021Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learningcited by 20
  12. 2023Implicit Bias of Gradient Descent for Two-layer ReLU and Leaky ReLU Networks on Nearly-orthogonal Datacited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.