IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2405.02570.html
   My bibliography  Save this paper

Gradient-enhanced sparse Hermite polynomial expansions for pricing and hedging high-dimensional American options

Author

Listed:
  • Jiefei Yang
  • Guanglian Li

Abstract

We propose an efficient and easy-to-implement gradient-enhanced least squares Monte Carlo method for computing price and Greeks (i.e., derivatives of the price function) of high-dimensional American options. It employs the sparse Hermite polynomial expansion as a surrogate model for the continuation value function, and essentially exploits the fast evaluation of gradients. The expansion coefficients are computed by solving a linear least squares problem that is enhanced by gradient information of simulated paths. We analyze the convergence of the proposed method, and establish an error estimate in terms of the best approximation error in the weighted $H^1$ space, the statistical error of solving discrete least squares problems, and the time step size. We present comprehensive numerical experiments to illustrate the performance of the proposed method. The results show that it outperforms the state-of-the-art least squares Monte Carlo method with more accurate price, Greeks, and optimal exercise strategies in high dimensions but with nearly identical computational cost, and it can deliver comparable results with recent neural network-based methods up to dimension 100.

Suggested Citation

  • Jiefei Yang & Guanglian Li, 2024. "Gradient-enhanced sparse Hermite polynomial expansions for pricing and hedging high-dimensional American options," Papers 2405.02570, arXiv.org.
    • Handle: RePEc:arx:papers:2405.02570
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2405.02570
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," The Review of Financial Studies, Society for Financial Studies, vol. 14(1), pages 113-147.
    2. Andrew S. Na & Justin W. L. Wan, 2023. "Efficient pricing and hedging of high-dimensional American options using deep recurrent networks," Quantitative Finance, Taylor & Francis Journals, vol. 23(4), pages 631-651, April.
    3. A. Max Reppen & H. Mete Soner & Valentin Tissot-Daguette, 2023. "Deep stochastic optimization in finance," Digital Finance, Springer, vol. 5(1), pages 91-111, March.
    4. Haojie Wang & Han Chen & Agus Sudjianto & Richard Liu & Qi Shen, 2018. "Deep Learning-Based BSDE Solver for Libor Market Model with Application to Bermudan Swaption Pricing and Hedging," Papers 1807.06622, arXiv.org, revised Sep 2018.
    5. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen, 2019. "Pricing and hedging American-style options with deep learning," Papers 1912.11060, arXiv.org, revised Jul 2020.
    6. Jiefei Yang & Guanglian Li, 2023. "On Sparse Grid Interpolation for American Option Pricing with Multiple Underlying Assets," Papers 2309.08287, arXiv.org, revised Sep 2023.
    7. Justin Sirignano & Konstantinos Spiliopoulos, 2017. "DGM: A deep learning algorithm for solving partial differential equations," Papers 1708.07469, arXiv.org, revised Sep 2018.
    8. Yangang Chen & Justin W. L. Wan, 2021. "Deep neural network framework based on backward stochastic differential equations for pricing and hedging American options in high dimensions," Quantitative Finance, Taylor & Francis Journals, vol. 21(1), pages 45-67, January.
    9. Gobet, Emmanuel & Labart, Céline, 2007. "Error expansion for the discretization of backward stochastic differential equations," Stochastic Processes and their Applications, Elsevier, vol. 117(7), pages 803-829, July.
    10. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," University of California at Los Angeles, Anderson Graduate School of Management qt43n1k4jb, Anderson Graduate School of Management, UCLA.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chinonso Nwankwo & Nneka Umeorah & Tony Ware & Weizhong Dai, 2022. "Deep learning and American options via free boundary framework," Papers 2211.11803, arXiv.org, revised Dec 2022.
    2. Ivan Guo & Nicolas Langren'e & Jiahao Wu, 2023. "Simultaneous upper and lower bounds of American option prices with hedging via neural networks," Papers 2302.12439, arXiv.org, revised Apr 2024.
    3. Lukas Gonon, 2022. "Deep neural network expressivity for optimal stopping problems," Papers 2210.10443, arXiv.org.
    4. Beatriz Salvador & Cornelis W. Oosterlee & Remco van der Meer, 2020. "Financial Option Valuation by Unsupervised Learning with Artificial Neural Networks," Mathematics, MDPI, vol. 9(1), pages 1-20, December.
    5. A. Max Reppen & H. Mete Soner & Valentin Tissot-Daguette, 2022. "Neural Optimal Stopping Boundary," Papers 2205.04595, arXiv.org, revised May 2023.
    6. Hainaut, Donatien & Akbaraly, Adnane, 2023. "Risk management with Local Least Squares Monte-Carlo," LIDAM Discussion Papers ISBA 2023003, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    7. Calypso Herrera & Florian Krach & Pierre Ruyssen & Josef Teichmann, 2021. "Optimal Stopping via Randomized Neural Networks," Papers 2104.13669, arXiv.org, revised Dec 2023.
    8. A. Max Reppen & H. Mete Soner & Valentin Tissot-Daguette, 2022. "Deep Stochastic Optimization in Finance," Papers 2205.04604, arXiv.org.
    9. John Ery & Loris Michel, 2021. "Solving optimal stopping problems with Deep Q-Learning," Papers 2101.09682, arXiv.org, revised Jun 2024.
    10. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen, 2020. "Pricing and Hedging American-Style Options with Deep Learning," JRFM, MDPI, vol. 13(7), pages 1-12, July.
    11. William Lefebvre & Gr'egoire Loeper & Huy^en Pham, 2022. "Differential learning methods for solving fully nonlinear PDEs," Papers 2205.09815, arXiv.org.
    12. Erhan Bayraktar & Qi Feng & Zhaoyu Zhang, 2022. "Deep Signature Algorithm for Multi-dimensional Path-Dependent Options," Papers 2211.11691, arXiv.org, revised Jan 2024.
    13. A. Max Reppen & H. Mete Soner & Valentin Tissot-Daguette, 2023. "Deep stochastic optimization in finance," Digital Finance, Springer, vol. 5(1), pages 91-111, March.
    14. Christian Bender & Nikolaus Schweizer, 2019. "`Regression Anytime' with Brute-Force SVD Truncation," Papers 1908.08264, arXiv.org, revised Oct 2020.
    15. Antoine Jacquier & Zan Zuric, 2023. "Random neural networks for rough volatility," Papers 2305.01035, arXiv.org.
    16. Ioannis Exarchos & Evangelos Theodorou & Panagiotis Tsiotras, 2019. "Stochastic Differential Games: A Sampling Approach via FBSDEs," Dynamic Games and Applications, Springer, vol. 9(2), pages 486-505, June.
    17. Francisco G'omez Casanova & 'Alvaro Leitao & Fernando de Lope Contreras & Carlos V'azquez, 2024. "Deep Joint Learning valuation of Bermudan Swaptions," Papers 2404.11257, arXiv.org.
    18. Jiawei Huo, 2023. "Finite Difference Solution Ansatz approach in Least-Squares Monte Carlo," Papers 2305.09166, arXiv.org, revised Aug 2024.
    19. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen & Timo Welti, 2019. "Solving high-dimensional optimal stopping problems using deep learning," Papers 1908.01602, arXiv.org, revised Aug 2021.
    20. William Lefebvre & Grégoire Loeper & Huyên Pham, 2023. "Differential learning methods for solving fully nonlinear PDEs," Digital Finance, Springer, vol. 5(1), pages 183-229, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2405.02570. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.