Sciweavers

128 search results - page 9 / 26
» Hierarchically Optimal Average Reward Reinforcement Learning
Sort
View
ICML
1999
IEEE
15 years 10 months ago
Using Reinforcement Learning to Spider the Web Efficiently
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
Jason Rennie, Andrew McCallum
86
Voted
IAT
2008
IEEE
15 years 3 months 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
95
Voted
IAT
2007
IEEE
15 years 3 months ago
Noise Tolerance in Reinforcement Learning Algorithms
This paper proposes a mechanism of noise tolerance for reinforcement learning algorithms. An adaptive agent that employs reinforcement learning algorithms may receive and accumula...
Richardson Ribeiro, Alessandro L. Koerich, Fabr&ia...
ICML
2003
IEEE
15 years 10 months ago
Q-Decomposition for Reinforcement Learning Agents
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
Stuart J. Russell, Andrew Zimdars
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
15 years 2 months ago
Gradient-Based Learning Updates Improve XCS Performance in Multistep Problems
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi