{"374251":{"#nid":"374251","#data":{"type":"event","title":"ARC Colloquium\/ML Seminar series: Elad Hazan - Princeton University","body":[{"value":"\u003Cp align=\u0022center\u0022\u003E(Please note that the talk will be held in MiRC 102 A \u0026amp; B and the refreshments will be served at the talk)\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ETitle:\u0026nbsp;\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EProjection-free Optimization\u0026nbsp;and Online Learning\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EModern large data sets prohibit any super-linear time operations. This motivates the study of iterative optimization algorithms with low complexity per iteration. The computational bottleneck in applying state-of-the-art iterative methods is many times the so-called \u0022projection step\u0022.\u003Cbr \/\u003EWe consider projection-free optimization\/learning that replaces projections by more efficient linear optimization steps. We describe the first linearly-converging algorithm of this type for polyhedral sets and how it gives rise to optimal-rate stochastic optimization and online learning algorithms.\u003Cbr \/\u003E\u003Cbr \/\u003E\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Elad Hazan presents a talk as part of the ARC Colloquium series and co-sponsored by the Machine Learning Seminar Series"}],"uid":"27466","created_gmt":"2015-02-06 17:45:07","changed_gmt":"2017-04-13 21:20:08","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2015-03-25T15:00:00-04:00","event_time_end":"2015-03-25T16:00:00-04:00","event_time_end_last":"2015-03-25T16:00:00-04:00","gmt_time_start":"2015-03-25 19:00:00","gmt_time_end":"2015-03-25 20:00:00","gmt_time_end_last":"2015-03-25 20:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"9267","name":"ARC Colloquium"},{"id":"9167","name":"machine learning"}],"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\u003EDani Denton\u003C\/p\u003E\u003Cp\u003Edenton at cc dot gatech dot edu\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}