On Task-Relevant Loss Functions in Meta-Reinforcement Learning and Online LQR
원문 초록
Designing a competent meta-reinforcement learning (meta-RL) algorithm in terms of data usage remains a central challenge to be tackled for its successful real-world applications. In this paper, we propose a sample-efficient meta-RL algorithm that learns a model of the system or environment at hand in a task-directed manner. As opposed to the standard model-based approaches to meta-RL, our method exploits the value information in order to rapidly capture the decision-critical part of the environment. The key component of our method is the loss function for learning the task inference module and the system model that systematically couples the model discrepancy and the value estimate, thereby facilitating the learning of the policy and the task inference module with a significantly smaller amount of data compared to the existing meta-RL algorithms. The idea is also extended to a non-meta-RL setting, namely an online linear quadratic regulator (LQR) problem, where our method can be simplified to reveal the essence of the strategy. The proposed method is evaluated in high-dimensional robotic control and online LQR problems, empirically verifying its effectiveness in extracting information indispensable for solving the tasks from observations in a sample efficient manner.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Task Belief Similarity with Latent Dynamics for Meta-Reinforcement Learning
Bayesian Meta-Reinforcement Learning with Laplace Variational Recurrent Networks
Meta-World+: An Improved, Standardized, RL Benchmark
Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
Entropy Regularized Task Representation Learning for Offline Meta-Reinforcement Learning
Mind the Gap: Towards Generalizable Autonomous Penetration Testing via Domain Randomization and Meta-Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.