The online convex optimization approach to control
This event is free and open to the publicAdd to Google Calendar
Abstract: In this talk we will discuss an emerging paradigm in differentiable reinforcement learning called “online nonstochastic control”. The new approach applies techniques from online convex optimization and convex relaxations to obtain new methods with provable guarantees for classical settings in optimal and robust control. Time permitting we will discuss recent extensions to nonlinear adaptive control and planning.
Bio: Elad Hazan is a professor of computer science at Princeton University. His research focuses on the design and analysis of algorithms for basic problems in machine learning and optimization. Amongst his contributions are the co-invention of the AdaGrad algorithm for deep learning, and the first sublinear-time algorithms for convex optimization. He is the recipient of the Bell Labs prize, the IBM Goldberg best paper award twice, in 2012 and 2008, a European Research Council grant, a Marie Curie fellowship, twice the Google Research Award, and ACM fellowship. He served on the steering committee of the Association for Computational Learning and has been program chair for COLT 2015. In 2017 he co-founded In8 inc. focusing on efficient optimization and control, acquired by Google in 2018. He is the co-founder and director of Google AI Princeton.
***Event will take place in hybrid format. The location for in-person attendance will be room 1311 EECS. Attendance will also be possible via Zoom. Zoom link and password will be distributed to the Controls Group e-mail list-serv.
To join this list-serv, please send an (empty) email message to email@example.com with the word “subscribe” in the subject line. To cancel your subscription, send an (empty) email to the same address with the word “unsubscribe” in the subject line. Zoom information is also available upon request to Michele Feldkamp (firstname.lastname@example.org).
This seminar will be recorded and posted to the Control Seminar webpage.