Computer Science – Data Structures and Algorithms
Scientific paper
2010-12-21
Computer Science
Data Structures and Algorithms
rewritten, with much more extensive experimental validation than the previous version
Scientific paper
We present new theoretical results on differentially private data release useful with respect to any target class of counting queries, coupled with experimental results on a variety of real world data sets. Specifically, we study a simple combination of the multiplicative weights approach of [Hardt and Rothblum, 2010] with the exponential mechanism of [McSherry and Talwar, 2007]. The multiplicative weights framework allows us to maintain and improve a distribution approximating a given data set with respect to a set of counting queries. We use the exponential mechanism to select those queries most incorrectly tracked by the current distribution. Combing the two, we quickly approach a distribution that agrees with the data set on the given set of queries up to small error. The resulting algorithm and its analysis is simple, but nevertheless improves upon previous work in terms of both error and running time. We also empirically demonstrate the practicality of our approach on several data sets commonly used in the statistical community for contingency table release.
Hardt Moritz
Ligett Katrina
McSherry Frank
No associations
LandOfFree
A simple and practical algorithm for differentially private data release does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A simple and practical algorithm for differentially private data release, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple and practical algorithm for differentially private data release will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96737