University of Cambridge > Talks.cam > Machine Learning Journal Club > Optimal Bayesian Reinforcement Learning on Trees

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Optimal Bayesian Reinforcement Learning on Trees

Download to your calendar using vCal

If you have a question about this talk, please contact Philipp Hennig .

The “Q-Learning” algorithm is the classical solution to the so-called “Optimal” Reinforcement Learning Problem. Q-Learning uses samples of future rewards generated by a non-optimal policy to derive point estimates of the future rewards from the (unknown) optimal policy.

In the first part of this talk, I will show that a Bayesian treatment, in forcing us to explicitly define our assumptions, reveals some interesting aspects of this problem that seem to have been overlooked so far.

In the second part, I will introduce an algorithm that uses Expectation Propagation to generate beliefs over possible future rewards from the optimal policy if the Markov Environment forms a tree (i.e. “Bayesian Q-Learning on trees”) and will show some preliminary results for its application to Game Trees.

This talk is part of the Machine Learning Journal Club series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

LMH, Lady Mitchell Hall Meeting Room, Clare Hall https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Tea and Coffee Break The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Title to be confirmed title abstract tbc Christmas Social Evening & Annual General Meeting Peri-Operative Medicine, and Obstetrics and Gynaecology
 

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