It is determined that sharp minimax rates for distribution estimation under pure local differential privacy at critical query smoothness are determined, and matching lower bounds allow finite public blackboard interaction and repeated participation under each user's total privacy budget.
Abstract
We determine sharp minimax rates for distribution estimation under pure local differential privacy at critical query smoothness. For the integral probability metric generated by the unit ball of $B^d_{2,q}$, $1\le q\le\infty$, over fixed periodic Sobolev density balls with positive smoothness and interior slack at the uniform density, the expected risk is of order $N^{-1/2}(\log N)^{3/2-1/q}$, where $N=n\varepsilon^2$; expected squared risk has the squared order. The fine index governs aggregation across resolutions that share one private information budget. A single noninteractive release with a measurable proper density output attains these rates, and matching lower bounds allow finite public blackboard interaction and repeated participation under each user's total privacy budget. A known $L^2$ radius permits the same rates without using density smoothness, with output in the $L^2$ density ball. Separately, for positive smooth densities on $[0,1]$, integrated squared CDF risk has minimax order $(\log N)^2/N$, with sharp quantile, Wasserstein, and transport map consequences. The rates hold uniformly for $0<\varepsilon\le1$ as $N\to\infty$, with class parameters fixed.
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.
We prove a joint stochastic zeroth-order lower bound for Goldstein stationarity on a Euclidean query ball, even when the ball is guaranteed to contain a stationary point. In dimension $d$, let $f=\mathbb{E}[F(\cdot;\xi)]$, assume $\mathbb{E}[\operatorname{Lip}(F(\cdot;\xi))^2]\le L_0^2$, and bound the initial objective...
For many probability measures on $\mathbb{R}^n$, and for $k$ sufficiently smaller than $n$, most $k$-dimensional coordinate marginals are close to product measures. We prove this in two regimes, which notably involve no exchangeability assumptions as in prior theorems of de Finetti type. First, for log-concave measures...
We establish variance upper bounds for the minimum perfect matching problem in general metric spaces under a geometric partition condition. As a principal application, let $H_n$ be the minimum perfect matching cost of $n$ independent uniform points in $[0,1]^d$, where $n$ is even and $d\ge2$. We prove $$\operatorname{V...
The stochastic-gradient query complexity of sampling smooth strongly log-concave distributions in every fixed dimension is established and it is shown that dependence on initial distance is generally unavoidable.
We study the component-oracle complexity of finding approximate local minima of nonconvex finite sums under mean-squared averaged smoothness with parameter $L$ and a $\rho$-Lipschitz average Hessian. Each query returns the value, gradient, and one Hessian-vector product of a component. We show that the complexity in th...
Qi-Hao Zhou· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.