Sciweavers

272 search results - page 35 / 55
» Parallel Reinforcement Learning with Linear Function Approxi...
Sort
View
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
13 years 11 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
NIPS
2001
13 years 9 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
ML
2002
ACM
168views Machine Learning» more  ML 2002»
13 years 7 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
IPPS
2009
IEEE
14 years 2 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 5 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke