458 search results - page 28 / 92 » Q-Decomposition for Reinforcement Learning Agents |
AAAI
1993
13 years 9 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
AAAI
2007
13 years 10 months ago
2007
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
AAAI
1998
13 years 9 months ago
1998
Learning on real robots in an real, unaltered environment provides an extremely challenging problem. Many of the simplifying assumptions made in other areas of learning cannot be ...
ICML
1997
IEEE
14 years 8 months ago
1997
IEEE
Explanation-Based Reinforcement Learning (EBRL) was introduced by Dietterich and Flann as a way of combining the ability of Reinforcement Learning (RL) to learn optimal plans with...
ICMLA
2009
13 years 5 months ago
2009
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...