Learning Domain Invariant Representations in Goal-conditioned Block MDPs
Abstract
Deep Reinforcement Learning (RL) is successful in solving many complex Markov Decision Processes (MDPs) problems. However, agents often face unanticipated environmental changes after deployment in the real world. These changes are often spurious and unrelated to the underlying problem, such as background shifts for visual input agents. Unfortunately, deep RL policies are usually sensitive to these changes and fail to act robustly against them. This resembles the problem of domain generalization in supervised learning. In this work, we study this problem for goal-conditioned RL agents. We propose a theoretical framework in the Block MDP setting that characterizes the generalizability of goal-conditioned policies to new environments. Under this framework, we develop a practical method PA-SkewFit that enhances domain generalization. The empirical evaluation shows that our goal-conditioned RL agent can perform well in various unseen test environments, improving by 50% over baselines.
Cite
@article{arxiv.2110.14248,
title = {Learning Domain Invariant Representations in Goal-conditioned Block MDPs},
author = {Beining Han and Chongyi Zheng and Harris Chan and Keiran Paster and Michael R. Zhang and Jimmy Ba},
journal= {arXiv preprint arXiv:2110.14248},
year = {2021}
}
Comments
33 pages