It is shown that smooth-rate adaptation becomes possible once one discards from the rough class the densities that lie outside the smooth class but within an $L^2$-radius of the order of the private testing rate.
Abstract
In nonparametric density estimation without privacy constraints, it is known that a confidence set whose coverage holds uniformly over a `rough'class of regularity $r\geq0$ can simultaneously attain, in $L^2$-diameter, the minimax rate over a smaller, smoother class of regularity $s>r$ if and only if $s \le 2r$. We study such adaptive honest confidence sets under non-interactive $\alpha$-local differential privacy (LDP) constraints. Our main result is that, for bounded $\alpha$, such `smooth-rate adaptation'is now possible if and only if $s \le 4r/3$. In this smaller range we construct an honest private confidence set whose diameter is of the private minimax order on each of the two classes. As in the non-private case, the threshold arises because an honest set cannot, at a smooth density, be narrower than the separation rate arising in a related testing problem. Under LDP we prove that this private testing rate is of order $(n\alpha^2)^{-2r/(4r+3)}$, which is at most the private estimation rate $(n\alpha^2)^{-s/(2s+2)}$ over the smooth class exactly when $s \le 4r/3$. For $s>4r/3$, however, we show that smooth-rate adaptation becomes possible once one discards from the rough class the densities that lie outside the smooth class but within an $L^2$-radius of the order of the private testing rate.
We consider density estimation under the relaxed local differential privacy condition that the privatized distributions are $\alpha$-close in total variation distance. We show that adding independent noise with a convenient symmetrized Gamma distribution to each sensitive observation attains the $\alpha$-TV-LDP. We pro...
Cristina Butucea, Hui-Yun Tang, M. Taupin· 0 citations
Differential privacy provides a rigorous framework for protecting private information, typically achieved by adding random noise to query results. The generalized Gaussian family is a flexible class of additive noise distributions indexed by the shape parameter $p$ and includes the Laplace and Gaussian distributions as...
Xiang Zhang, M. O. Haye, Yi-Qiang Q. Zhao· 0 citations
The certificate preserves the mean-dependent variance of multinomial batch averages, yielding the near-optimal robust rate $O(\eta\sqrt{\log(1/\eta)/m})$ and providing the score required by the privacy reduction.
Gautam Kamath, Mahbod Majid, Ankur Moitra et al.· 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 direct operator-norm bound on the centered fluctuations of an ideal reconstruction, exploiting conditional independence rather than accumulating entrywise errors across each row is developed, sharpen the trade-off between approximation error and privacy protection.
The authors' lower bounds match the Binary Tree Mechanism instantiated with Laplace noise, establishing its asymptotic optimality under both pure differential privacy and approximate differential privacy in the standard regime of $\delta \ll1/n$.
Charlie Harrison, Ethan Leeman· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.