# Solving high-dimensional optimal stopping problems using deep learning

**Authors:** Sebastian Becker, Patrick Cheridito, Arnulf Jentzen, and Timo Welti

arXiv: 1908.01602 · 2021-08-10

## TL;DR

This paper introduces a deep learning-based algorithm to efficiently solve high-dimensional optimal stopping problems, particularly for pricing complex American and Bermudan options with up to 5000 dimensions, overcoming the curse of dimensionality.

## Contribution

The paper presents a novel deep learning algorithm that approximates optimal exercise strategies and prices for high-dimensional optimal stopping problems, applicable beyond finance.

## Key findings

- Effective in high dimensions up to 5000 assets
- Achieves high accuracy compared to reference values
- Demonstrates fast computation times

## Abstract

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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1908.01602/full.md

## Figures

1 figure with captions in the complete paper: https://tomesphere.com/paper/1908.01602/full.md

## References

92 references — full list in the complete paper: https://tomesphere.com/paper/1908.01602/full.md

---
Source: https://tomesphere.com/paper/1908.01602