Sciweavers

509 search results - page 19 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
NIPS
1993
13 years 8 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...
ICML
2006
IEEE
14 years 8 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
KR
1992
Springer
13 years 11 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
WSC
2007
13 years 9 months ago
American option pricing under stochastic volatility: a simulation-based approach
We consider the problem of pricing American options when the volatility of the underlying asset price is stochastic. No specific stochastic volatility model is assumed for the st...
Arunachalam Chockalingam, Kumar Muthuraman
CORR
2012
Springer
235views Education» more  CORR 2012»
12 years 3 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli