Sciweavers

473 search results - page 48 / 95
» Programmable Reinforcement Learning Agents
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Identifying useful subgoals in reinforcement learning by local graph partitioning
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
Özgür Simsek, Alicia P. Wolfe, Andrew G....
ATAL
2007
Springer
14 years 2 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
IJCAI
2001
13 years 10 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ECML
2004
Springer
14 years 2 months ago
Batch Reinforcement Learning with State Importance
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
Lihong Li, Vadim Bulitko, Russell Greiner
AAAI
1998
13 years 10 months ago
Tree Based Discretization for Continuous State Space Reinforcement Learning
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
William T. B. Uther, Manuela M. Veloso