272 search results - page 23 / 55 » Parallel Reinforcement Learning with Linear Function Approxi... |
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
AAAI
2006
13 years 9 months ago
2006
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
SIAMCO
2002
13 years 7 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...