Sign inGet started
Paper · arXiv

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

Recent frameworks in differential privacy (DP), such as privacy loss distributions and $f$-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 partic...

AuthorsJinho Bok
Primary categorycs.LG
Published12 October 2026
Last updated at source12 October 2026
cs.LGcs.CRcs.DScs.ITstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/30907faf-a6df-4da2-bf1f-f03ea2ab9c1a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 15 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.