132 search results - page 26 / 27 » Generalization in Reinforcement Learning: Safely Approximati... |
SAGA
2009
Springer
14 years 9 hour ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
JMLR
2008
13 years 5 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
NIPS
1998
13 years 6 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...