New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma

May 17, 2022 Β· Declared Dead Β· πŸ› Neural Information Processing Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gautam Kamath, Argyris Mouzakis, Vikrant Singhal arXiv ID 2205.08532 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CR, stat.ML Citations 35 Venue Neural Information Processing Systems Last Checked 3 months ago
Abstract
We prove new lower bounds for statistical estimation tasks under the constraint of $(\varepsilon, Ξ΄)$-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 $Ξ©(d^2)$ samples, and in spectral norm requires $Ξ©(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 \varepsilon))$ lower bound for estimating the mean of a distribution with bounded covariance to $Ξ±$-error in $\ell_2$-distance. Prior known lower bounds for all these problems were either polynomially weaker or held under the stricter condition of $(\varepsilon, 0)$-differential privacy.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted