Monte Carlo Algorithms for Optimal Stopping and Statistical Learning

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We extend the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems on high-dimensional state spaces. We reformulate the optimal stopping problem for Markov processes in discrete time as a generalized statistical learning problem. Within this setup we apply deviation inequalities for suprema of empirical processes to derive consistency criteria, and to estimate the convergence rate and sample complexity. Our results strengthen and extend earlier results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Monte Carlo Algorithms for Optimal Stopping and Statistical Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Monte Carlo Algorithms for Optimal Stopping and Statistical Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monte Carlo Algorithms for Optimal Stopping and Statistical Learning will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-713703

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.