We propose a simple heuristic privacy analysis of noisy clipped stochastic gradient descent (DP-SGD) in the setting where only the last iterate is released and the intermediate iterates remain hidden. Namely, our heuristic assumes a linear structure for the model.We show experimentally that our heuristic is predictive of the outcome of privacy auditing applied to various training procedures. Thus it can be used prior to training as a rough estimate of the final privacy leakage. We also probe the limitations of our heuristic by providing some artificial counterexamples where it underestimates the privacy leakage.The standard composition-based privacy analysis of DP-SGD effectively assumes that the adversary has access to all intermediate iterates, which is often unrealistic. However, this analysis remains the state of the art in practice. While our heuristic does not replace a rigorous privacy analysis, it illustrates the large gap between the best theoretical upper bounds and the privacy auditing lower bounds and sets a target for further work to improve the theoretical privacy analyses. We also empirically support our heuristic and show existing privacy auditing attacks are bounded by our heuristic analysis in both vision and language tasks.
View on arXiv@article{steinke2025_2410.06186,
title={ The Last Iterate Advantage: Empirical Auditing and Principled Heuristic Analysis of Differentially Private SGD },
author={ Thomas Steinke and Milad Nasr and Arun Ganesh and Borja Balle and Christopher A. Choquette-Choo and Matthew Jagielski and Jamie Hayes and Abhradeep Guha Thakurta and Adam Smith and Andreas Terzis },
journal={arXiv preprint arXiv:2410.06186},
year={ 2025 }
}