If you have a question about this talk, please contact Elre Oldewage.
Meta learning allows for generalisation across tasks and has become
increasingly relevant as machine learning systems are asked to solve
heterogeneous problems efficiently with less training data. In recent
years, meta learning has been applied in the context of reinforcement
learning to build agents that learn to generalise across a distribution
of Markov decision problems. In this reading group, we will briefly
introduce the basics of meta reinforcement learning, cover different
approaches to the problem, and discuss their uses and limitations. We
will also consider how they compare to more traditional algorithms, both
learned and hand-crafted.