IDEAS home Printed from https://ideas.repec.org/a/taf/apmtfi/v31y2024i3p164-201.html
   My bibliography  Save this article

Robust Hedging GANs: Towards Automated Robustification of Hedging Strategies

Author

Listed:
  • Yannick Limmer
  • Blanka Horvath

Abstract

The availability of deep hedging has opened new horizons for solving hedging problems under a large variety of realistic market conditions. At the same time, any model – be it a traditional stochastic model or a market generator – is at best an approximation of market reality, prone to model-misspecification and estimation errors. This raises the question, how to address the risk of discrepancy between anticipated distribution and market reality, in an automated way. This paper presents a natural extension of the original deep hedging framework to address uncertainty in the data generating process via an adversarial approach inspired by GANs. This is achieved through an interplay of three modular components: (i) a (deep) hedging engine, (ii) a data-generating process (that is model agnostic permitting a large variety of classical models as well as machine learning-based market generators), and (iii) a notion of distance on model space to measure deviations between our market prognosis and reality. We do not restrict the ambiguity set to a region around a reference model, but instead penalize deviations from the anticipated distribution. We demonstrate this in numerical experiments to benchmark our framework against other existing results.

Suggested Citation

  • Yannick Limmer & Blanka Horvath, 2024. "Robust Hedging GANs: Towards Automated Robustification of Hedging Strategies," Applied Mathematical Finance, Taylor & Francis Journals, vol. 31(3), pages 164-201, May.
  • Handle: RePEc:taf:apmtfi:v:31:y:2024:i:3:p:164-201
    DOI: 10.1080/1350486X.2024.2440661
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1350486X.2024.2440661
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/1350486X.2024.2440661?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:apmtfi:v:31:y:2024:i:3:p:164-201. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAMF20 .

    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.