Transaction

jmetaB02a9757a9b879c7be0fd2e0c0481ff3937aa209ed24980978d0ff2b8b1944f9f8d@104e04f4dc7bbb58b675a0be8ec8a2392cd828cadc0c1b85347e2d4ab003150erss.itemmetarss.netMÜ<item> <title>It's Our Loss: No Privacy Amplification for Hidden State DP-SGD With Non-Convex Loss</title> <link>https://arxiv.org/abs/2407.06496</link> <description>arXiv:2407.06496v1 Announce Type: cross Abstract: Differentially Private Stochastic Gradient Descent (DP-SGD) is a popular iterative algorithm used to train machine learning models while formally guaranteeing the privacy of users. However the privacy analysis of DP-SGD makes the unrealistic assumption that all intermediate iterates (aka internal state) of the algorithm are released since in practice, only the final trained model, i.e., the final iterate of the algorithm is released. In this hidden state setting, prior work has provided tighter analyses, albeit only when the loss function is constrained, e.g., strongly convex and smooth or linear. On the other hand, the privacy leakage observed empirically from hidden state DP-SGD, even when using non-convex loss functions suggest that there is in fact a gap between the theoretical privacy analysis and the privacy guarantees achieved in practice. Therefore, it remains an open question whether privacy amplification for DP-SGD is possible in the hidden state setting for general loss functions. Unfortunately, this work answers the aforementioned research question negatively. By carefully constructing a loss function for DP-SGD, we show that for specific loss functions, the final iterate of DP-SGD alone leaks as much information as the sequence of all iterates combined. Furthermore, we empirically verify this result by evaluating the privacy leakage from the final iterate of DP-SGD with our loss function and show that this matches the theoretical upper bound guaranteed by DP exactly. Therefore, we show that the current privacy analysis fo DP-SGD is tight for general loss functions and conclude that no privacy amplification is possible for DP-SGD in general for all (possibly non-convex) loss functions.</description> <guid isPermaLink="false">oai:arXiv.org:2407.06496v1</guid> <category>cs.LG</category> <category>cs.CR</category> <arxiv:announce_type>cross</arxiv:announce_type> <dc:rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0/</dc:rights> <dc:creator>Meenatchi Sundaram Muthu Selva Annamalai</dc:creator> </item>