995 search results - page 10 / 199 » Learning Useful Horn Approximations |
RSCTC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
ESANN
2007
13 years 10 months ago
2007
The eligibility trace is one of the most used mechanisms to speed up reinforcement learning. Earlier reported experiments seem to indicate that replacing eligibility traces would p...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...