Analyze gauss: optimal bounds for privacy-preserving principal component analysis
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We consider the problem of privately releasing a low dimensional approximation to a set of data records, represented as a matrix A in which each row corresponds to an individual and each column to an attribute. Our goal is to compute a subspace that captures the covariance of A as much as possible, classically known as principal component analysis (PCA). We assume that each row of A has ℓ2 norm bounded by one, and the privacy guarantee is defined with respect to addition or removal of any single row. We show that the well-known, but misnamed, randomized response algorithm, with properly tuned parameters, provides nearly optimal additive quality gap compared to the best possible singular subspace of A. We further show that when ATA has a large eigenvalue gap -- a reason often cited for PCA -- the quality improves significantly. Optimality (up to logarithmic factors) is proved using techniques inspired by the recent work of Bun, Ullman, and Vadhan on applying Tardos's fingerprinting codes to the construction of hard instances for private mechanisms for 1-way marginal queries. Along the way we define a list culling game which may be of independent interest.
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
Self-citationThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Self-citationOur 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 2×
“Specifically, we will use the Gaussian mechanism [12], which adds independently chosen Gaussian noise to each entry of AA.”
MethodSelf-citation
Cited by
Deep Learning with Differential Privacy
Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K., & Zhang, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978318 · Cited by 6,578
Self-citationThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Self-citationDifferential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
Privacy-Preserving Machine Learning: Threats and Solutions
Al-Rubaie, M., & Chang, J. M. (2019) · IEEE Security & Privacy · doi:10.1109/msec.2018.2888775 · Cited by 444
Personalized Federated Learning With Differential Privacy
Hu, R., Guo, Y., Li, H., Pei, Q., & Gong, Y. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2991416 · Cited by 350
“The differentially private approaches in machine learning can be categorized according to the object it perturbs: one is to directly add noises to the training data [30], another is to add noises to the output of training at each iteration or at the end [6].”
Background
Metadata
- Authors
- Dwork, C., Talwar, K., Thakurta, A., & Zhang, L.
- Venue
- Proceedings of the forty-sixth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2014-05-31
- Pages
- 11-20
- OpenAlex
- W1997690112
- Cited by
- 173
- References
- 3
- FWCI
- 5.53
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Analyze gauss: optimal bounds for privacy-preserving principal component analysis. https://app.cochat.ai/papers/10.1145/2591796.2591883
- The paper
- Dwork, C., Talwar, K., Thakurta, A., & Zhang, L. (2014). Analyze gauss: optimal bounds for privacy-preserving principal component analysis. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/2591796.2591883
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.