132 search results - page 20 / 27 » Generalization in Reinforcement Learning: Safely Approximati... |
COLT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
ICML
2006
IEEE
16 years 12 days ago
2006
IEEE
We introduce relational temporal difference learning as an effective approach to solving multi-agent Markov decision problems with large state spaces. Our algorithm uses temporal ...
106
click to vote
TNN
2010
14 years 6 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
82
Voted
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
118
Voted
JCP
2007
14 years 11 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...