.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Reinforcement learning
Markov decision process
Least-squares policy iteration
Active learning
Batting robot
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
8.3K
Citations:
3.0W
Organization
Cited Papers
ShareSaveShareSaveShareSaveAdaptive importance sampling for value function approximation in off-policy reinforcement learning.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAIShareSaveShareSave
no more
no more