Boosting and Differential Privacy
@article{Dwork2010BoostingAD, title={Boosting and Differential Privacy}, author={C. Dwork and G. N. Rothblum and S. Vadhan}, journal={2010 IEEE 51st Annual Symposium on Foundations of Computer Science}, year={2010}, pages={51-60} }
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved {\em privacy-preserving synopses} of an input database. These are data structures that yield, for a given set $\Q$ of queries over an input database, reasonably accurate estimates of the responses to every query in~$\Q$, even when the number of queries is much larger than the number of rows in the database. Given a {\em base synopsis generator} that takes a distribution on $\Q… CONTINUE READING
Figures and Topics from this paper
Figures
576 Citations
The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Computer Science, Mathematics
- SIAM J. Comput.
- 2016
- 16
Differentially Private Data Releasing for Smooth Queries with Synthetic Database Output
- Computer Science, Mathematics
- ArXiv
- 2014
- 1
- PDF
Between Pure and Approximate Differential Privacy
- Mathematics, Computer Science
- J. Priv. Confidentiality
- 2016
- 65
- PDF
A learning theory approach to noninteractive database privacy
- Mathematics, Computer Science
- JACM
- 2013
- 250
- PDF
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2015
- 25
- PDF
On Avoiding the Union Bound When Answering Multiple Differentially Private Queries
- Mathematics, Computer Science
- ArXiv
- 2020
- PDF
Closure Properties for Private Classification and Online Prediction
- Computer Science, Mathematics
- COLT
- 2020
- 6
- PDF
References
SHOWING 1-10 OF 36 REFERENCES
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
- Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010
- 331
- PDF
The uniform hardcore lemma via approximate Bregman projections
- Computer Science, Mathematics
- SODA
- 2009
- 47
- PDF
A learning theory approach to non-interactive database privacy
- Computer Science
- STOC '08
- 2008
- 490
- Highly Influential
- PDF
The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries
- Computer Science
- ArXiv
- 2009
- 17
On the complexity of differentially private data release: efficient algorithms and hardness results
- Computer Science
- STOC '09
- 2009
- 308
- PDF