mlsanityData to 14 Oct 2026

Faster Learning under Relaxed Local Differential Privacy

arXiv 2609.05034 ↗First posted 4 Sep 2026math.ST stat.ML stat.THcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider density estimation under the relaxed local differential privacy condition that the privatized distributions are α-close in total variation distance. We show that adding independent noise with a convenient symmetrized Gamma distribution to each sensitive observation attains the α-TV-LDP. We prove that the deconvolution estimator of r-Sobolev smooth functions attains the pointwise rate (nα)^-frac2r-12r up to log factors which is faster than (nα2)^-frac2r-12r+1 under the classical α-LDP and closer to the nonprivate minimax rate n^-frac2r-12r. Next, we use a Goldenshluger-Lepski procedure to build a free of the smoothness adaptive procedure and show optimality of our rates in the convolution model of our privatisation scheme. We illustrate the benefits of this simple privacy mechanism by implementing a neural network estimator which does not need to add more noise in the optimization steps. Numerical results show significant improvement of the estimation rate over the Laplace and the private-SGD mechanisms.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 46 references that are in the map. First posted on arXiv 4 Sep 2026.

Builds on

2 of 46 references.

References · 2

  1. 2016Concentrated Differential Privacycited by 144
  2. 2025Non-Asymptotic Analysis of Online Local Private Learning with SGDcited by 1

Built on by

Not cited yet.