美式期权的价值是期权贴现现金流的最大化价值。在每个时间步，需要比较立即行权价值与持续价值，并在行权价值严格大于持续价值时立即行权。我们可以将此问题表述为动态规划方程，主要困难在于计算每个时间步代表持续价值的条件期望。在 (Longstaff and Schwartz, 2001) 中，这些条件期望是通过对有限维向量空间（通常是多项式基）进行回归来估计的。在本文中，我们遵循相同的算法；只是使用回归树或随机森林来估计条件期望。我们讨论了当标准最小二乘回归被回归树替代时 LS 算法的收敛性。最后，我们展示了使用回归树和随机森林的一些数值结果。随机森林算法在高维情况下给出了极好的结果。
英文摘要：
The value of an American option is the maximized value of the discounted cash flows from the option. At each time step, one needs to compare the immediate exercise value with the continuation value and decide to exercise as soon as the exercise value is strictly greater than the continuation value. We can formulate this problem as a dynamic programming equation, where the main difficulty comes from the computation of the conditional expectations representing the continuation values at each time step. In (Longstaff and Schwartz, 2001), these conditional expectations were estimated using regressions on a finite-dimensional vector space (typically a polynomial basis). In this paper, we follow the same algorithm; only the conditional expectations are estimated using Regression trees or Random forests. We discuss the convergence of the LS algorithm when the standard least squares regression is replaced with regression trees. Finally, we expose some numerical results with regression trees and random forests. The random forest algorithm gives excellent results in high dimensions.
This paper proposes two numerical solution based on Product Optimal Quantization for the pricing of Foreign Echange (FX) linked long term Bermudan options e.g. Bermudan Power Reverse Dual Currency options, where we take into account stochastic domestic and foreign interest rates on top of stochastic FX rate, hence we consider a 3-factor model. For these two numerical methods, we give an estimation of the $L^2$-error induced by such approximations and we illustrate them with market-based examples that highlight the speed of such methods.
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 approximat…
In this work, we propose a new policy iteration algorithm for pricing Bermudan options when the payoff process cannot be written as a function of a lifted Markov process. Our approach is based on a modification of the well-known Longstaff Schwartz algorithm, in which we basically replace the standard least square regression by a Wiener chaos expansion. Not only does it allow us to deal with a non Markovian setting, but it also breaks the bottleneck induced by the least square regression as the coefficients of the chaos expansion are given by scalar products on the L^2 space and can therefore b…
Pricing of financial derivatives, in particular early exercisable options such as Bermudan options, is an important but heavy numerical task in financial institutions, and its speed-up will provide a large business impact. Recently, applications of quantum computing to financial problems have been started to be investigated. In this paper, we first propose a quantum algorithm for Bermudan option pricing. This method performs the approximation of the continuation value, which is a crucial part of Bermudan option pricing, by Chebyshev interpolation, using the values at interpolation nodes estima…
This paper describes a fast and stable algorithm for evaluating Bermudan swaption under the two factor Hull-White model. We discretize the calculation of the expected value in the evaluation of Bermudan swaption by numerical integration, and Gaussian kernel sums appears in it. The fast Gauss transform can be applied to these Gaussian kernel sums, and it reduces computational complexity from $O(N^2)$ to $O(N)$ as grid points number $N$ of numerical integration. We also propose to stabilize the computation under the condition that the correlation is close to $-1$ by introducing the grid rotation…
We investigate two new strategies for the numerical solution of optimal stopping problems within the Regression Monte Carlo (RMC) framework of Longstaff and Schwartz. First, we propose the use of stochastic kriging (Gaussian process) meta-models for fitting the continuation value. Kriging offers a flexible, nonparametric regression approach that quantifies approximation quality. Second, we connect the choice of stochastic grids used in RMC to the Design of Experiments paradigm. We examine space-filling and adaptive experimental designs; we also investigate the use of batching with replicated s…
An efficient compression technique based on hierarchical tensors for popular option pricing methods is presented. It is shown that the "curse of dimensionality" can be alleviated for the computation of Bermudan option prices with the Monte Carlo least-squares approach as well as the dual martingale method, both using high-dimensional tensorized polynomial expansions. This discretization allows for a simple and computationally cheap evaluation of conditional expectations. Complexity estimates are provided as well as a description of the optimization procedures in the tensor train format. Numeri…
A deep BSDE approach for the simultaneous pricing and delta-gamma hedging of large portfolios consisting of high-dimensional multi-asset Bermudan options
提出基于离散反射 BSDE、One Step Malliavin 格式与神经网络回归 Monte Carlo 的深度方法，实现高维多资产百慕大期权大型投资组合的联合定价及 delta-gamma 对冲。
In this paper we propose an efficient method to compute the price of multi-asset American options, based on Machine Learning, Monte Carlo simulations and variance reduction technique. Specifically, the options we consider are written on a basket of assets, each of them following a Black-Scholes dynamics. In the wake of Ludkovski's approach (2018), we implement here a backward dynamic programming algorithm which considers a finite number of uniformly distributed exercise dates. On these dates, the option value is computed as the maximum between the exercise value and the continuation value, whi…
We develop a mixed least squares Monte Carlo-partial differential equation (LSMC-PDE) method for pricing Bermudan style options on assets whose volatility is stochastic. The algorithm is formulated for an arbitrary number of assets and volatility processes and we prove the algorithm converges almost surely for a class of models. We also discuss two methods to improve the algorithm's computational complexity. Our numerical examples focus on the single ($2d$) and multi-dimensional ($4d$) Heston models and we compare our hybrid algorithm with classical LSMC approaches. In each case, we find that …
We present a semi-static hedging algorithm for callable interest rate derivatives under an affine, multi-factor term-structure model. With a traditional dynamic hedge, the replication portfolio needs to be updated continuously through time as the market moves. In contrast, we propose a semi-static hedge that needs rebalancing on just a finite number of instances. We show, taking as an example Bermudan swaptions, that callable interest rate derivatives can be replicated with an options portfolio written on a basket of discount bonds. The static portfolio composition is obtained by regressing th…
American and Bermudan-type financial instruments are often priced with specific Monte Carlo techniques whose efficiency critically depends on the effective dimensionality of the problem and the available computational power. In our work we focus on Bermudan Swaptions, well-known interest rate derivatives embedded in callable debt instruments or traded in the OTC market for hedging or speculation purposes, and we adopt an original pricing approach based on Supervised Learning (SL) algorithms. In particular, we link the price of a Bermudan Swaption to its natural hedges, i.e. the underlying Euro…
We present a simple, fast, and accurate method for pricing a variety of discretely monitored options in the Black-Scholes framework, including autocallable structured products, single and double barrier options, and Bermudan options. The method is based on a quadrature technique, and it employs only elementary calculations and a fixed one-dimensional uniform grid. The convergence rate is $O(1/N^4)$ and the complexity is $O(MN\log N)$, where $N$ is the number of grid points and $M$ is the number of observation dates.
ETH Zürich（苏黎世联邦理工学院）；University of Münster（明斯特大学）；D ONE Solutions AG（D ONE解决方案股份公司）
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 optima…
In this paper we introduce a deep learning method for pricing and hedging American-style options. It first computes a candidate optimal stopping policy. From there it derives a lower bound for the price. Then it calculates an upper bound, a point estimate and confidence intervals. Finally, it constructs an approximate dynamic hedging strategy. We test the approach on different specifications of a Bermudan max-call option. In all cases it produces highly accurate prices and dynamic hedging strategies with small replication errors.
This paper presents a multinomial method for option pricing when the underlying asset follows an exponential Variance Gamma process. The continuous time Variance Gamma process is approximated by a discrete time Markov chain with the same firsts four cumulants. This approach is particularly convenient for pricing American and Bermudan options, which can be exercised at any time up to expiration date. Numerical computations of European and American options are presented, and compared with results obtained with finite differences methods and with the Black Scholes model.
We present new numerical schemes for pricing perpetual Bermudan and American options as well as $α$-quantile options. This includes a new direct calculation of the optimal exercise barrier for early-exercise options. Our approach is based on the Spitzer identities for general Lévy processes and on the Wiener-Hopf method. Our direct calculation of the price of $α$-quantile options combines for the first time the Dassios-Port-Wendel identity and the Spitzer identities for the extrema of processes. Our results show that the new pricing methods provide excellent error convergence with respect to c…
We propose a new jump-diffusion process, the Heston-Queue-Hawkes (HQH) model, combining the well-known Heston model and the recently introduced Queue-Hawkes (Q-Hawkes) jump process. Like the Hawkes process, the HQH model can capture the effects of self-excitation and contagion. However, since the characteristic function of the HQH process is known in closed-form, Fourier-based fast pricing algorithms, like the COS method, can be fully exploited with this model. Furthermore, we show that by using partial integrals of the characteristic function, which are also explicitly known for the HQH proce…
This paper provides a methodology for fast and accurate pricing of the long-dated contracts that arise as the building blocks of insurance and pension fund agreements. It applies the recursive marginal quantization (RMQ) and joint recursive marginal quantization (JRMQ) algorithms outside the framework of traditional risk-neutral methods by pricing options under the real-world probability measure, using the benchmark approach. The benchmark approach is reviewed, and the real-world pricing theorem is presented and applied to various long-dated claims to obtain less expensive prices than suggeste…
This paper extends the Singular Fourier--Padé (SFP) method proposed by Chan (2018) to pricing/hedging early-exercise options--Bermudan, American and discrete-monitored barrier options--under a Lévy process. The current SFP method is incorporated with the Filon--Clenshaw--Curtis (FCC) rules invented by Domínguez et al. (2011), and we call the new method SFP--FCC. The main purpose of using the SFP--FCC method is to require a small number of terms to yield fast error convergence and to formulate option pricing and option Greek curves rather than individual prices/Greek values. We also numerically…
We introduce a new method to calculate the credit exposure of European and path-dependent options. The proposed method is able to calculate accurate expected exposure and potential future exposure profiles under the risk-neutral and the real-world measure. Key advantage of is that it delivers an accuracy comparable to a full re-evaluation and at the same time it is faster than a regression-based method. Core of the approach is solving a dynamic programming problem by function approximation. This yields a closed form approximation along the paths together with the option's delta and gamma. The …
There is a vast literature on numerical valuation of exotic options using Monte Carlo, binomial and trinomial trees, and finite difference methods. When transition density of the underlying asset or its moments are known in closed form, it can be convenient and more efficient to utilize direct integration methods to calculate the required option price expectations in a backward time-stepping algorithm. This paper presents a simple, robust and efficient algorithm that can be applied for pricing many exotic options by computing the expectations using Gauss-Hermite integration quadrature applied …
In this paper we propose two efficient techniques which allow one to compute the price of American basket options. In particular, we consider a basket of assets that follow a multi-dimensional Black-Scholes dynamics. The proposed techniques, called GPR Tree (GRP-Tree) and GPR Exact Integration (GPR-EI), are both based on Machine Learning, exploited together with binomial trees or with a closed formula for integration. Moreover, these two methods solve the backward dynamic programming problem considering a Bermudan approximation of the American option. On the exercise dates, the value of the op…
