mlsanityData to 14 Oct 2026

DP-MacAdam: Differentially Private Mechanism with Adaptive Clipping and Adaptive Momentum

arXiv 2606.05435 ↗First posted 3 Jun 2026cs.LG cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

Differentially private stochastic gradient descent (DP-SGD) has become the standard framework for privacy-preserving machine learning, yet its reliance on a fixed gradient clipping threshold to limit sensitivity remains a significant practical limitation. Adaptive clipping algorithms such as AdaClip shift and scale the gradient prior to clipping and adding noise so that the clipped gradient yields a more informative descent direction. The shift and scaling parameters are selected adaptively based on the empirical mean and variance. However, in existing adaptive clipping algorithms, these empirical estimates have not been also used for momentum to accelerate training itself. On the other hand, DP-Adam is an algorithm that exploits Adam-like momentum updates based on the gradient mean and variance to accelerate training, but does not exploit these estimates for adaptive clipping. In this work, we propose Differentially Private Mechanism with Adaptive Clipping and Adaptive Momentum (DP-MacAdam), a novel algorithm that combines these two approaches so as to use the same mean and variance estimates for both clipping and momentum. We perform an analysis showing that DP-MacAdam estimates the gradient variances in a bias-free manner. In addition, we empirically evaluate the privacy and accuracy of DP-MacAdam, demonstrating that it achieves improved model utility compared to DP-SGD, AdaClip, and DP-Adam baselines, without requiring manual tuning of the clipping threshold.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 12 references that are in the map. First posted on arXiv 3 Jun 2026.

Builds on

8 of 12 references.

References · 8

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Deep Learning with Differential Privacycited by 2,728
  3. 2019AdaCliP: Adaptive Clipping for Private SGDcited by 77
  4. 2022Connect the Dots: Tighter Discrete Approximations of Privacy Loss Distributionscited by 52
  5. 2023DP-AdamBC: Your DP-Adam Is Actually DP-SGD (Unless You Apply Bias Correction)cited by 28
  6. 2018An improvement of the convergence proof of the ADAM-Optimizercited by 19
  7. 2025GeoClip: Geometry-Aware Clipping for Differentially Private SGDcited by 3
  8. 2025DP-AdamW: Investigating Decoupled Weight Decay and Bias Correction in Private Deep Learningcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.