Hostname: page-component-5d84bcc8dc-76cxt Total loading time: 0 Render date: 2026-09-06T16:24:14.515Z Has data issue: false hasContentIssue false

Solving high-dimensional optimal stopping problems using deep learning

Published online by Cambridge University Press:  27 April 2021

SEBASTIAN BECKER
Affiliation:
RiskLab, Department of Mathematics, ETH Zürich, 8092 Zürich, Switzerland emails:sebastian.becker@math.ethz.ch; patrick.cheridito@math.ethz.ch
PATRICK CHERIDITO
Affiliation:
RiskLab, Department of Mathematics, ETH Zürich, 8092 Zürich, Switzerland emails:sebastian.becker@math.ethz.ch; patrick.cheridito@math.ethz.ch
ARNULF JENTZEN
Affiliation:
Seminar for Applied Mathematics, Department of Mathematics, ETH Zürich, 8092 Zürich, Switzerland and Faculty of Mathematics and Computer Science, University of Münster, 48149 Münster, Germany email: a.j@uni-muenster.de
TIMO WELTI
Affiliation:
Seminar for Applied Mathematics, Department of Mathematics, ETH Zürich, 8092 Zürich, Switzerland and D ONE Solutions AG, 8003 Zürich, Switzerland email: contact@twelti.org
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlying assets. High-dimensional optimal stopping problems are, however, notoriously difficult to solve due to the well-known curse of dimensionality. In this work, we propose an algorithm for solving such problems, which is based on deep learning and computes, in the context of early exercise option pricing, both approximations of an optimal exercise strategy and the price of the considered option. The proposed algorithm can also be applied to optimal stopping problems that arise in other areas where the underlying stochastic process can be efficiently simulated. We present numerical results for a large number of example problems, which include the pricing of many high-dimensional American and Bermudan options, such as Bermudan max-call options in up to 5000 dimensions. Most of the obtained results are compared to reference values computed by exploiting the specific problem design or, where available, to reference values from the literature. These numerical results suggest that the proposed algorithm is highly effective in the case of many underlyings, in terms of both accuracy and speed.

Information

Type
Papers
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press