Simplified Temporal Consistency Reinforcement Learning
원문 초록
Reinforcement learning is able to solve complex sequential decision-making tasks but is currently limited by sample efficiency and required computation. To improve sample efficiency, recent work focuses on model-based RL which interleaves model learning with planning. Recent methods further utilize policy learning, value estimation, and, self-supervised learning as auxiliary objectives. In this paper we show that, surprisingly, a simple representation learning approach relying only on a latent dynamics model trained by latent temporal consistency is sufficient for high-performance RL. This applies when using pure planning with a dynamics model conditioned on the representation, but, also when utilizing the representation as policy and value function features in model-free RL. In experiments, our approach learns an accurate dynamics model to solve challenging high-dimensional locomotion tasks with online planners while being 4.1 times faster to train compared to ensemble-based methods. With model-free RL without planning, especially on high-dimensional tasks, such as the DeepMind Control Suite Humanoid and Dog tasks, our approach outperforms model-free methods by a large margin and matches model-based methods' sample efficiency while training 2.4 times faster.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
A Survey of Continual Reinforcement Learning
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
Spectral Bellman Method: Unifying Representation and Exploration in RL
LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.