Sciweavers

805 search results - page 48 / 161
» The Measurable Space of Stochastic Processes
Sort
View
JMLR
2008
129views more  JMLR 2008»
13 years 10 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
ICML
2009
IEEE
14 years 10 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
14 years 1 months ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong
NIPS
2004
13 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
CEC
2010
IEEE
13 years 11 months ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton