463 search results - page 11 / 93 » Localizing Search in Reinforcement Learning |
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
CG
2006
Springer
15 years 1 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
148
click to vote
Book
"Reinforcement learning is learning what to do how to map situations to actions so as to maximize a numerical reward signal. The learner is not told which actions to take, as ...
107
click to vote
IJCAI
2001
15 years 1 months ago
2001
Using a distributed algorithm rather than a centralized one can be extremely beneficial in large search problems. In addition, the incorporation of machine learning techniques lik...
88
Voted
ICML
2003
IEEE
16 years 14 days ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...