Sciweavers

Share
32 search results - page 1 / 7
» Bounding Performance Loss in Approximate MDP Homomorphisms
Sort
View
NIPS
2008
11 years 2 months ago
Bounding Performance Loss in Approximate MDP Homomorphisms
Jonathan Taylor, Doina Precup, Prakash Panangaden
ATAL
2009
Springer
11 years 7 months ago
Transfer via soft homomorphisms
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
Jonathan Sorg, Satinder Singh
JMLR
2006
107views more  JMLR 2006»
11 years 1 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
JMLR
2008
129views more  JMLR 2008»
11 years 1 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
GLOBECOM
2009
IEEE
11 years 8 months ago
How Bad is Single-Path Routing
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
Meng Wang, Chee Wei Tan, Ao Tang, Steven H. Low
books