A single-objective deep learning algorithm for high-dimensional optimal stopping problems computes both approximate optimal exercise strategies and option prices, demonstrated on Bermudan max-call options in up to 5000 dimensions.
Neural network regression for Bermudan option pricing
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The pricing of Bermudan options amounts to solving a dynamic programming principle, in which the main difficulty, especially in high dimension, comes from the conditional expectation involved in the computation of the continuation value. These conditional expectations are classically computed by regression techniques on a finite dimensional vector space. In this work, we study neural networks approximations of conditional expectations. We prove the convergence of the well-known Longstaff and Schwartz algorithm when the standard least-square regression is replaced by a neural network approximation. We illustrate the numerical efficiency of neural networks as an alternative to standard regression methods for approximating conditional expectations on several numerical examples.
fields
cs.CE 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving high-dimensional optimal stopping problems using deep learning
A single-objective deep learning algorithm for high-dimensional optimal stopping problems computes both approximate optimal exercise strategies and option prices, demonstrated on Bermudan max-call options in up to 5000 dimensions.