![\"\"](\"\/cise\/files\/2017\/10\/Suresh.png\")
<\/p>\nFriday, October 13,\u00a02017, 3pm-4pm
\n8 St. Mary’s Street,\u00a0PHO 211
\nRefreshments at 2:45pm<\/p>\n
<\/p>\n
<\/p>\n
<\/p>\n
Motivated by the need for distributed learning and optimization algorithms with low communication cost and privacy guarantees, we study communication efficient and differentially-private algorithms for distributed mean estimation. Unlike previous works, we make no probabilistic assumptions on the data. We propose three quantization schemes one of which is optimal up to a constant in the minimax sense i.e., it achieves the best mean square error for a given communication cost.\u00a0 Furthermore, we show that a modified version of the quantization schemes achieves differential privacy in addition to communication efficiency. We finally demonstrate the practicality of our algorithms by applying them to distributed gradient descent for neural networks, Lloyd’s algorithm for k-means, and power iteration for PCA.<\/p>\n
Ananda Theertha Suresh<\/strong> received the B.Tech. degree from IIT Madras in 2006, and M.S. and Ph.D. degrees from University of California at San Diego in 2012 and 2016, respectively. He is currently a Research Scientist at Google, New York. His research interests lie in the intersection of statistics, machine learning, and information theory.\u00a0 He is a recipient of the 2015 Neural Information Processing Systems (NIPS) Best Paper Award, 2016 UCSD ECE Department Best Thesis Award, 2017 International Conference on Machine Learning (ICML) Best Paper Honorable Mention, and 2017 Marconi Society Paul Baran Young Scholar Award.<\/p>\n Faculty Host: Venkatesh Saligrama Friday, October 13,\u00a02017, 3pm-4pm 8 St. Mary’s Street,\u00a0PHO 211 Refreshments at 2:45pm Ananda Theertha Suresh Google Communication-Efficient and Differentially-Private Distributed Learning Motivated by the need for distributed learning and optimization algorithms with low communication cost and privacy guarantees, we study communication efficient and differentially-private algorithms for distributed mean estimation. Unlike previous works, we […]<\/p>\n","protected":false},"author":15670,"featured_media":0,"parent":29986,"menu_order":32,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/30041"}],"collection":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/users\/15670"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/comments?post=30041"}],"version-history":[{"count":2,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/30041\/revisions"}],"predecessor-version":[{"id":30043,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/30041\/revisions\/30043"}],"up":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/pages\/29986"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/media?parent=30041"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nStudent Host:\u00a0Sean Sanchez<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"