Sciweavers

128 search results - page 4 / 26
» Hierarchically Optimal Average Reward Reinforcement Learning
Sort
View
COLT
2007
Springer
14 years 1 months ago
Bounded Parameter Markov Decision Processes with Average Reward Criterion
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
Ambuj Tewari, Peter L. Bartlett
ICMLA
2010
13 years 5 months ago
Multi-Agent Inverse Reinforcement Learning
Learning the reward function of an agent by observing its behavior is termed inverse reinforcement learning and has applications in learning from demonstration or apprenticeship l...
Sriraam Natarajan, Gautam Kunapuli, Kshitij Judah,...
NIPS
2001
13 years 9 months ago
The Steering Approach for Multi-Criteria Reinforcement Learning
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
Shie Mannor, Nahum Shimkin
ICML
2005
IEEE
14 years 8 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
FLAIRS
2004
13 years 9 months ago
State Space Reduction For Hierarchical Reinforcement Learning
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
Mehran Asadi, Manfred Huber