2 search results - page 1 / 1 » An Efficient Approximation to Lookahead in Relational Learne... |
ECML
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...