2000 character limit reached
Deep Penalty Methods: A Class of Deep Learning Algorithms for Solving High Dimensional Optimal Stopping Problems (2405.11392v1)
Published 18 May 2024 in q-fin.MF and q-fin.CP
Abstract: We propose a deep learning algorithm for high dimensional optimal stopping problems. Our method is inspired by the penalty method for solving free boundary PDEs. Within our approach, the penalized PDE is approximated using the Deep BSDE framework proposed by \cite{weinan2017deep}, which leads us to coin the term "Deep Penalty Method (DPM)" to refer to our algorithm. We show that the error of the DPM can be bounded by the loss function and $O(\frac{1}{\lambda})+O(\lambda h) +O(\sqrt{h})$, where $h$ is the step size in time and $\lambda$ is the penalty parameter. This finding emphasizes the need for careful consideration when selecting the penalization parameter and suggests that the discretization error converges at a rate of order $\frac{1}{2}$. We validate the efficacy of the DPM through numerical tests conducted on a high-dimensional optimal stopping model in the area of American option pricing. The numerical tests confirm both the accuracy and the computational efficiency of our proposed algorithm.
- Beck, C., W. E, and A. Jentzen (2019): “Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations,” Journal of Nonlinear Science, 29, 1563–1619.
- Becker, S., P. Cheridito, and A. Jentzen (2019): “Deep optimal stopping,” Journal of Machine Learning Research, 20, 1–25.
- Bouchard, B. and J.-F. Chassagneux (2008): “Discrete-time approximation for continuously and discretely reflected BSDEs,” Stochastic Processes and their Applications, 118, 2269–2293.
- Bouchard, B. and N. Touzi (2004): “Discrete-time approximation and Monte-Carlo simulation of backward stochastic differential equations,” Stochastic Processes and their applications, 111, 175–206.
- Broadie, M., P. Glasserman, et al. (2004): “A stochastic mesh method for pricing high-dimensional American options,” Journal of Computational Finance, 7, 35–72.
- Chan-Wai-Nam, Q., J. Mikael, and X. Warin (2019): “Machine learning for semi linear PDEs,” Journal of Scientific Computing, 79, 1667–1712.
- Chen, Y. and J. W. Wan (2021): “Deep neural network framework based on backward stochastic differential equations for pricing and hedging American options in high dimensions,” Quantitative Finance, 21, 45–67.
- E, W., J. Han, and A. Jentzen (2017): “Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations,” Communications in Mathematics and Statistics, 5, 349–380.
- Forsyth, P. A. and K. R. Vetzal (2002): “Quadratic convergence for valuing American options using a penalty method,” SIAM Journal on Scientific Computing, 23, 2095–2122.
- Fujii, M., A. Takahashi, and M. Takahashi (2019): “Asymptotic expansion as prior knowledge in deep learning method for high dimensional BSDEs,” Asia-Pacific Financial Markets, 26, 391–408.
- Han, J., A. Jentzen, and W. E (2018): “Solving high-dimensional partial differential equations using deep learning,” Proceedings of the National Academy of Sciences, 115, 8505–8510.
- Han, J. and J. Long (2020): “Convergence of the deep BSDE method for coupled FBSDEs,” Probability, Uncertainty and Quantitative Risk, 5, 5.
- Haugh, M. B. and L. Kogan (2004): “Pricing American options: A duality approach,” Operations Research, 52, 258–270.
- Howison, S. D., C. Reisinger, and J. H. Witte (2013): “The effect of nonsmooth payoffs on the penalty approximation of American options,” SIAM Journal on Financial Mathematics, 4, 539–574.
- Huré, C., H. Pham, and X. Warin (2019): “Some machine learning schemes for high-dimensional nonlinear PDEs,” arXiv preprint arXiv:1902.01599, 2.
- ——— (2020): “Deep backward schemes for high-dimensional nonlinear PDEs,” Mathematics of Computation, 89, 1547–1579.
- Jiang, L. and M. Dai (2004): “Convergence of binomial tree methods for European/American path-dependent options,” SIAM Journal on Numerical Analysis, 42, 1094–1109.
- Kingma, D. P. and J. Ba (2014): “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980.
- Kohler, M., A. Krzyżak, and N. Todorovic (2010): “Pricing of High-Dimensional American Options by Neural Networks,” Mathematical Finance: An International Journal of Mathematics, Statistics and Financial Economics, 20, 383–410.
- Lagaris, I. E., A. Likas, and D. I. Fotiadis (1998): “Artificial neural networks for solving ordinary and partial differential equations,” IEEE transactions on neural networks, 9, 987–1000.
- Liang, G. (2015): “Stochastic control representations for penalized backward stochastic differential equations,” SIAM Journal on Control and Optimization, 53, 1440–1463.
- Liang, G., E. Lütkebohmert, and W. Wei (2015): “Funding liquidity, debt tenor structure, and creditor’s belief: an exogenous dynamic debt run model,” Mathematics and Financial Economics, 9, 271–302.
- Liang, G. and W. Wei (2016): “Optimal switching at Poisson random intervention times,” Discrete and Continuous Dynamic Systems Series B, 21, 1483–1505.
- Liang, J., B. Hu, L. Jiang, and B. Bian (2007): “On the rate of convergence of the binomial tree scheme for American options,” Numerische Mathematik, 107, 333–352.
- Longstaff, F. A. and E. S. Schwartz (2001): “Valuing American options by simulation: a simple least-squares approach,” The review of financial studies, 14, 113–147.
- Na, A. S. and J. W. Wan (2023): “Efficient pricing and hedging of high-dimensional American options using deep recurrent networks,” Quantitative Finance, 23, 631–651.
- Pardoux, E. and S. Peng (2005): “Backward stochastic differential equations and quasilinear parabolic partial differential equations,” in Stochastic Partial Differential Equations and Their Applications: Proceedings of IFIP WG 7/1 International Conference University of North Carolina at Charlotte, NC June 6–8, 1991, Springer, 200–217.
- Pardoux, E. and S. Tang (1999): “Forward-backward stochastic differential equations and quasilinear parabolic PDEs,” Probability Theory and Related Fields, 114, 123–150.
- Raissi, M. (2018): “Forward-backward stochastic neural networks: Deep learning of high-dimensional partial differential equations,” arXiv preprint arXiv:1804.07010.
- Reisinger, C. and J. H. Witte (2012): “On the use of policy iteration as an easy way of pricing American options,” SIAM Journal on Financial Mathematics, 3, 459–478.
- Sirignano, J. and K. Spiliopoulos (2018): “DGM: A deep learning algorithm for solving partial differential equations,” Journal of computational physics, 375, 1339–1364.
- Sun, C., K. S. Tan, and W. Wei (2022): “Credit Valuation Adjustment with Replacement Closeout: Theory and Algorithms,” arXiv preprint arXiv:2201.09105.
- Witte, J. H. and C. Reisinger (2011): “A penalty method for the numerical solution of Hamilton–Jacobi–Bellman (HJB) equations in finance,” SIAM Journal on Numerical Analysis, 49, 213–231.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.