A framework for the optimal privacy-utility tradeoff of ideal diffusion denoisers is developed, replacing conservative bounds with exact sensitivity characterizations and provably optimal noise calibration, and exact privacy guarantees for R\'enyi, approximate, and Gaussian differential privacy are obtained.
Abstract
Existing approaches to differential privacy in diffusion models rely on loose sensitivity bounds and isotropic Gaussian noise, leading to unnecessary estimation error. We develop a framework for the optimal privacy-utility tradeoff of ideal diffusion denoisers, replacing conservative bounds with exact sensitivity characterizations and provably optimal noise calibration. First, we show that worst-case sensitivity over datasets of arbitrary size can be characterized exactly using only two records. For a data domain of size $m$, this reduces the analysis to at most $m(m-1)$ constraints, regardless of dataset size. Our characterization can be arbitrarily tighter than conventional diameter-based sensitivity bounds, revealing potentially unbounded improvements in noise calibration. Second, we obtain exact privacy guarantees for R\'enyi, approximate, and Gaussian differential privacy, as well as mutual-information privacy for binary records, avoiding the looseness of previous generic privacy conversions. Finally, we show that the minimum achievable weighted mean-squared error can be computed through a semidefinite program and prove strong duality, providing certificates of global optimality.
The privacy analysis of differentially private stochastic gradient descent (DP-SGD) relies on bounds for the composition of subsampled mechanisms. The privacy of such a composition is bounded by that of a pair of product distributions, whose privacy loss is a sum of independent terms and has been analyzed via a variety...
Under approximate local privacy restricted to input pairs at distance at most $H$, it is proved that stringent approximate privacy forces the support size to scale as $\Omega(H/\delta)$.
A. Zamani, Parastoo Sadeghi, M. Skoglund· 0 citations
Saturated Propose-test-release, a general mechanism that privately releases the output of a discrete selector with probability one once its stability certificate reaches a finite threshold, is introduced and a computable support-stability score is constructed.
A two-stage adaptive mechanism that first obtains a privacy-preserving estimate of how spread out the data are, using the interquartile range (IQR) as the measure of dispersion, and then uses that estimate to shrink the noise added to the query answer whenever the data are concentrated.
Bekir Danış, Muhammed Hasdemir· Erciyes Üniversitesi Fen Bil...· 0 citations
It is shown that the privacy loss incurred by One-Posterior-Sampling (OPS) is governed by posterior exponential moments of the single-record log-likelihood ratio, and explicit DP guarantees under uniformly bounded, sub-Gaussian, or sub-exponential tail regimes are established.
Distributed zeroth-order optimization has gained increasing attention in applications where exact gradients are computationally expensive or unavailable. However, the iterative exchange of local decision variables makes distributed networks vulnerable to inference attacks. While differential privacy provides a rigorous...
Jia-Jun Wang, Yujie Tang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.