BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//The Robotics Institute Carnegie Mellon University - ECPv4.8.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:The Robotics Institute Carnegie Mellon University
X-ORIGINAL-URL:https://www.ri.cmu.edu
X-WR-CALDESC:Events for The Robotics Institute Carnegie Mellon University
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20190218T120000
DTEND;TZID=America/New_York:20190218T130000
DTSTAMP:20190616T043857
CREATED:20190212T154738Z
LAST-MODIFIED:20190213T192619Z
UID:111040-1550491200-1550494800@www.ri.cmu.edu
SUMMARY:Towards Generalization and Efficiency in Reinforcement Learning
DESCRIPTION:Abstract: In classic supervised machine learning\, a learning agent behaves as a passive observer: it receives examples from some external environment which it has no control over and then makes predictions. Reinforcement Learning (RL)\, on the other hand\, is fundamentally interactive : an autonomous agent must learn how to behave in an unknown and possibly hostile environment\, by actively interacting with the environment to collect useful feedback. One central challenge in RL is how to explore an unknown environment and collect useful feedback efficiently. In recent practical RL success stories\, we notice that most of them rely on random exploration which requires large a number of interactions with the environment before it can learn anything useful. The theoretical RL literature has developed more sophisticated algorithms for efficient learning\, however\, the sample complexity of these algorithms has to scale exponentially with respect to key parameters of underlying systems such as the dimensionality of state vector\, which prohibits a direct application of these theoretically elegant RL algorithms to large-scale applications. Without any further assumptions\, RL is hard\, both in practice and in theory. \nIn this work\, we improve generalization and efficiency on RL problems by introducing extra sources of help and additional assumptions. The first contribution of this work comes from improving RL sample efficiency via Imitation Learning (IL). Imitation Learning reduces policy improvement to classic supervised learning. We study in both theory and in practice how one can imitate experts to reduce sample complexity compared to RL approaches. The second contribution of this work comes from exploiting the underlying structures of the RL problems via model-based learning approaches. While there exist efficient model-based RL approaches specialized for specific RL problems (e.g.\, tabular MDPs\, Linear Quadratic Systems)\, we develop a unified model-based algorithm that generalizes a large number of RL problems that were often studied independently in the literature. We also revisit the long standing debate on whether model-based RL is more efficient than model-free RL from a theoretical perspective\, and demonstrate that model-based RL can be exponentially more sample efficient than model-free ones\, which to the best of our knowledge\, is the first that separates model-based and model-free general approaches. \n \nBio: Wen Sun is a PhD candidate in the Robotics Institute within the School of Computer Science at Carnegie Mellon University. He is generally interested in fundamental and applied research in machine learning and robotics\, with a focus on Reinforcement Learning and Imitation Learning. He is the recipient of the Best Student Paper Award at the Conference on Uncertainty in Artificial Intelligence (UAI)\, 2015. \n
URL:https://www.ri.cmu.edu/event/towards-generalization-and-efficiency-in-reinforcement-learning/
LOCATION:Gates Hillman Center 6115
CATEGORIES:Faculty Candidate,Faculty Events
ATTACH;FMTTYPE=image/png:https://www.ri.cmu.edu/wp-content/uploads/2019/02/Unknown.png
END:VEVENT
END:VCALENDAR