Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
Shyam Narayanan

TL;DR
This paper establishes tight lower bounds for high-dimensional differentially private estimation of Gaussian covariance and heavy-tailed distribution means, improving simplicity and scope over prior work.
Contribution
It provides new, simpler lower bounds for covariance and mean estimation under approximate differential privacy, extending previous results to broader settings.
Findings
Lower bound for Gaussian covariance estimation is tight up to logarithmic factors.
Lower bound for heavy-tailed mean estimation applies to bounded $k$th moments and generalizes previous work.
Techniques include fingerprinting and Bayesian methods, offering simpler proofs.
Abstract
We provide optimal lower bounds for two well-known parameter estimation (also known as statistical estimation) tasks in high dimensions with approximate differential privacy. First, we prove that for any , estimating the covariance of a Gaussian up to spectral error requires samples, which is tight up to logarithmic factors. This result improves over previous work which established this for , and is also simpler than previous work. Next, we prove that estimating the mean of a heavy-tailed distribution with bounded th moments requires samples. Previous work for this problem was only able to establish this lower bound against pure differential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Statistical Methods and Bayesian Inference · Distributed Sensor Networks and Detection Algorithms
