Beating randomized response on incoherent matrices

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 1255-1268

  Hardt, Moritz ^a   Roth, Aaron ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

differential privacy; singular value decomposition

Indexed keywords

BEST-KNOWN ALGORITHMS; CONSTANT RANK; DATA MINING TASKS; DIFFERENTIAL PRIVACIES; INPUT PERTURBATION; LOW RANK APPROXIMATIONS; LOW-COHERENCE; N-MATRIX; NOISE MATRIX; RANDOM NOISE; RANDOMIZED RESPONSE; SENSITIVE INFORMATIONS;

ALGORITHMS; COMPUTATION THEORY; RANDOM VARIABLES; SINGULAR VALUE DECOMPOSITION;

MATRIX ALGEBRA;

EID: 84862594279     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214088     Document Type: Conference Paper

References (22)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In Proc. 33rd Symposium on Theory of Computing (STOC), pages 611-618. ACM, 2001.
2. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In Proc. 24th Symposium on Principles of Database Systems (PODS), pages 128-138. ACM, 2005.
3. E. Candes and B. Recht. Exact matrix completion via convex optimization. Foundations of Computional Mathematics, 9:717-772, December 2009.
4. E. J. Candès and T. Tao. The power of convex relaxation: near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5):2053-2080, 2010.
5. S. Chawla, C. Dwork, F. Mcsherry, A. Smith, and H. Wee. Toward privacy in public databases. In Proc. 2nd TCC, pages 363-385. Springer, 2005.
6. A. De. Lower bounds in difierential privacy. CoRR, abs/1107.2183, 2011.
7. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. 22nd PODS, pages 202-210. ACM, 2003.
8. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Proc. 3rd TCC, pages 265-284. Springer, 2006.
9. C. Dwork, G. N. Rothblum, and S. Vadhan. Boosting and difierential privacy. In Proc. 51st Foundations of Computer Science (FOCS). IEEE, 2010.
10. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. Journal of the ACM (JACM), 51:1025-1041, November 2004. (Pubitemid 40818314)
11. A. Gupta, K. Ligett, F. McSherry, A. Roth, and K. Talwar. Differentially private combinatorial optimization. In Proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, 2010.
12. A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. CoRR, abs/1107.3731, 2011.
13. N. Halko, P.-G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011.
14. M. Kapralov, F. McSherry, and K. Talwar. Personal communication. 2011.
15. R. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Transactions on Information Theory, 56(6):2980-2998, 2010.
16. J. Matousek. Lectures on Discrete Geometry. Springer-Verlag New York, Inc., 2002.
17. F. McSherry and I. Mironov. Differentially private recommender systems: building privacy into the net. In Proc. 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 627-636. ACM, 2009.
18. M. Mohri and A. Talwalkar. Can matrix coherence be efficiently and accurately estimated? In Proc. 14th Conference on Artificial Intelligence and Statistics (AISTATS), 2011.
19. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy (S&P), pages 111-125. IEEE, 2008.
20. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In Proc. 39th Symposium on Theory of Computing (STOC), pages 75-84. ACM, 2007.
21. C. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala. Latent semantic indexing: A probabilistic analysis. In Proc. 17th PODS, pages 159-168. ACM, 1998.
22. A. Talwalkar and A. Rostamizadeh. Matrix coherence and the nystrom method. In Proc. 26th Conference on Uncertainty in Artificial Intelligence (UAI), 2010.