Sciweavers

2011 search results - page 22 / 403
» Universal Reinforcement Learning
Sort
View
ICAART
2010
INSTICC
16 years 2 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
ATAL
2004
Springer
15 years 10 months ago
Time-Extended Policies in Multi-Agent Reinforcement Learning
Many algorithms such as Q-learning successfully address reinforcement learning in single-agent multi-time-step problems. In addition there are methods that address reinforcement l...
Kagan Tumer, Adrian K. Agogino
NIPS
2000
15 years 6 months ago
Balancing Multiple Sources of Reward in Reinforcement Learning
For many problems which would be natural for reinforcement learning, the reward signal is not a single scalar value but has multiple scalar components. Examples of such problems i...
Christian R. Shelton
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 9 months ago
On-line evolutionary computation for reinforcement learning in stochastic domains
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...
Shimon Whiteson, Peter Stone