Transfer Reinforcement Learning under Unobserved Contextual Information
Yan Zhang, Michael M. Zavlanos

TL;DR
This paper introduces a method for transfer reinforcement learning that accounts for unobserved contextual information, using causal bounds to improve policy learning and reduce bias in data transfer scenarios.
Contribution
The paper develops a causal bounds approach for transfer RL under unobserved context, enabling unbiased value function estimation and improved learning efficiency.
Findings
Causal bounds effectively reduce bias in transfer RL.
Proposed algorithms accelerate learning with demonstrator data.
Validated on robot motion planning tasks.
Abstract
In this paper, we study a transfer reinforcement learning problem where the state transitions and rewards are affected by the environmental context. Specifically, we consider a demonstrator agent that has access to a context-aware policy and can generate transition and reward data based on that policy. These data constitute the experience of the demonstrator. Then, the goal is to transfer this experience, excluding the underlying contextual information, to a learner agent that does not have access to the environmental context, so that they can learn a control policy using fewer samples. It is well known that, disregarding the causal effect of the contextual information, can introduce bias in the transition and reward models estimated by the learner, resulting in a learned suboptimal policy. To address this challenge, in this paper, we develop a method to obtain causal bounds on 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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Adaptive Dynamic Programming Control · Advanced Bandit Algorithms Research
