BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IFDS - ECPv6.0.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://ifds.info
X-WR-CALDESC:Events for IFDS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20210314T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20211107T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210519T123000
DTEND;TZID=America/Chicago:20210519T133000
DTSTAMP:20260409T145614
CREATED:20210202T202131Z
LAST-MODIFIED:20210517T133821Z
UID:1029-1621427400-1621431000@ifds.info
SUMMARY:SILO: Dimitris Tsipras
DESCRIPTION:Title: Robust Machine Learning: The Worst-Case and Beyond \nAbstract:\nOne of the key challenges in the real-world deployment of machine learning models is their brittleness: their performance significantly degrades when exposed to even small variations of their training environments. \nHow can we build ML models that are more robust? \nIn this talk\, I will present a methodology for training models that are invariant to a broad family of worst-case input perturbations. I will then describe how such robust learning leads to models that learn fundamentally different data representations\, and how this can be useful even outside the adversarial context. Finally\, I will discuss model robustness beyond the worst-case: ways in which our models fail to generalize and how we can guide further progress on this front.” \nBio:\n“Dimitris Tsipras is a PhD student in the MIT EECS Department\, advised by Aleksander Mądry. His work revolves around the reliability and robustness of machine learning systems\, as well as the science of modern machine learning. He is currently being supported by a Facebook PhD Fellowship \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-05192021/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210512T123000
DTEND;TZID=America/Chicago:20210512T133000
DTSTAMP:20260409T145614
CREATED:20210202T202020Z
LAST-MODIFIED:20210512T132548Z
UID:1027-1620822600-1620826200@ifds.info
SUMMARY:SILO: Rashmi Vinayak
DESCRIPTION:Title: Convertible Codes: Efficient Conversion of Coded Data in Large-scale Storage Systems \nAbstract:\nIn large-scale data storage systems\, failures are the norm in day-to-day operations. To protect data in the face of such failures\, erasure codes (a tool from coding theory) are employed to store data in a redundant fashion.  In this setting\, a set of k data blocks to be stored is encoded using an [n\, k] code to generate n blocks that are then stored on distinct storage devices. In a recent work\, we showed that the failure rate of storage devices vary considerably over time\, and that dynamically tuning the parameters n and k of the code provides significant reduction in storage cost. However\, traditional codes suffer from prohibitively high resource overheads in changing the code parameters on already encoded data. \nMotivated by this application\, in this talk\, we:\n1. Present a new theoretical framework to formalize the notion of “code conversion”—the process of converting data encoded using an [n\, k] code into data encoded using a code with different parameters [n’\, k’]\, while maintaining desired decodability properties\,\n2. Introduce “convertible codes”\, a new class of codes that enable resource-efficient conversion\,\n3. Prove tight bounds on two important metrics for code conversion (a) the number of nodes accessed\, and (b) bandwidth consumed\,\n4. Present practical constructions of convertible codes for a broad range of parameters. \nBio:\nRashmi Vinayak is an assistant professor in the Computer Science department at Carnegie Mellon University. Her research interests broadly lie in computer/networked systems and information/coding theory\, and the wide spectrum of intersection between the two areas. Her current focus is on fault tolerance and resource efficiency in data systems. Rashmi is a recipient of NSF CAREER Award\, Tata Institute of Fundamental Research Memorial Lecture Award 2020\, Facebook Distributed Systems Research Award 2019\, Google Faculty Research Award 2018\, Facebook Communications and Networking Research Award 2017\, UC Berkeley Eli Jury Award 2016 for “outstanding achievement in the area of systems\, communications\, control\, or signal processing”. Her work has received USENIX NSDI 2021 Community (Best Paper) Award\, and IEEE Data Storage Best Paper and Best Student Paper Awards for the years 2011/2012. Rashmi received her Ph.D. from UC Berkeley in 2016\, and was a postdoctoral scholar at UC Berkeley’s AMPLab/RISELab from 2016-17. During her Ph.D. studies\, Rashmi was a recipient of Facebook Fellowship 2012-13\, the Microsoft Research PhD Fellowship 2013-15\, and the Google Anita Borg Memorial Scholarship 2015-16.\nWebpage: http://www.cs.cmu.edu/~rvinayak/ \n  \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-05122021/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210505T123000
DTEND;TZID=America/Chicago:20210505T133000
DTSTAMP:20260409T145614
CREATED:20210202T193340Z
LAST-MODIFIED:20210219T193043Z
UID:1002-1620217800-1620221400@ifds.info
SUMMARY:SILO: Yuanzhi Li
DESCRIPTION:
URL:https://ifds.info/event/silo-05052021/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210428T123000
DTEND;TZID=America/Chicago:20210428T133000
DTSTAMP:20260409T145614
CREATED:20210202T201908Z
LAST-MODIFIED:20210202T201908Z
UID:1025-1619613000-1619616600@ifds.info
SUMMARY:SILO: Martin Wainwright
DESCRIPTION:Title: TBD \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-martin-wainwright/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210421T123000
DTEND;TZID=America/Chicago:20210421T133000
DTSTAMP:20260409T145614
CREATED:20210202T201514Z
LAST-MODIFIED:20210219T192936Z
UID:1021-1619008200-1619011800@ifds.info
SUMMARY:SILO: Emmanuel Abbe
DESCRIPTION:Title: TBD \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-04212021/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210414T123000
DTEND;TZID=America/Chicago:20210414T133000
DTSTAMP:20260409T145614
CREATED:20210202T201325Z
LAST-MODIFIED:20210412T181842Z
UID:1019-1618403400-1618407000@ifds.info
SUMMARY:SILO: Merve Bodur
DESCRIPTION:Title: Copositive Duality for Discrete Markets and Games \nModels including binary decisions are often modelled as mixed-integer programs (MIPs). Such models are nonconvex and lack strong duality\, which prevents the use of tools such as shadow prices and KKT conditions. For example\, in convex markets\, shadow (dual) prices are associated with market equilibrium\, and for convex games the existence and uniqueness of Nash equilibrium can be proven via fixed-point theorem and KKT conditions. Those results are lacking in their nonconvex counterparts. We use copositive programming to formulate discrete problems in applications including nonconvex energy markets and nonconvex games\, to leverage its convexity and strong duality features. We obtain several novel theoretical and numerical results for those applications\, including a new revenue-adequate pricing scheme for energy markets\, and existence\, uniqueness\, and KKT conditions for the pure-strategy Nash equilibrium in discrete games. We also propose a novel and purely MIP-based cutting-plane algorithm for mixed-integer copositive programs\, and employ it in our applications. This is a joint work with Cheng Guo and Josh A. Taylor. \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-rashmi-vimayak/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210407T123000
DTEND;TZID=America/Chicago:20210407T133000
DTSTAMP:20260409T145614
CREATED:20210202T193325Z
LAST-MODIFIED:20210412T181944Z
UID:998-1617798600-1617802200@ifds.info
SUMMARY:SILO: Rebecca Willett
DESCRIPTION:
URL:https://ifds.info/event/silo-anna-choromanska/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210331T123000
DTEND;TZID=America/Chicago:20210331T133000
DTSTAMP:20260409T145614
CREATED:20210202T201200Z
LAST-MODIFIED:20210219T193005Z
UID:1017-1617193800-1617197400@ifds.info
SUMMARY:SILO: Jean Honorio
DESCRIPTION:Title: TBD \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-03312021/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210324T080000
DTEND;TZID=America/Chicago:20210324T170000
DTSTAMP:20260409T145614
CREATED:20210202T201035Z
LAST-MODIFIED:20210202T201035Z
UID:1015-1616572800-1616605200@ifds.info
SUMMARY:SILO: Alon Orlitsky
DESCRIPTION:Title: TBD \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-alon-orlitsky/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210317T123000
DTEND;TZID=America/Chicago:20210317T133000
DTSTAMP:20260409T145614
CREATED:20210202T200937Z
LAST-MODIFIED:20210316T152530Z
UID:1013-1615984200-1615987800@ifds.info
SUMMARY:SILO: Sebastien Bubeck
DESCRIPTION:Title:  A law of robustness for two-layers neural networks \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-sebastien-bubeck/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210310T130000
DTEND;TZID=America/Chicago:20210310T133000
DTSTAMP:20260409T145614
CREATED:20210202T200752Z
LAST-MODIFIED:20210202T200808Z
UID:1010-1615381200-1615383000@ifds.info
SUMMARY:SILO: Yuanzhi Li
DESCRIPTION:Title: TBD \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-yuanzhi-li/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210310T123000
DTEND;TZID=America/Chicago:20210310T133000
DTSTAMP:20260409T145614
CREATED:20210202T195033Z
LAST-MODIFIED:20210308T174906Z
UID:1008-1615379400-1615383000@ifds.info
SUMMARY:SILO: Zhao Song
DESCRIPTION:Title: Faster Optimization: From linear programming to semidefinite programming \nAbstract: Many important real-life problems\, in both convex and non-convex settings\, can be solved using path-following optimization methods. The running time of optimization algorithms is typically governed by two components — the number of iterations and the cost-per-iteration. For decades\, the vast majority of research effort was dedicated to improving the number of iterations required for convergence. A recent line of work of ours shows that the cost-per-iteration can be dramatically improved using a careful combination of dynamic data structures with `robust’ variants of the optimization method. A central ingredient is the use of randomized linear algebra for dimensionality reduction (e.g.\,  linear sketching) for fast maintenance of dynamic matrix problems. This framework recently led to many breakthroughs on decade-old optimization problems. \nIn this talk\, I will present the framework underlying these breakthroughs\, focusing on faster algorithms for linear programming and semidefinite programming. We will first present how to use the above idea to speed up general LP solvers by providing an n^omega + n^{2+1/18} time algorithm. We then show how to apply similar ideas to SDP solvers by providing an n^omega + n^{2+1/4} time algorithm. For the current omega = 2.373\, we can solve LP and SDP as fast as solving linear systems. \nThis is a joint work with\nBaihe Huang (undergraduate at Peking University)\,\nShunhua Jiang\, Runzhou Tao\, Hengjie Zhang (Ph.D. at Columbia University)\,\nOmri Weinstein (Professor at Columbia University) \nLP paper    : https://arxiv.org/abs/2004.07470\nSDP paper : https://arxiv.org/abs/2101.08208 \n  \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/silo-zhao-song/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210303T123000
DTEND;TZID=America/Chicago:20210303T133000
DTSTAMP:20260409T145614
CREATED:20210202T193324Z
LAST-MODIFIED:20210202T193741Z
UID:992-1614774600-1614778200@ifds.info
SUMMARY:SILO: Tuo Zhao
DESCRIPTION:
URL:https://ifds.info/event/silo-tuo-zhao/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210224T123000
DTEND;TZID=America/Chicago:20210224T133000
DTSTAMP:20260409T145614
CREATED:20210202T190745Z
LAST-MODIFIED:20210202T190811Z
UID:959-1614169800-1614173400@ifds.info
SUMMARY:SILO: Jose Blanchet
DESCRIPTION:Title: TBD
URL:https://ifds.info/event/silo-jose-blanchet/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210217T123000
DTEND;TZID=America/Chicago:20210217T133000
DTSTAMP:20260409T145614
CREATED:20210202T162926Z
LAST-MODIFIED:20210202T190606Z
UID:932-1613565000-1613568600@ifds.info
SUMMARY:SILO: Tara Javidi
DESCRIPTION:Generalization to Natural Out-of-Distribution Inputs \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/generalization-to-natural-out-of-distribution-inputs/
CATEGORIES:SILO
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210210T123000
DTEND;TZID=America/Chicago:20210210T133000
DTSTAMP:20260409T145614
CREATED:20210202T162926Z
LAST-MODIFIED:20210202T190411Z
UID:931-1612960200-1612963800@ifds.info
SUMMARY:SILO: Hamed Hasani
DESCRIPTION:Two Facets of Learning Robust Models: Fundamental Limits and \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/two-facets-of-learning-robust-models-fundamental-limits-and/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20210203T123000
DTEND;TZID=America/Chicago:20210203T133000
DTSTAMP:20260409T145614
CREATED:20210202T162925Z
LAST-MODIFIED:20210202T185248Z
UID:930-1612355400-1612359000@ifds.info
SUMMARY:SILO: Yao Xie
DESCRIPTION:Statistical inference on spatio-temporal networks \nUNTIL FURTHER NOTICE: Seminars are virtual. Sign up for the SILO email list to receive the links to each talk at https://groups.google.com/ and browse for silo
URL:https://ifds.info/event/statistical-inference-on-spatio-temporal-networks/
CATEGORIES:SILO
ORGANIZER;CN="Rob%20Nowak":MAILTO:rdnowak@wisc.edu
END:VEVENT
END:VCALENDAR