Variational Model-based Policy Optimization
Yinlam Chow, Brandon Cui, MoonKyung Ryu, Mohammad Ghavamzadeh

TL;DR
This paper introduces VMBPO, a variational model-based policy optimization method that combines model learning and policy improvement using a unified objective, leading to more sample-efficient and robust reinforcement learning algorithms.
Contribution
It formulates a joint model and policy learning framework via a variational lower-bound, enabling iterative EM-based optimization in model-based RL.
Findings
VMBPO outperforms model-free methods in sample efficiency.
VMBPO demonstrates robustness to hyper-parameter tuning.
VMBPO achieves competitive performance with state-of-the-art algorithms.
Abstract
Model-based reinforcement learning (RL) algorithms allow us to combine model-generated data with those collected from interaction with the real system in order to alleviate the data efficiency problem in RL. However, designing such algorithms is often challenging because the bias in simulated data may overshadow the ease of data generation. A potential solution to this challenge is to jointly learn and improve model and policy using a universal objective function. In this paper, we leverage the connection between RL and probabilistic inference, and formulate such an objective function as a variational lower-bound of a log-likelihood. This allows us to use expectation maximization (EM) and iteratively fix a baseline policy and learn a variational distribution, consisting of a model and a policy (E-step), followed by improving the baseline policy given the learned variational distribution…
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.
