An adaptive mechanism for accurate query answering under differential privacy
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a different set of "strategy" queries to answer privately, using those answers to derive answers to the workload. The main algorithm proposed in this paper approximates the optimal strategy for any workload of linear counting queries. With no cost to the privacy guarantee, the mechanism improves significantly on prior approaches and achieves near-optimal error for many workloads, when applied under (ε, δ)-differential privacy. The result is an adaptive mechanism which can help users achieve good utility without requiring that they reason carefully about the best formulation of their task.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835 · cited 3×
“Approximate differential privacy can be achieved by adding Gaussian noise calibrated to the L2 sensitivity of the queries [9, 17].”
Background
Cited by
PrivBayes: Private Data Release via Bayesian Networks
Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3134428 · Cited by 399
A simple and practical algorithm for differentially private data release
Hardt, M., Ligett, K., & McSherry, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.4763 · Cited by 283
PrivBayes: private data release via bayesian networks
Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2588573 · Cited by 281
Differential Privacy: An Economic Method for Choosing Epsilon
Hsu, J., Gaboardi, M., Haeberlen, A., Khanna, S., Narayan, A., Pierce, B. C., & Roth, A. (2014) · 2014 IEEE 27th Computer Security Foundations Symposium · doi:10.1109/csf.2014.35 · Cited by 272
Differentially private grids for geospatial data
Qardaji, W., Yang, W., & Li, N. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544872 · Cited by 260
How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacy
Ponomareva, N., Hazimeh, H., Kurakin, A., Xu, Z., Denison, C., McMahan, H. B., Vassilvitskii, S., Chien, S., & Thakurta, A. G. (2023) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.14649 · Cited by 166
“For this setting, Hardt et al. (2010) introduced MWEM-mechanism based on private multiplicative weights, Li & Miklau (2012)’s mechanism is based on Matrix Mechanisms; Dual Query by Balle & Wang (2018) algorithm views the synthetic data generation setup as a zero-sum game.”
MethodAn economic analysis of privacy protection and statistical accuracy as social choices
Abowd, J. M., & Schmutte, I. M. (2019) · American Economic Review · doi:10.1257/aer.20170627 · Cited by 162
On the Power of Multiple Anonymous Messages
Ghazi, B., Golowich, N., Kumar, R., Pagh, R., & Velingker, A. (2019) · arXiv · doi:10.48550/arxiv.1908.11358 · Cited by 26
“To turn this into a protocol with small maximum communication in the shuffled model, we develop an approach analogous to the matrix mechanism [39, 40].”
BackgroundMethodInfluential
Metadata
- Authors
- Li, C., & Miklau, G.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-02
- Volume
- 5
- Issue
- 6
- Pages
- 514-525
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2045072234
- Cited by
- 105
- References
- 2
- FWCI
- 13.30
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.