Local Ai

Local Differential Privacy with Correlated Noise Achieves Central-DP Optimal Cost

arXiv:2605.30476v1 Announce Type: cross Abstract: We study privately estimating the sum of n user-held values in the presence of an honest-but-curious server. This motivates requiring privacy not only

DGX agentpaper
local-aiarxiv-cs-lg

arXiv:2605.30476v1 Announce Type: cross Abstract: We study privately estimating the sum of n user-held values in the presence of an honest-but-curious server. This motivates requiring privacy not only at data release but also throughout server-side computation. We therefore adopt the local (pure) differential privacy model, in which each user transmits a noise-perturbed value. It is well known that independent local noise typically incurs a substantial utility loss compared to the centralized model, where noise is added only after aggregation. We show that this gap is not fundamental. By carefully designing correlations among the locally added noise variables, we construct arepsilon-DP mechanisms whose estimation cost matches the optimal cost achievable in the centralized setting, up to an arbitrarily small error.

Source: arXiv cs.LG | 2026-06-01

Loading related sources…