INSPECTRE: Privately Estimating the Unseen

February 28, 2018 Β· Declared Dead Β· πŸ› International Conference on Machine Learning

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jayadev Acharya, Gautam Kamath, Ziteng Sun, Huanyu Zhang arXiv ID 1803.00008 Category cs.DS: Data Structures & Algorithms Cross-listed cs.CR, cs.IT, cs.LG, math.ST Citations 22 Venue International Conference on Machine Learning Last Checked 3 months ago
Abstract
We develop differentially private methods for estimating various distributional properties. Given a sample from a discrete distribution $p$, some functional $f$, and accuracy and privacy parameters $Ξ±$ and $\varepsilon$, the goal is to estimate $f(p)$ up to accuracy $Ξ±$, while maintaining $\varepsilon$-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.
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