Learning to Constrain Policy Optimization with Virtual Trust Region
원문 초록
We introduce a constrained optimization method for policy gradient reinforcement learning, which uses a virtual trust region to regulate each policy update. In addition to using the proximity of one single old policy as the normal trust region, we propose forming a second trust region through another virtual policy representing a wide range of past policies. We then enforce the new policy to stay closer to the virtual policy, which is beneficial if the old policy performs poorly. More importantly, we propose a mechanism to automatically build the virtual policy from a memory of past policies, providing a new capability for dynamically learning appropriate virtual trust regions during the optimization process. Our proposed method, dubbed Memory-Constrained Policy Optimization (MCPO), is examined in diverse environments, including robotic locomotion control, navigation with sparse rewards and Atari games, consistently demonstrating competitive performance against recent on-policy constrained policy gradient methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Divergence-Augmented Policy Optimization
PG-Rainbow: Using Distributional Reinforcement Learning in Policy Gradient Methods
Generalized Adaptive Transfer Network: Enhancing Transfer Learning in Reinforcement Learning Across Domains
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Meta-learning how to Share Credit among Macro-Actions
TextAtari: 100K Frames Game Playing with Language Agents
토론
이 논문과 연결된 포럼 글이 아직 없습니다.