cs.LGOct 12, 2026

Can Rényi Accountants Beat Lossless Accountants for DP-SGD?

Authors: Jinho Bok

Organizations: Department of Statistics and Data Science, University of Pennsylvania.

Abstract

Recent frameworks in differential privacy (DP), such as privacy loss distributions and ff-DP, provide lossless representations of the privacy leakage of mechanisms. These approaches are often considered to yield tighter (ε,δ)(\varepsilon, δ)-DP guarantees than those obtained from relaxed notions such as Rényi DP. But is that always the case? We study this question for differentially private stochastic gradient descent (DP-SGD) with fixed-size batches under replace adjacency. Our key observation is that in this setting, privacy accounting based on Rényi DP can use a pair of worst-case distributions (i.e., a dominating pair) that differs from the one used in the lossless frameworks. In particular, we characterize the worst-case distributions as two-dimensional Gaussian mixtures and derive an improved Rényi DP bound for DP-SGD. Numerical and asymptotic comparisons show that across various hyperparameter settings, a Rényi DP accountant based on the new bound can yield better privacy guarantees than those obtained from the lossless frameworks.

Figures & tables

Appendix figures & tables7 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms

    May 25, 2026Christoph H. Lampert, Max Cairney-Leeming, Hossein ZakeriniaPAC-Bayesian Generalization BoundsDifferentially Private Stochastic Gradient Descent

  2. Efficient privacy loss accounting for subsampling and random allocation

    Feb 19, 2026Vitaly Feldman, Moshe ShenfeldDifferential PrivacyPrivacy-Utility Tradeoff