BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UC Berkeley IEOR Department - Industrial Engineering & Operations Research - ECPv5.9.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UC Berkeley IEOR Department - Industrial Engineering & Operations Research
X-ORIGINAL-URL:https://ieor.berkeley.edu
X-WR-CALDESC:Events for UC Berkeley IEOR Department - Industrial Engineering & Operations Research
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190712T123000
DTEND;TZID=America/Los_Angeles:20190712T133000
DTSTAMP:20210922T012226
CREATED:20190702T193828Z
LAST-MODIFIED:20190702T193828Z
UID:14682-1562934600-1562938200@ieor.berkeley.edu
SUMMARY:Richard Y. Zhang — Scalable and Guaranteed Computation: Optimization and Machine Learning for the Future Electric Grid
DESCRIPTION:Abstract: Computation promises to greatly enhance the electric grid through optimization and machine learning. However\, many computational problems remain unsolved at the scale\, speed\, and quality necessary for the real world\, due to issues of complexity and nonconvexity. \nIn the first part of this talk\, we solve the optimization problem known as optimal power flow in guaranteed near-linear time and linear memory. Our key insight is use domain-specific techniques to exploit the graph theoretic notion of bounded treewidth. We give case studies on real-world electric grids with tens of thousands of vertices. We also extend our insights to solve other important graph-based optimization problems in transportation and medicine. \nIn the second part of this talk\, we make safety-critical guarantees for the learning problem known as power system state estimation. We draw a connection with the nonconvex low-rank matrix recovery problem in recommendation systems\, and prove that 1/2-restricted isometry is necessary and sufficient for guaranteed success in both classes of problems. We discuss implications for future work in the industrial applications of artificial intelligence. \n \nBio: Richard Y. Zhang is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign\, Urbana\, IL. His research interests are in computational mathematics and engineering\, particularly in the solution of large-scale\, nonconvex problems\, and with applications in electric power systems\, power electronics\, data science\, and machine learning. He received the B.E. (hons) degree with first class honors in Electrical Engineering from the University of Canterbury\, Christchurch\, New Zealand\, in 2009 and the S.M. and Ph.D. degrees in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology (MIT)\, Cambridge\, MA\, in 2012 and 2017 respectively. Previously\, he was a Postdoctoral Scholar in the Department of Industrial Engineering and Operations Research at the University of California\, Berkeley\, CA.
URL:https://ieor.berkeley.edu/event/richard-y-zhang-scalable-and-guaranteed-computation-optimization-and-machine-learning-for-the-future-electric-grid-2/
LOCATION:George B. Dantzig Auditorium – 1174 Etcheverry Hall\, Etcheverry Hall\, Berkeley\, CA\, 94720\, United States
ATTACH;FMTTYPE=image/jpeg:https://ieor.berkeley.edu/wp-content/uploads/2019/05/ryz-1.jpg
END:VEVENT
END:VCALENDAR