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 obtained by Clément, Lamberton and Protter [Finance and Stochastics 6 (2002) 449–471].
"Monte Carlo algorithms for optimal stopping and statistical learning." Ann. Appl. Probab. 15 (2) 1396 - 1432, May 2005. https://doi.org/10.1214/105051605000000043