Sciweavers

30 search results - page 4 / 6
» Model-Based Average Reward Reinforcement Learning
Sort
View
IJCAI
2001
13 years 7 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
PRIMA
2009
Springer
14 years 9 days ago
Recursive Adaptation of Stepsize Parameter for Non-stationary Environments
In this article, we propose a method to adapt stepsize parameters used in reinforcement learning for dynamic environments. In general reinforcement learning situations, a stepsize...
Itsuki Noda
ALT
2006
Springer
14 years 2 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
NECO
2007
150views more  NECO 2007»
13 years 5 months ago
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
Dorit Baras, Ron Meir
IAT
2008
IEEE
14 years 6 days ago
Formalizing Multi-state Learning Dynamics
This paper extends the link between evolutionary game theory and multi-agent reinforcement learning to multistate games. In previous work, we introduced piecewise replicator dynam...
Daniel Hennes, Karl Tuyls, Matthias Rauterberg