Sciweavers

144 search results - page 10 / 29
» A Cautious Approach to Generalization in Reinforcement Learn...
Sort
View
ML
2002
ACM
121views Machine Learning» more  ML 2002»
14 years 9 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
14 years 1 months ago
Evolution of reward functions for reinforcement learning
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...
Scott Niekum, Lee Spector, Andrew G. Barto
AAMAS
2007
Springer
14 years 10 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
ATAL
2009
Springer
15 years 4 months ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
AAMAS
2005
Springer
14 years 10 months ago
Coordinating Multiple Agents via Reinforcement Learning
In this paper, we focus on the coordination issues in a multiagent setting. Two coordination algorithms based on reinforcement learning are presented and theoretically analyzed. O...
Gang Chen, Zhonghua Yang, Hao He, Kiah Mok Goh