{"377751":{"#nid":"377751","#data":{"type":"event","title":"SCS Faculty Recruiting Seminar - Alexandr Andoni - Algorithmic Design via Efficient Data Representations","body":[{"value":"\u003Cp class=\u0022p1\u0022\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003E\u003Cstrong\u003ESchool of Computer Science\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003E\u003Cstrong\u003EFaculty Recruiting Seminar\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p3\u0022\u003E\u003Cstrong\u003E\u0026nbsp;\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p2\u0022\u003E\u003Cstrong\u003EAlexandr Andoni\u003C\/strong\u003E\u003Cstrong\u003E, \u003C\/strong\u003E\u003Cstrong\u003EPhD\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p4\u0022\u003E\u003Cstrong\u003EVisiting Scientist \u003Cbr \/\u003E University of California, Berkeley\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p5\u0022\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p6\u0022\u003E\u003Cstrong\u003EThursday, February 19, 2015 @ 11 A.M.\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p7\u0022\u003ESchool of Computer Science\u003C\/p\u003E\u003Cp class=\u0022p7\u0022\u003EKlaus Classroom 2447\u003C\/p\u003E\u003Cp class=\u0022p7\u0022\u003E266 Ferst Dr\u003C\/p\u003E\u003Cp class=\u0022p7\u0022\u003EAtlanta GA 30332\u003C\/p\u003E\u003Cp class=\u0022p8\u0022\u003E(Light refreshments provided)\u003C\/p\u003E\u003Cp class=\u0022p9\u0022\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp class=\u0022p10\u0022\u003E\u003Cstrong\u003EAlgorithmic Design via Efficient Data Representations\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p11\u0022\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u0026nbsp; The growing scale of data demands novel algorithmic design frameworks that are able to handle modern datasets. In this talk, I will describe how such frameworks emerge from the methods of efficient data representations. The first illustration will be the Nearest Neighbor Search (NNS) problem --- an ubiquitous massive datasets problem that is of key importance in machine learning and other areas. Its goal is to preprocess a dataset of objects (e.g., images), so that later, given a new query object, one can efficiently return the object most similar to the query. Efficient solutions may be achieved via Locality Sensitive Hashing (LSH), a data representation method that has seen a lot of success in both theory and practice. I will present the best possible LSH-based algorithm for NNS under the Euclidean distance. Then, I will show a new method that, for the first time, provably outperforms the LSH-based algorithms. Taking a broader perspective, I will describe other examples where the lens of \u0022efficient data representation\u0022 leads to new efficient algorithms. These examples include fast algorithms for estimating the edit distance and the Earth-Mover Distance, as well as a new algorithmic framework for parallel models of computation (such as MapReduce).\u003C\/p\u003E\u003Cp class=\u0022p3\u0022\u003E\u003Cstrong\u003E\u0026nbsp;\u003C\/strong\u003E\u003C\/p\u003E\u003Cp class=\u0022p11\u0022\u003E\u003Cstrong\u003EBio:\u003C\/strong\u003E\u003Cstrong\u003E\u0026nbsp;\u003C\/strong\u003EAlexandr Andoni is a computer scientist focused on advancing algorithmic foundations of massive data. His research interests broadly revolve around sublinear algorithms, high-dimensional geometry, and theoretical machine learning. Alexandr graduated from MIT in 2009, with a PhD thesis on Nearest Neighbor Search, under the supervision of Piotr Indyk. During 2009--2010, he was a postdoc at the Center for Computational Intractability at Princeton, as well as a visitor at NYU and IAS. Alexandr then joined Microsoft Research Silicon Valley, where he was a researcher until 2014. Currently, Alexandr is a visiting scientist at the Simons Institute for the Theory of Computing at UC Berkeley.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"SCS Faculty Recruiting Seminar - Alexandr Andoni - Algorithmic Design via Efficient Data Representations"}],"uid":"28150","created_gmt":"2015-02-12 10:53:51","changed_gmt":"2017-04-13 21:20:05","author":"Birney Robert","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2015-02-19T10:00:00-05:00","event_time_end":"2015-02-19T11:00:00-05:00","event_time_end_last":"2015-02-19T11:00:00-05:00","gmt_time_start":"2015-02-19 15:00:00","gmt_time_end":"2015-02-19 16:00:00","gmt_time_end_last":"2015-02-19 16:00:00","rrule":null,"timezone":"America\/New_York"},"extras":["free_food"],"hg_media":{"377741":{"id":"377741","type":"image","title":"Alexandr Andoni","body":null,"created":"1449246205","gmt_created":"2015-12-04 16:23:25","changed":"1475894342","gmt_changed":"2016-10-08 02:39:02","alt":"Alexandr Andoni","file":{"fid":"75194","name":"bru14.jpg","image_path":"\/sites\/default\/files\/images\/bru14.jpg","image_full_path":"http:\/\/tlwarc.hg.gatech.edu\/\/sites\/default\/files\/images\/bru14.jpg","mime":"image\/jpeg","size":36151,"path_740":"http:\/\/tlwarc.hg.gatech.edu\/sites\/default\/files\/styles\/740xx_scale\/public\/images\/bru14.jpg?itok=BzbYLd5E"}}},"media_ids":["377741"],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"118631","name":"Alexandr Andoni"},{"id":"654","name":"College of Computing"},{"id":"166941","name":"School of Computer Science"},{"id":"166940","name":"SCS"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78751","name":"Undergraduate students"},{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EEssie Reynolds\u003C\/p\u003E\u003Cp\u003E\u003Ca href=\u0022mailto:ereynold@cc.gatech.edu\u0022\u003Eereynold@cc.gatech.edu\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}