IDEAS home Printed from https://ideas.repec.org/a/ris/iosalg/0057.html
   My bibliography  Save this article

AAD and least-square Monte Carlo: Fast Bermudan-style options and XVA Greeks

Author

Listed:
  • Capriotti, Luca

    (Quantitative Strategies, Global Markets, Credit Suisse Group, One Cabot Square and Department of Mathematics, University College London)

  • Jiang, Yupeng

    (Department of Mathematics, University College London)

  • Macrina, Andrea

    (Department of Mathematics, University College London and Department of Actuarial Science, University of Cape Town)

Abstract

We show how Adjoint Algorithmic Differentiation (AAD) can be used to calculate price sensitivities in regression-based Monte Carlo methods reliably and orders of magnitude faster than with standard finite-difference approaches. We present the AAD version of the celebrated least-square algorithms of Tsitsiklis and Van Roy (2001) and Longstaff and Schwartz (2001) . By discussing in detail examples of practical relevance, we demonstrate how accounting for the contributions associated with the regression functions is crucial to obtain accurate estimates of the Greeks, especially in XVA applications.

Suggested Citation

  • Capriotti, Luca & Jiang, Yupeng & Macrina, Andrea, 2017. "AAD and least-square Monte Carlo: Fast Bermudan-style options and XVA Greeks," Algorithmic Finance, IOS Press, vol. 6(1-2), pages 35-49.
  • Handle: RePEc:ris:iosalg:0057
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kathrin Glau & Daniel Kressner & Francesco Statti, 2019. "Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing," Papers 1902.04367, arXiv.org.
    2. Griselda Deelstra & Lech A. Grzelak & Felix L. Wolf, 2022. "Accelerated Computations of Sensitivities for xVA," Papers 2211.17026, arXiv.org, revised Jan 2024.
    3. Mike Ludkovski & Yuri Saporito, 2020. "KrigHedge: Gaussian Process Surrogates for Delta Hedging," Papers 2010.08407, arXiv.org, revised Jan 2022.

    More about this item

    Keywords

    Adjoint algorithmic differentiation (AAD); Monte Carlo methods; Bermudan-style options; valuation adjustments (XVA);
    All these keywords.

    JEL classification:

    • C00 - Mathematical and Quantitative Methods - - General - - - General

    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:ris:iosalg:0057. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Saskia van Wijngaarden (email available below). General contact details of provider: http://www.iospress.nl/ .

    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.