Sciweavers

81 search results - page 6 / 17
» The Optimal Reward Baseline for Gradient-Based Reinforcement...
Sort
View
ICML
2003
IEEE
14 years 8 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
ICML
2010
IEEE
13 years 8 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
NIPS
1997
13 years 9 months ago
Nonparametric Model-Based Reinforcement Learning
This paper describes some of the interactions of model learning algorithms and planning algorithms we have found in exploring model-based reinforcement learning. The paper focuses...
Christopher G. Atkeson
CORR
2012
Springer
216views Education» more  CORR 2012»
12 years 3 months ago
Fractional Moments on Bandit Problems
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...
Ananda Narayanan B., Balaraman Ravindran
IWANN
1999
Springer
13 years 12 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson