Fetching the paper…
Reading the bibliography…
In this paper we develop a deep learning method for optimal stopping problems which directly learns the optimal stopping rule from Monte Carlo samples.
B.B. Mandelbrot and J.W. van Ness (1968). Fractional Brownian motions, fractional noises and applications. SIAM Review 10 (4), 422–437
1968
Earlier work this paper cites.
M. Leshno, V.Y. Lin, A. Pinkus and S. Schocken (1993). Multilayer feedforward networks with a non-polynomial activation function can approximate any function. Neural Networks 6, 861–867
1993
Earlier work this paper cites.
J.A. Tilley (1993). Valuing American options in a path simulation model. Transactions of the Society of Actuaries 45, 83–104
1993
Earlier work this paper cites.
M.H.A. Davis and I. Karatzas (1994). A deterministic approach to optimal stopping. In F.P. Kelly, editor, Probability, Statistics and Optimization: A Tribute to Peter Whittle, 455–466. J. Wiley and Sons
1994
Earlier work this paper cites.
G. Samorodnitsky and M.S. Taqqu (1994). Stable Non-Gaussian Random Processes. Chapman & Hall
1994
Earlier work this paper cites.
J. Barraquand and D. Martineau (1995). Numerical valuation of high dimensional multi-variate American securities. Journal of Financial and Quantitative Analysis 30(3), 383–405
1995
Earlier work this paper cites.
J.F. Carriere (1996). Valuation of the early-exercise price for options using simulation and nonparametric regression. Insurance: Mathematics and Economics, 19, 19–30
1996
Earlier work this paper cites.
R.S. Sutton and A.G. Barto (1998). Reinforcement Learning. The MIT Press
1998
Earlier work this paper cites.
L. Andersen (2000). A simple approach to the pricing of Bermudan swaptions in the multi-factor LIBOR market model. Journal of Computational Finance 3(2), 5–32
2000
Earlier work this paper cites.
G. Grimmett and D. Stirzaker (2001). Probability and Random Processes. 3rd Edition. Oxford University Press
2001
Earlier work this paper cites.
F.A. Longstaff and E.S. Schwartz (2001). Valuing American options by simulation: a simple least-square approach. Review of Financial Studies 14(1), 113–147
2001
Earlier work this paper cites.
J.N. Tsitsiklis and B. Van Roy (2001). Regression methods for pricing complex American-style options. IEEE Transactions on Neural Networks 12(4), 694–703
2001
Earlier work this paper cites.
L.C.G. Rogers (2002). Monte Carlo valuation of American options. Mathematical Finance 12(3), 271–286
2002
Earlier work this paper cites.
M. Schweizer (2002). On Bermudan options. Advances in Finance and Stochastics 257–270
2002
Earlier work this paper cites.
P.P. Boyle, A.W. Kolkiewicz and K.S. Tan (2003). An improved simulation method for pricing high-dimensional American derivatives. Mathematics and Computers in Simulation 62, 315–322
2003
Earlier work this paper cites.
D. García (2003). Convergence and biases of Monte Carlo estimates of American option prices using a parametric exercise rule. Journal of Economic Dynamics and Control 27, 1855–1879
2003
Earlier work this paper cites.
L. Andersen and M. Broadie (2004). Primal-dual simulation algorithm for pricing multidimensional American options. Management Science 50(9), 1222–1234
2004
Earlier work this paper cites.
M. Broadie and P. Glasserman (2004). A stochastic mesh method for pricing high-dimensional American options. Journal of Computational Finance, 7(4), 35–72
2004
Cited alongside, same era.
M. Haugh and L. Kogan (2004). Pricing American options: a duality approach. Operations Research, 52, 258–270
2004
Cited alongside, same era.
V. Bally, G. Pagès and J. Printems (2005). A quantization tree method for pricing and hedging multidimensional American options. Mathematical Finance 15(1), 119–168
2005
Cited alongside, same era.
C.D. Aliprantis and K.C. Border (2006). Infinite Dimensional Analysis. 3rd Edition. Springer
2006
Cited alongside, same era.
A. Kolodko and J. Schoenmakers (2006). Iterative construction of the optimal Bermudan stopping time. Finance and Stochastics 10(1), 27–49
2006
Cited alongside, same era.
D. Belomestny (2011). On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems. Ann. Applied Probability 21(1), 215–239
2011
Later among the works it cites.
V.V. Desai, V.F. Farias and C.C. Moallemi (2012). Pathwise optimization for optimal stopping problems. Management Science 58(12), 2292–2308
2012
Later among the works it cites.
D. Belomestny, J. Schoenmakers and F. Dickmann (2013). Multilevel dual approach for pricing American style derivatives. Finance and Stochastics 17(4), 717–742
2013
Later among the works it cites.
S. Ioffe and C. Szegedy (2015). Batch normalization: accelerating deep network training by reducing internal covariate shift. Proceedings of the 32nd International Conference on Machine Learning, PMLR 37, 448–456
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Peskir and A.N. Shiryaev (2006). Optimal Stopping and Free-Boundary Problems. Lectures in Mathematics. ETH Zurich
2006
Cited alongside, same era.
N. Chen and P. Glasserman (2007). Additive and multiplicative duals for American option pricing. Finance and Stochastics 11, 153–179
2007
Cited alongside, same era.
D. Egloff, M. Kohler and N. Todorovic (2007). A dynamic look-ahead Monte Carlo algorithm for pricing Bermudan options. Ann. Applied Probability 17(4), 1138–1171
2007
Cited alongside, same era.
F. Jamshidian (2007). The duality of optimal exercise and domineering claims: a Doob–Meyer decomposition approach to the Snell envelope. Stochastics 79, 27–60
2007
Cited alongside, same era.
S.J. Berridge and J.M. Schumacher (2008). An irregular grid approach for pricing high-dimensional American options. Journal of Computational and Applied Mathematics 222(1), 94–111
2008
Cited alongside, same era.
M. Broadie and M. Cao (2008). Improved lower and upper bound algorithms for pricing American options by simulation. Quantitative Finance, 8, 845–861
2008
Cited alongside, same era.
D. Lamberton and B. Lapeyre (2008). Introduction to Stochastic Calculus Applied to Finance, 2nd Edition. Chapman and Hall/CRC, Boca Raton, Florida
2008
Cited alongside, same era.
2015
Later among the works it cites.
D. Kingma and J. Ba (2015). Adam: A method for stochastic optimization. International Conference on Learning Representations
2015
Later among the works it cites.
V. Mnih, K. Kavukcuoglu, D. Silver, A.A. Rusu et al. (2015). Human-level control through deep reinforcement learning. Nature, 518, 529–533
2015
Later among the works it cites.
J. Schulman, S. Levine, P. Moritz, M. Jordan and P. Abeel (2015). Trust region policy optimization. Proceedings of Machine Learning Research 37, 1889–1897
2015
Later among the works it cites.
J. Han and W. E (2016). Deep learning approximation for stochastic control problems. Deep Reinforcement Learning Workshop, NIPS
2016
Later among the works it cites.
A.V. Kulikov and P.P. Gusyatnikov (2016). Stopping times for fractional Brownian motion. Computational Management Science. Lecture Notes in Economics and Mathematical Systems 682
2016
Later among the works it cites.
J. Lelong (2016). Pricing American options using martingale bases. Arxiv Preprint
2016
Later among the works it cites.
T.P. Lillicrap, J.J. Hunt, A. Pritzel, N. Heess, T. Erez, Y. Tassa, D. Silver and D. Wierstra (2016). Continuous control with deep reinforcement learning. International Conference on Learning Representations
2016
Later among the works it cites.
D. Silver, A. Huang, C.J. Maddison, A. Guez et al. (2016). Mastering the game of Go with deep neural networks and tree search. Nature 529, 484–489
2016
Later among the works it cites.
D. Belomestny, J. Schoenmakers, V. Spokoiny and Y. Tavyrikov (2018). Optimal stopping via reinforced regression. Arxiv Preprint
2018
Closest in time.
J. Sirignano and K. Spiliopoulos (2018). DGM: A deep learning algorithm for solving partial differential equations. Journal of Computational Physics 375, 1339–1364
2018
Closest in time.
D. Belomestny (2013). Solving optimal stopping problems via empirical dual optimization. Ann. Applied Probability 23(5), 1988–2019
2019
Closest in time.