.png){kind=icon}
返回
Optimistic Sampling Strategy for Data-Efficient Reinforcement Learning
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2913001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A high required number of interactions with the environment is one of the most important problems in reinforcement learning (RL). To deal with this problem, several data-efficient RL algorithms have been proposed and successfully applied in practice. Unlike previous research, that focuses on optimal policy evaluation and policy improvement stages, we actively select informative samples by leveraging entropy-based optimal sampling strategy, which takes the initial samples set into consideration. During the initial sampling process, information entropy is used to describe the potential samples. The agent selects the most informative samples using an optimization method. This way, the initial sample is more informative than in random and fixed strategy. Therefore, a more accurate initial dynamic model and policy can be learned. Thus, the proposed optimal sampling method guides the agent to search in a more informative region. The experimental results on standard benchmark problems involving a pendulum, cart pole, and cart double pendulum show that our optimal sampling strategy has a better performance in terms of data efficiency.
Keyword:
Reinforcement learning
information entropy
optimistic sampling
data efficiency
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A recurrent neural network for classification of unevenly sampled variable stars.png)
NATURE ASTRONOMY
OAAI
NATURE ASTRONOMYIF14.3
OAAI分享收藏Removal of artifact depressions from digital elevation models: towards a minimum impact approach
PREAI
分享收藏 没有更多内容
没有更多内容