Sciweavers

3412 search results - page 7 / 683
» Efficient Reinforcement Learning
Sort
View
IJCAI
2001
13 years 11 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

Publication
151views
12 years 8 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
SLOGICA
2008
120views more  SLOGICA 2008»
13 years 9 months ago
Emergence of Information Transfer by Inductive Learning
We study a simple game theoretic model of information transfer which we consider to be a baseline model for capturing strategic aspects of epistemological questions. In particular,...
Simon M. Huttegger, Brian Skyrms
ECAI
2010
Springer
13 years 11 months ago
The Dynamics of Multi-Agent Reinforcement Learning
Abstract. Infinite-horizon multi-agent control processes with nondeterminism and partial state knowledge have particularly interesting properties with respect to adaptive control, ...
Luke Dickens, Krysia Broda, Alessandra Russo

Publication
240views
12 years 8 months ago
Bayesian multitask inverse reinforcement learning
We generalise the problem of inverse reinforcement learning to multiple tasks, from multiple demonstrations. Each one may represent one expert trying to solve a different task, or ...
Christos Dimitrakakis, Constantin A. Rothkopf