Guided Exploration in Reinforcement Learning via Monte Carlo Critic Optimization
원문 초록
The class of deep deterministic off-policy algorithms is effectively applied to solve challenging continuous control problems. Current approaches commonly utilize random noise as an exploration method, which has several drawbacks, including the need for manual adjustment for a given task and the absence of exploratory calibration during the training process. We address these challenges by proposing a novel guided exploration method that uses an ensemble of Monte Carlo Critics for calculating exploratory action correction. The proposed method enhances the traditional exploration scheme by dynamically adjusting exploration. Subsequently, we present a novel algorithm that leverages the proposed exploratory module for both policy and critic modification. The presented algorithm demonstrates superior performance compared to modern reinforcement learning algorithms across a variety of problems in the DMControl suite.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
Scaling Algorithm Distillation for Continuous Control with Mamba
Reinforcement Learning via Implicit Imitation Guidance
Self-Composing Policies for Scalable Continual Reinforcement Learning
CO-PILOT: COllaborative Planning and reInforcement Learning On sub-Task curriculum
토론
이 논문과 연결된 포럼 글이 아직 없습니다.