Sciweavers

175 search results - page 21 / 35
» Forgetting Reinforced Cases
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
GECCO
2005
Springer
111views Optimization» more  GECCO 2005»
14 years 1 months ago
XCS with eligibility traces
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...
Jan Drugowitsch, Alwyn Barry
NIPS
2008
13 years 9 months ago
Policy Search for Motor Primitives in Robotics
Many motor skills in humanoid robotics can be learned using parametrized motor primitives as done in imitation learning. However, most interesting motor learning problems are high...
Jens Kober, Jan Peters
NIPS
2007
13 years 9 months ago
Incremental Natural Actor-Critic Algorithms
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
Shalabh Bhatnagar, Richard S. Sutton, Mohammad Gha...
ESANN
2003
13 years 9 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer