Zero-shot Policy Learning with Spatial Temporal RewardDecomposition on Contingency-aware Observation
Huazhe Xu, Boyuan Chen, Yang Gao, Trevor Darrell

TL;DR
This paper introduces a zero-shot policy learning method that decomposes sparse rewards into contingency-aware observations, enabling generalization to unseen environments without additional training.
Contribution
The proposed approach decomposes sparse rewards into finer-grained, contingency-aware observations and uses these to enable zero-shot generalization via MPC in new environments.
Findings
Outperforms behavior cloning and state-of-the-art RL on benchmark tasks
Effective in both video game and robotic control environments
Demonstrates strong zero-shot transfer capabilities
Abstract
It is a long-standing challenge to enable an intelligent agent to learn in one environment and generalize to an unseen environment without further data collection and finetuning. In this paper, we consider a zero shot generalization problem setup that complies with biological intelligent agents' learning and generalization processes. The agent is first presented with previous experiences in the training environment, along with task description in the form of trajectory-level sparse rewards. Later when it is placed in the new testing environment, it is asked to perform the task without any interaction with the testing environment. We find this setting natural for biological creatures and at the same time, challenging for previous methods. Behavior cloning, state-of-art RL along with other zero-shot learning methods perform poorly on this benchmark. Given a set of experiences in the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Model Reduction and Neural Networks · Advanced Bandit Algorithms Research
