English

New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma

Data Structures and Algorithms 2023-03-29 v5 Cryptography and Security Machine Learning

Abstract

We prove new lower bounds for statistical estimation tasks under the constraint of (ε,δ)(\varepsilon, \delta)-differential privacy. First, we provide tight lower bounds for private covariance estimation of Gaussian distributions. We show that estimating the covariance matrix in Frobenius norm requires Ω(d2)\Omega(d^2) samples, and in spectral norm requires Ω(d3/2)\Omega(d^{3/2}) samples, both matching upper bounds up to logarithmic factors. The latter bound verifies the existence of a conjectured statistical gap between the private and the non-private sample complexities for spectral estimation of Gaussian covariances. We prove these bounds via our main technical contribution, a broad generalization of the fingerprinting method to exponential families. Additionally, using the private Assouad method of Acharya, Sun, and Zhang, we show a tight Ω(d/(α2ε))\Omega(d/(\alpha^2 \varepsilon)) lower bound for estimating the mean of a distribution with bounded covariance to α\alpha-error in 2\ell_2-distance. Prior known lower bounds for all these problems were either polynomially weaker or held under the stricter condition of (ε,0)(\varepsilon, 0)-differential privacy.

Keywords

Cite

@article{arxiv.2205.08532,
  title  = {New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma},
  author = {Gautam Kamath and Argyris Mouzakis and Vikrant Singhal},
  journal= {arXiv preprint arXiv:2205.08532},
  year   = {2023}
}

Comments

NeurIPS 2022. Minor correction to the discussion of independent work

R2 v1 2026-06-24T11:20:19.573Z