Goal Discovery with Causal Capacity for Efficient Reinforcement Learning
Yan Yu, Yaodong Yang, Zhengbo Lu, Chengdong Ma, Wengang Zhou, Houqiang Li

TL;DR
This paper introduces a novel framework called GDCC that uses causal capacity to identify key decision points in complex environments, enabling more efficient and purposeful exploration in reinforcement learning.
Contribution
The paper proposes a new measure of causality in state space and a Monte Carlo method to identify critical decision points, improving exploration efficiency in high-dimensional RL environments.
Findings
High causal capacity states align with meaningful subgoals
GDCC significantly improves success rates over baseline methods
Method effectively handles continuous high-dimensional environments
Abstract
Causal inference is crucial for humans to explore the world, which can be modeled to enable an agent to efficiently explore the environment in reinforcement learning. Existing research indicates that establishing the causality between action and state transition will enhance an agent to reason how a policy affects its future trajectory, thereby promoting directed exploration. However, it is challenging to measure the causality due to its intractability in the vast state-action space of complex scenarios. In this paper, we propose a novel Goal Discovery with Causal Capacity (GDCC) framework for efficient environment exploration. Specifically, we first derive a measurement of causality in state space, \emph{i.e.,} causal capacity, which represents the highest influence of an agent's behavior on future trajectories. After that, we present a Monte Carlo based method to identify critical…
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.
