{"386111":{"#nid":"386111","#data":{"type":"event","title":"ARC Colloquium: Anup Rao - Yale University","body":[{"value":"\u003Cp\u003E(Refreshments will be served in Klaus 2222 at 2 pm)\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ETitle:\u003C\/strong\u003E \u003Cbr \/\u003EAlgorithms for Lipschitz Learning on Graphs\u003Cbr \/\u003E\u003Cbr \/\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E \u003Cbr \/\u003EWe develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large p of p-Laplacian regularization. We present an algorithm that computes a minimal Lipschitz extension in expected linear time, and an algorithm that computes an absolutely minimal Lipschitz extension in expected time O(mn). The latter algorithm has variants that seem to run much faster in practice. These extensions are particularly amenable to regularization: we can perform l_0 regularization on the given values in polynomial time and l_1 regularization on the graph edge weights in time O(m^(3\/2)). Our algorithms naturally extend to directed graphs.\u0026nbsp; This is a joint work with Rasmus Kyng, Sushant Sachdeva and Daniel Spielman.\u003Cbr \/\u003E\u003Cbr \/\u003E\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Anup Rao presents a talk as part of the ARC Colloquium series."}],"uid":"27466","created_gmt":"2015-03-09 16:57:38","changed_gmt":"2017-04-13 21:19:47","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2015-03-30T14:00:00-04:00","event_time_end":"2015-03-30T15:00:00-04:00","event_time_end_last":"2015-03-30T15:00:00-04:00","gmt_time_start":"2015-03-30 18:00:00","gmt_time_end":"2015-03-30 19:00:00","gmt_time_end_last":"2015-03-30 19:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"related_links":[{"url":"http:\/\/www.arc.gatech.edu\/","title":"Algorithms \u0026 Randomness Center (ARC)"},{"url":"https:\/\/www.google.com\/maps\/place\/Klaus+Advanced+Computing+Building\/@33.777252,-84.396185,17z\/data=!3m1!4b1!4m2!3m1!1s0x87b781ec0ab42ea5:0x16eec927f37b40ec","title":"GA Tech, Klaus Building, Room 1116 West"}],"groups":[{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"},{"id":"70263","name":"ARC"}],"categories":[],"keywords":[{"id":"112751","name":"(ARC)"},{"id":"114981","name":"Adaptive Data Analysis"},{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"}],"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":""}}}