Beyond worst-case analysis in private singular vector computation

DOI10.1145/2488608.2488650zbMath1293.68144arXiv1211.0975OpenAlexW2043969662MaRDI QIDQ5495803

Moritz Hardt, Aaron Roth

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.0975

zbMATH Keywords

spectral analysisdifferential privacysingular vector computation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Inferring ground truth from crowdsourced data under local attribute differential privacy

This page was built for publication: Beyond worst-case analysis in private singular vector computation