mlsanityData to 14 Oct 2026

Privacy Amplification by Mixing and Diffusion Mechanisms

arXiv 1905.12264 ↗First posted 29 May 2019cs.LG cs.CR math.PRcited by 21

Not on the map. Why?

Abstract (arXiv)

A fundamental result in differential privacy states that the privacy guarantees of a mechanism are preserved by any post-processing of its output. In this paper we investigate under what conditions stochastic post-processing can amplify the privacy of a mechanism. By interpreting post-processing as the application of a Markov operator, we first give a series of amplification results in terms of uniform mixing properties of the Markov process defined by said operator. Next we provide amplification bounds in terms of coupling arguments which can be applied in cases where uniform mixing is not available. Finally, we introduce a new family of mechanisms based on diffusion processes which are closed under post-processing, and analyze their privacy via a novel heat flow argument. On the applied side, we generalize the analysis of "privacy amplification by iteration" in Noisy SGD and show it admits an exponential improvement in the strongly convex case, and study a mechanism based on the Ornstein-Uhlenbeck diffusion process which contains the Gaussian mechanism with optimal post-processing on bounded inputs as a special case.

Key facts. Cited by 21 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 6; 2022: 3; 2023: 5; 2024: 3; 2025: 2; 2026: 2.

21 papers.

Sort:

By area:

  1. 2021Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descentcited by 73
  2. 2022Differentially Private Learning Needs Hidden State (Or Much Faster Convergence)cited by 48
  3. 2023Faster high-accuracy log-concave sampling via algorithmic warm startscited by 45
  4. 2025Certified Unlearning for Neural Networkscited by 27
  5. 2022Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Samplingcited by 22
  6. 2023Differentially Private Natural Language Models: Recent Advances and Future Directionscited by 20
  7. 2024Tighter Privacy Auditing of DP-SGD in the Hidden State Threat Modelcited by 18
  8. 2021Local Differential Privacy Is Equivalent to Contraction of Eγ-Divergencecited by 17
  9. 2021Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channelscited by 15
  10. 2023Privacy Loss of Noisy Stochastic Gradient Descent Might Converge Even for Non-Convex Lossescited by 10
  11. 2022Differential Privacy Amplification in Quantum and Quantum-inspired Algorithmscited by 6
  12. 2021Privacy Amplification Via Bernoulli Samplingcited by 4
9 more
  1. 2021Privacy Amplification via Iteration for Shuffled and Online PNSGDcited by 4
  2. 2021Dimension-Free Rates for Natural Policy Gradient in Multi-Agent Reinforcement Learningcited by 4
  3. 2023Differentially Private Gradient Flow based on the Sliced Wasserstein Distancecited by 4
  4. 2023Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functionscited by 1
  5. 2026QUPID: A Partitioned Quantum Neural Network for Anomaly Detection in Smart Gridcited by 1
  6. 2024Differentially Private Neural Network Training Under the Hidden State Assumptioncited by 0
  7. 2024Adversarial Sample-Based Approach for Tighter Privacy Auditing in Final Model-Only Scenarioscited by 0
  8. 2025Securing Transfer-Learned Networks with Reverse Homomorphic Encryptioncited by 0
  9. 2026Local and Global Contraction Principles for MCMC Mixingcited by 0