175 search results - page 12 / 35 » Forgetting Reinforced Cases |
EVOW
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. This paper explores the capabilities of continuous time recurrent neural networks (CTRNNs) to display reinforcement learning-like abilities on a set of T-Maze and double ...
ICML
1995
IEEE
14 years 8 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The goal of developing algorithms for programming robots by demonstration is to create an easy way of programming robots that can be accomplished by everyone. When a de...
COLT
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...