{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:54:02Z","timestamp":1775912042975,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591883","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":103,"title":["Analyze gauss"],"prefix":"10.1145","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Abhradeep","family":"Thakurta","sequence":"additional","affiliation":[{"name":"Stanford University, Microsoft Research"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.598228"},{"key":"e_1_3_2_2_3_1","first-page":"1","article-title":"Decomposable searching problems i: Static-to-dynamic trnasformation","author":"Bentley J. L.","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe . Decomposable searching problems i: Static-to-dynamic trnasformation . J. Algorithms , 1 , 1980 . J. L. Bentley and J. B. Saxe. Decomposable searching problems i: Static-to-dynamic trnasformation. J. Algorithms, 1, 1980.","journal-title":"J. Algorithms"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705568"},{"key":"e_1_3_2_2_6_1","volume-title":"These Proceedings.","author":"Bun Mark","unstructured":"Mark Bun , Jonathan Ullman , and Salil Vadhan . Fingerprinting codes and the price of approximate differential privacy . In These Proceedings. Mark Bun, Jonathan Ullman, and Salil Vadhan. Fingerprinting codes and the price of approximate differential privacy. In These Proceedings."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_3_2_2_9_1","volume-title":"NIPS","author":"Chaudhuri Kamalika","year":"2012","unstructured":"Kamalika Chaudhuri , Anand D. Sarwate , and Kaushik Sinha. Near-optimal differentially private principal components . In NIPS , 2012 . Kamalika Chaudhuri, Anand D. Sarwate, and Kaushik Sinha. Near-optimal differentially private principal components. In NIPS, 2012."},{"key":"e_1_3_2_2_10_1","series-title":"SIAM Journal on Numerical Analysis","volume-title":"The rotation of eigenvectors by a perturbation. III","author":"Davis Chandler","year":"1970","unstructured":"Chandler Davis and William Morton Kahan . The rotation of eigenvectors by a perturbation. III . SIAM Journal on Numerical Analysis , 1970 . Chandler Davis and William Morton Kahan. The rotation of eigenvectors by a perturbation. III. SIAM Journal on Numerical Analysis, 1970."},{"key":"e_1_3_2_2_11_1","volume-title":"Algorithmic foundations of differential privacy","author":"Dwork C.","year":"2014","unstructured":"C. Dwork and A. Roth . Algorithmic foundations of differential privacy , 2014 . Monograph in preparation. C. Dwork and A. Roth. Algorithmic foundations of differential privacy, 2014. Monograph in preparation."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214088"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488650"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxp097"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627918"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1023104"},{"key":"e_1_3_2_2_25_1","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Mohri Mehryar","year":"2011","unstructured":"Mehryar Mohri and Ameet Talwalkar . Can matrix coherence be efficiently and accurately estimated ? In International Conference on Artificial Intelligence and Statistics , 2011 . Mehryar Mohri and Ameet Talwalkar. Can matrix coherence be efficiently and accurately estimated? In International Conference on Artificial Intelligence and Statistics, 2011."},{"key":"e_1_3_2_2_26_1","volume-title":"The Journal of Machine Learning Research","author":"Recht Benjamin","year":"2011","unstructured":"Benjamin Recht . A simpler approach to matrix completion . The Journal of Machine Learning Research , 2011 . Benjamin Recht. A simpler approach to matrix completion. The Journal of Machine Learning Research, 2011."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_2_28_1","volume-title":"Personal Communication","author":"Smith Adam","year":"2013","unstructured":"Adam Smith and Abhradeep Thakurta . Personal Communication , 2013 . Adam Smith and Abhradeep Thakurta. Personal Communication, 2013."},{"key":"e_1_3_2_2_29_1","volume-title":"Matrix coherence and the Nystrom method. arXiv preprint arXiv:1004.2008","author":"Talwalkar Ameet","year":"2010","unstructured":"Ameet Talwalkar and Afshin Rostamizadeh . Matrix coherence and the Nystrom method. arXiv preprint arXiv:1004.2008 , 2010 . Ameet Talwalkar and Afshin Rostamizadeh. Matrix coherence and the Nystrom method. arXiv preprint arXiv:1004.2008, 2010."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/132"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346335"},{"key":"e_1_3_2_2_32_1","volume-title":"Journal of Machine Learning Research","author":"Warmuth Manfred K","year":"2008","unstructured":"Manfred K Warmuth and Dima Kuzmin . Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension . Journal of Machine Learning Research , 2008 . Manfred K Warmuth and Dima Kuzmin. Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension. Journal of Machine Learning Research, 2008."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591883"}},"subtitle":["optimal bounds for privacy-preserving principal component analysis"],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":33,"alternative-id":["10.1145\/2591796.2591883","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591883","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}