Continuous MDP Homomorphisms and Homomorphic Policy Gradient
원문 초록
Abstraction has been widely studied as a way to improve the efficiency and generalization of reinforcement learning algorithms. In this paper, we study abstraction in the continuous-control setting. We extend the definition of MDP homomorphisms to encompass continuous actions in continuous state spaces. We derive a policy gradient theorem on the abstract MDP, which allows us to leverage approximate symmetries of the environment for policy optimization. Based on this theorem, we propose an actor-critic algorithm that is able to learn the policy and the MDP homomorphism map simultaneously, using the lax bisimulation metric. We demonstrate the effectiveness of our method on benchmark tasks in the DeepMind Control Suite. Our method's ability to utilize MDP homomorphisms for representation learning leads to improved performance when learning from pixel observations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
Supervised Fine Tuning on Curated Data is Reinforcement Learning (and can be improved)
CO-PILOT: COllaborative Planning and reInforcement Learning On sub-Task curriculum
Local Pairwise Distance Matching for Backpropagation-Free Reinforcement Learning
rQdia: Regularizing Q-Value Distributions With Image Augmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.