Clip Body and Tail Separately: High Probability Guarantees for DPSGD with Heavy Tails
Not on the map. Why?
Abstract (arXiv)
Differentially Private Stochastic Gradient Descent (DPSGD) is widely utilized to preserve training data privacy in deep learning, which first clips the gradients to a predefined norm and then injects calibrated noise into the training procedure. Existing DPSGD works typically assume the gradients follow sub-Gaussian distributions and design various clipping mechanisms to optimize training performance. However, recent studies have shown that the gradients in deep learning exhibit a heavy-tail phenomenon, that is, the tails of the gradient have infinite variance, which may lead to excessive clipping loss to the gradients with existing DPSGD mechanisms. To address this problem, we propose a novel approach, Discriminative Clipping~(DC)-DPSGD, with two key designs. First, we introduce a subspace identification technique to distinguish between body and tail gradients. Second, we present a discriminative clipping mechanism that applies different clipping thresholds for body and tail gradients to reduce the clipping loss. Under the non-convex condition, ourtech reduces the empirical gradient norm from mathbbOleft(logmax(0,θ-1)(T/δ)log2θ(√T)right) to mathbbOleft(log(√T)right) with heavy-tailed index θ≥ 1/2, iterations T, and arbitrary probability δ. Extensive experiments on four real-world datasets demonstrate that our approach outperforms three baselines by up to 9.72% in terms of accuracy.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 54 of its 70 references that are in the map. First posted on arXiv 27 May 2024.
Builds on
54 of 70 references.
References · 54
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Deep Learning with Differential Privacycited by 2,728
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 989
- 2017Renyi Differential Privacycited by 650
- 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 341
- 2020Think Locally, Act Globally: Federated Learning with Local and Global Representationscited by 325
- 2013The Composition Theorem for Differential Privacycited by 297
- 2020Differentially Private Learning Needs Better Features (or Much More Data)cited by 235
- 2019Differentially Private Learning with Adaptive Clippingcited by 220
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
- 2020Understanding Gradient Clipping in Private SGD: A Geometric Perspectivecited by 142
38 more
- 2020Momentum Improves Normalized SGDcited by 139
- 2020The Heavy-Tail Phenomenon in SGDcited by 124
- 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
- 2021Influence-Balanced Loss for Imbalanced Visual Classificationcited by 91
- 2020Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identificationcited by 90
- 2021Large Scale Private Learning via Low-rank Reparametrizationcited by 88
- 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
- 2023Differentially Private Diffusion Models Generate Useful Synthetic Imagescited by 86
- 2023Revisiting Gradient Clipping: Stochastic bias and tight convergence guaranteescited by 83
- 2019BackPACK: Packing more into backpropcited by 78
- 2019AdaCliP: Adaptive Clipping for Private SGDcited by 77
- 2021Understanding Clipping for Federated Learning: Convergence and Client-Level Differential Privacycited by 69
- 2020A High Probability Analysis of Adaptive SGD with Momentumcited by 61
- 2022Mixed Differential Privacy in Computer Visioncited by 54
- 2020On Differentially Private Stochastic Convex Optimization with Heavy-tailed Datacited by 51
- 2021Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Datacited by 47
- 2021Heavy Tails in SGD and Compressibility of Overparametrized Neural Networkscited by 44
- 2018Uniform Convergence of Gradients for Non-Convex Learning and Optimizationcited by 38
- 2022Differentially Private Federated Learning with Local Regularization and Sparsificationcited by 36
- 2022Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimizationcited by 36
- 2021Convergence Rates of Stochastic Gradient Descent under Infinite Noise Variancecited by 35
- 2020Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noisecited by 33
- 2020High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noisecited by 31
- 2022Pre-trained Perceptual Features Improve Differentially Private Image Generationcited by 28
- 2022Privacy-Preserving Face Recognition with Learnable Privacy Budgets in Frequency Domaincited by 28
- 2022Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerabilitycited by 25
- 2019Non-Gaussianity of Stochastic Gradient Noisecited by 22
- 2021Efficient-FedRec: Efficient Federated Learning Framework for Privacy-Preserving News Recommendationcited by 21
- 2022Differentially Private Learning with Per-Sample Adaptive Clippingcited by 21
- 2023Differentially Private Image Classification by Learning Priors from Random Processescited by 19
- 2022Improving Federated Learning Face Recognition via Privacy-Agnostic Clusterscited by 18
- 2023Choosing Public Datasets for Private Machine Learning via Gradient Subspace Distancecited by 16
- 2020Sharp Concentration Results for Heavy-Tailed Distributionscited by 15
- 2023Differentially Private SGD Without Clipping Bias: An Error-Feedback Approachcited by 14
- 2022DPIS: An Enhanced Mechanism for Differentially Private SGD with Importance Samplingcited by 13
- 2021Asymmetric Heavy Tails and Implicit Bias in Gaussian Noise Injectionscited by 12
- 2018The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Sharp Minima and Regularization Effectscited by 9
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 2.
5 papers.
- 2024From Gradient Clipping to Normalization for Heavy Tailed SGDcited by 49
- 2025DC-SGD: Differentially Private SGD with Dynamic Clipping through Gradient Norm Distribution Estimationcited by 6
- 2025Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limitscited by 3
- 2026Lap2: Revisiting Laplace DP-SGD for High Dimensions via Majorization Theorycited by 0
- 2026INO-SGD: Addressing Utility Imbalance under Individualized Differential Privacycited by 0
- 2026INO-SGD: Addressing Utility Imbalance under Individualized Differential Privacy8 May 2026
- 2026Lap2: Revisiting Laplace DP-SGD for High Dimensions via Majorization Theory26 Feb 2026
- 2025Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits12 Oct 2025
- 2025DC-SGD: Differentially Private SGD with Dynamic Clipping through Gradient Norm Distribution Estimation29 Mar 2025
- 2024From Gradient Clipping to Normalization for Heavy Tailed SGD17 Oct 2024