Sciweavers

651 search results - page 13 / 131
» Algorithms for Inverse Reinforcement Learning
Sort
View
AAAI
1993
13 years 9 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
ICML
2009
IEEE
14 years 8 months ago
The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
Carlos Diuk, Lihong Li, Bethany R. Leffler
ICAART
2010
INSTICC
14 years 4 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
IJCAI
2007
13 years 9 months ago
Deictic Option Schemas
Deictic representation is a representational paradigm, based on selective attention and pointers, that allows an agent to learn and reason about rich complex environments. In this...
Balaraman Ravindran, Andrew G. Barto, Vimal Mathew
NETWORKING
2007
13 years 9 months ago
Reinforcement Learning-Based Load Shared Sequential Routing
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
Fariba Heidari, Shie Mannor, Lorne Mason