mlsanityData to 14 Oct 2026

Privacy Amplification in Differentially Private Zeroth-Order Optimization with Hidden States

arXiv 2506.00158 ↗First posted 30 May 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Zeroth-order optimization has emerged as a promising approach for fine-tuning large language models under differential privacy (DP) and memory constraints. While privacy amplification by iteration (PABI) provides convergent DP bounds for first-order methods, establishing similar guarantees for zeroth-order methods remains an open problem. First-order PABI analysis relies on the fact that gradients are perturbed with isotropic noise, allowing privacy bounds to be iteratively tracked via shifted R'enyi divergence. In contrast, DP zeroth-order methods inject scalar noise along random update directions to maintain utility. This anisotropic update fails standard shifted divergence frameworks, as the global Lipschitz property no longer holds almost surely. We provide the first convergent hidden-state DP bound for zeroth-order optimization by proposing a hybrid noise mechanism and a novel coupling analysis. We bypass the purely shifted-divergence approach by constructing a coupled auxiliary process, which circumvents the global Lipschitz barrier and yields a convergent privacy bound. Furthermore, our results induce better DP zeroth-order algorithmic designs that are previously unknown to the literature.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 30 May 2025.

Builds on

29 of 42 references.

References · 29

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2016Deep Learning with Differential Privacycited by 2,728
  3. 2017Renyi Differential Privacycited by 650
  4. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
  5. 2021Large Language Models Can Be Strong Differentially Private Learnerscited by 412
  6. 2021Differentially Private Fine-tuning of Language Modelscited by 400
  7. 2018Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergencescited by 242
  8. 2019R'enyi Differential Privacy of the Sampled Gaussian Mechanismcited by 204
  9. 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
  10. 2021Practical and Private (Deep) Learning without Sampling or Shufflingcited by 170
  11. 2019A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Normcited by 106
  12. 2018Privacy Amplification by Iterationcited by 100
17 more
  1. 2021Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descentcited by 73
  2. 2022Privacy of Noisy Stochastic Gradient Descent: More Iterations without More Privacy Losscited by 61
  3. 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearningcited by 49
  4. 2022Differentially Private Learning Needs Hidden State (Or Much Faster Convergence)cited by 48
  5. 2024Private Fine-tuning of Large Language Models with Zeroth-order Optimizationcited by 41
  6. 2023DPZero: Private Fine-Tuning of Language Models without Backpropagationcited by 26
  7. 2022Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Samplingcited by 22
  8. 2024Tighter Privacy Auditing of DP-SGD in the Hidden State Threat Modelcited by 18
  9. 2024Differentially Private Zeroth-Order Methods for Scalable Large Language Model Finetuningcited by 14
  10. 2024Certified Machine Unlearning via Noisy Stochastic Gradient Descentcited by 14
  11. 2024The Last Iterate Advantage: Empirical Auditing and Principled Heuristic Analysis of Differentially Private SGDcited by 11
  12. 2023Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Lossescited by 10
  13. 2024It's Our Loss: No Privacy Amplification for Hidden State DP-SGD With Non-Convex Losscited by 10
  14. 2024Private Zeroth-Order Nonsmooth Nonconvex Optimizationcited by 8
  15. 2024Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothnesscited by 8
  16. 2024Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex composite lossescited by 6
  17. 2024Differentially Private Graph Diffusion with Applications in Personalized PageRankscited by 4

Built on by

Not cited yet.