University of Cambridge > Talks.cam > Machine Learning @ CUED > General Reinforcement Learning

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

General Reinforcement Learning

Download to your calendar using vCal

If you have a question about this talk, please contact Adrian Weller .

Reinforcement learning problems are often phrased in terms of Markov decision processes (MDPs). In this talk, we go beyond MDPs and consider reinforcement learning in environments that are non-Markovian, non-ergodic and only partially observable. Our focus will not be on practical algorithms, but rather on the fundamental underlying problems. How do we balance exploration and exploitation? How do we explore optimally? When is an agent optimal? We introduce the Bayesian agent AIXI , point out some of its problems, and discuss potential solutions.

Speaker: Jan Leike is a PhD student at the Australian National University working with Marcus Hutter.

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Computer Laboratory, William Gates Building, Room SW00 https://zoom.us/j/96842517234 Webinar & FW11, Computer Laboratory, William Gates Building.

Other talks

Group Work Title to be confirmed In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Teams Announced Title to be confirmed The search for a new population of strong gravitational lenses with JWST
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity