Learning Domain Invariant Representations in Goal-conditioned Block MDPsDownload PDF

21 May 2021, 20:50 (modified: 25 Jan 2022, 14:50)NeurIPS 2021 PosterReaders: Everyone
Keywords: goal-conditioned reinforcement learning, learning invariants, representation learning, domain generalization, block mdp, deep reinforcement learning
TL;DR: We propose a new method for learning domain invariant policies for Goal-conditioned RL agents.
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.
Supplementary Material: pdf
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
Code: https://github.com/YeeCY/PASF
17 Replies