Importance Weighted Policy Learning and Adaptation
Alexandre Galashov, Jakub Sygnowski, Guillaume Desjardins, Jan, Humplik, Leonard Hasenclever, Rae Jeong, Yee Whye Teh, Nicolas Heess

TL;DR
This paper introduces an importance weighted policy learning framework that leverages prior experience and probabilistic inference to enable rapid adaptation in reinforcement learning, demonstrating competitive results in complex tasks.
Contribution
It presents a novel, modular approach combining off-policy learning, behavior priors, and value function representation for improved meta reinforcement learning.
Findings
Achieves competitive adaptation performance on hold-out tasks
Scales effectively to complex sparse-reward scenarios
Utilizes probabilistic inference for robust off-policy learning
Abstract
The ability to exploit prior experience to solve novel problems rapidly is a hallmark of biological learning systems and of great practical importance for artificial ones. In the meta reinforcement learning literature much recent work has focused on the problem of optimizing the learning process itself. In this paper we study a complementary approach which is conceptually simple, general, modular and built on top of recent improvements in off-policy learning. The framework is inspired by ideas from the probabilistic inference literature and combines robust off-policy learning with a behavior prior, or default behavior that constrains the space of solutions and serves as a bias for exploration; as well as a representation for the value function, both of which are easily learned from a number of training tasks in a multi-task scenario. Our approach achieves competitive adaptation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Domain Adaptation and Few-Shot Learning · Advanced Bandit Algorithms Research
