313 search results - page 11 / 63 » Consistent Approximations and Approximate Functions and Grad... |
JCP
2007
13 years 8 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
AAAI
2008
13 years 11 months ago
2008
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
UAI
2008
13 years 10 months ago
2008
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...
COCO
1994
Springer
14 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...