.png){kind=icon}
返回
Efficient exploration through active learning for value function approximation in reinforcement learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2009.12.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares policy iteration (LSPI) framework allows us to employ statistical active learning methods for linear regression. Then we propose a design method of good sampling policies for efficient exploration, which is particularly useful when the sampling cost of immediate rewards is high. The effectiveness of the proposed method, which we call active policy iteration (API), is demonstrated through simulations with a batting robot. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Reinforcement learning
Markov decision process
Least-squares policy iteration
Active learning
Batting robot
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
Synthesis and characteristics of a semi‐interpenetrating polymer network based on chitosan/polyaniline under different pH conditions不同pH条件下壳聚糖/聚苯胺半互穿网络聚合物的合成与表征
PREAI
分享收藏Adaptive importance sampling for value function approximation in off-policy reinforcement learning非策略强化学习中值函数逼近的自适应重要性抽样.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏
没有更多内容
没有更多内容