University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Bayesian 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

Bayesian Reinforcement Learning

Download to your calendar using vCal

If you have a question about this talk, please contact Colorado Reed .

Reinforcement learning (RL) is the problem of learning optimal behaviour in an initially unfamiliar Markov Decision Process (MDP) environment through interaction and evaluative feedback. Until recently, existing RL algorithms have relied on non-optimal exploration strategies to strike a balance between ‘exploiting’ current knowledge of the MDP to maximise expected returns, and ‘exploration’ actions which gain information on the MDP , to improve the return on exploitation actions in the future. Bayesian Reinforcement learning (BRL) is about capturing and dealing with uncertainty in MDP elements, where ‘classic RL’ does not. We focus on modelling uncertainty in an agent’s transition probabilities, often termed ‘model-based’ BRL . By planning in a belief space of transition probabilities, BRL implicitly resolves the classic RL ‘exploitation & exploration’ dilemma optimally. Computation is shown to be intractable in general, although approximations exist of which several key algorithms are presented.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy Room TBA, Homerton College Lockheed Martin UK, Ampthill, Bedfordshire MK45 2HD

Other talks

Talk title TBC Title to be confirmed Am I a Member? Auditing Private Machine Learning Morning Break What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients Title to be confirmed
 

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