Sciweavers

340 search results - page 16 / 68
» Kernelized value function approximation for reinforcement le...
Sort
View
89
Voted
ICML
2007
IEEE
16 years 3 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi
UAI
2008
15 years 3 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
AAAI
2006
15 years 3 months ago
Action Selection in Bayesian Reinforcement Learning
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...
Tao Wang
PR
2006
93views more  PR 2006»
15 years 2 months ago
Learning the kernel parameters in kernel minimum distance classifier
Choosing appropriate values for kernel parameters is one of the key problems in many kernel-based methods because the values of these parameters have significant impact on the per...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou
150
Voted
AAAI
2012
13 years 4 months ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous