Beyond worst-case analysis in private singular vector computation
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We consider differentially private approximate singular vector computation. Known worst-case lower bounds show that the error of any differentially private algorithm must scale polynomially with the dimension of the singular vector. We are able to replace this dependence on the dimension by a natural parameter known as the coherence of the matrix that is often observed to be significantly smaller than the dimension both theoretically and empirically. We also prove a matching lower bound showing that our guarantee is nearly optimal for every setting of the coherence parameter. Notably, we achieve our bounds by giving a robust analysis of the well-known power iteration algorithm, which may be of independent interest. Our algorithm also leads to improvements in worst-case settings and to better low-rank approximations in the spectral norm.
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
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 3×
“Unfortunately, the ad-hoc anonymization of this dataset proved to be insu ffi cient, and Narayanan and Shmatikov [NS08] were able to re-identify many of the users.”
BackgroundInfluentialBoosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784 · cited 1×
“Our algorithm matches these worst case bounds, and also gives worst case bounds for ( ε,δ )-privacy, with error O ( √ n/ε ).”
Background
Cited by
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Self-citationThe composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Differential Privacy Preserving of Training Model in Wireless Big Data with Edge Computing
Du, M., Wang, K., Xia, Z., & Zhang, Y. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2829886 · Cited by 111
Metadata
- Authors
- Hardt, M., & Roth, A.
- Venue
- Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2013-06
- Pages
- 331-340
- OpenAlex
- W2043969662
- Cited by
- 90
- References
- 2
- FWCI
- 8.67
- 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: Beyond worst-case analysis in private singular vector computation. https://app.cochat.ai/papers/10.1145/2488608.2488650
- The paper
- Hardt, M., & Roth, A. (2013). Beyond worst-case analysis in private singular vector computation. Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. https://doi.org/10.1145/2488608.2488650
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.