Model-based Bayesian RL
Description
Although Bayesian methods for Reinforcement Learning can be traced back to the 1960s (Howard's work in Operations Research), Bayesian methods have only been used sporadically in modern Reinforcement Learning. This is in part because non-Bayesian approaches tend to be much simpler to work with. However, recent advances have shown that Bayesian approaches do not need to be as complex as initially thought and offer several theoretical advantages. For instance, by keeping track of full distributions (instead of point estimates) over the unknowns, Bayesian approaches permit a more comprehensive quantification of the uncertainty regarding the transition probabilities, the rewards, the value function parameters and the policy parameters. Such distributional information can be used to optimize (in a principled way) the classic exploration/exploitation tradeoff, which can speed up the learning process. Similarly, active learning for reinforcement learning can be naturally optimized. The estimation of gradient performance with respect to value function or and/or policy parameters can also be done more accurately while using less data. Bayesian approaches also facilitate the encoding of prior knowledge and the explicit formulation of domain assumptions. The primary goal of this tutorial is to raise the awareness of the research community with regard to Bayesian methods, their properties and potential benefits for the advancement of Reinforcement Learning. An introduction to Bayesian learning will be given, followed by a historical account of Bayesian Reinforcement Learning and a description of existing Bayesian methods for Reinforcement Learning. The properties and benefits of Bayesian techniques for Reinforcement Learning will be discussed, analyzed and illustrated with case studies.
Categories
Top: Computer Science: Machine Learning: Reinforcement LearningTop: Computer Science: Machine Learning: Bayesian Learning
| Slides | |
| 0:00 | - History of Bayesian RL |
| 0:12 | Common Belief |
| 0:47 | A Bit of History - 1 |
| 1:18 | A Bit of History - 2 |
| 2:23 | Bayesian RL Work |
| 4:25 | Artificial Intelligence |
| 4:50 | - Model-Based Bayesian RL |
| 5:24 | Model-Based Bayesian RL |
| 8:07 | Model Learning |
| 9:44 | - Model-Based Bayesian RL - Prior Knowledge |
| 9:49 | Conjugate Prior |
| 11:38 | Dirichlet Distributions |
| 12:26 | Encoding Prior Knowledge |
| 16:08 | Structural Priors |
| 17:32 | - Model-Based Bayesian RL - Policy Optimization |
| 17:38 | POMDP Formulation |
| 19:02 | Transition Probabilities - 1 |
| 20:39 | Belief MDP Formulation |
| 21:59 | Transition Probabilities - 2 |
| 22:50 | Policy Optimization - 1 |
| 24:36 | Exploration/Exploitation Tradeoff |
| 26:53 | Policy Optimization - 2 |
| 27:51 | Myopic Value of Information |
| 29:34 | Thompson Sampling |
| 30:22 | Empirical Comparison |
| 31:40 | Bayesian Sparse Sampling |
| 32:39 | Policy Gradient |
| 33:15 | POMDP Discretization |
| 34:26 | Policy Optimization - 3 |
| 34:49 | iValue Function Parameterization |
| 36:47 | Partially Observable Domains |
| 37:10 | BEETLE Algorithm |
| 39:31 | Polynomials |
| 39:39 | BEETLE Algorithm |
| 39:48 | Polynomials |
| 40:40 | Projection Scheme |
| 41:56 | Basis Functions |
| 42:52 | BEETLE Properties |
| 44:15 | Empirical Evaluation - 1 |
| 44:20 | - Questions |
| 45:07 | Empirical Evaluation - 1 |
| 46:02 | Empirical Evaluation - 2 |
| 46:51 | Informative Priors |
| 47:33 | - Model-Based Bayesian RL - Discussion |
| 47:51 | Discussion |
| 47:59 | Misconceptions |
| 49:22 | Generalization Assumption |
| 49:37 | - Questions |
| 50:11 | Generalization Assumption |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





