Beyond worst-case analysis in private singular vector computation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 331-340

  Hardt, Moritz ^a   Roth, Aaron ^b  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Differential privacy; Singular value decomposition

Indexed keywords

COHERENCE PARAMETERS; DIFFERENTIAL PRIVACIES; ITERATION ALGORITHMS; LOW RANK APPROXIMATIONS; ROBUST ANALYSIS; SINGULAR VECTORS; SPECTRAL NORMS; WORST-CASE ANALYSIS;

APPROXIMATION ALGORITHMS; SINGULAR VALUE DECOMPOSITION;

COMPUTATION THEORY;

EID: 84879816605     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488650     Document Type: Conference Paper

References (14)

1. Jeremiah Blocki, Avrim Blum, Anupam Datta, and Or Sheffet. The Johnson-Lindenstrauss transform itself preserves differential privacy. STOC, 2012.
2. Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim. Practical privacy: the SuLQ framework. In Proc. 24th PODS, pages 128-138. ACM, 2005.
3. Emmanuel Candes and Benjamin Recht. Exact matrix completion via convex optimization. Foundations of Computional Mathematics, 9:717-772, December 2009.
4. Emmanuel J. Candès and Terence Tao. The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5):2053-2080, 2010.
5. Kamalika Chaudhuri, Anand Sarwate, and Kaushik Sinha. Near-optimal differentially private principal components. In Proc. 26th Annual Conference on Neural Information Processing Systems (NIPS), 2012.
6. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In Proc. 22nd PODS, pages 202-210. ACM, 2003.
7. Cynthia Dwork, Guy N. Rothblum, and Salil Vadhan. Boosting and differential privacy. In Proc. 51st Foundations of Computer Science (FOCS). IEEE, 2010.
8. Anupam Gupta, Aaron Roth, and Jonathan Ullman. Iterative constructions and private data release. In TCC, volume 7194, pages 339-356. Springer, 2012.
9. Moritz Hardt and Aaron Roth. Beating randomized response on incoherent matrices. In Proc. 44th Symposium on Theory of Computing (STOC), pages 1255-1268. ACM, 2012.
10. Moritz Hardt and Guy Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proc. 51st Foundations of Computer Science (FOCS), pages 61-70. IEEE, 2010.
11. Michael Kapralov and Kunal Talwar. On differentially private low rank approximation. In Proc. 24rd Symposium on Discrete Algorithms (SODA). ACM-SIAM, 2013.
12. Frank McSherry and Kunal Talwar. Mechanism design via differential privacy. In Proc. 48th Foundations of Computer Science (FOCS), pages 94-103. IEEE, 2007.
13. Arvind Narayanan and Vitaly Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy (S&P), pages 111-125. IEEE, 2008.
14. Anand Talwalkar and Afshin Rostamizadeh. Matrix coherence and the nystrom method. In Proc. 26th Conference on Uncertainty in Artificial Intelligence (UAI), 2010.