INSPECTRE: Privately Estimating the Unseen
Jayadev Acharya, Gautam Kamath, Ziteng Sun, Huanyu Zhang

TL;DR
This paper introduces differentially private methods for estimating distributional properties like support size and entropy, demonstrating that privacy costs are often negligible and providing tight bounds on sample complexity.
Contribution
It develops new privacy-preserving estimation techniques for distributional functionals with tight sample complexity bounds and minimal privacy costs.
Findings
Almost-tight bounds on sample size for private estimation
Privacy cost is negligible in many settings
Methods are based on sensitivity analysis of existing estimators
Abstract
We develop differentially private methods for estimating various distributional properties. Given a sample from a discrete distribution , some functional , and accuracy and privacy parameters and , the goal is to estimate up to accuracy , while maintaining -differential privacy of the sample. We prove almost-tight bounds on the sample size required for this problem for several functionals of interest, including support size, support coverage, and entropy. We show that the cost of privacy is negligible in a variety of settings, both theoretically and experimentally. Our methods are based on a sensitivity analysis of several state-of-the-art methods for estimating these properties with sublinear sample complexities.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Stochastic Gradient Optimization Techniques
