false

High order approximations and simulation schemes for the log-Heston process

High order approximations and simulation schemes for the log-Heston process ArXiv ID: 2407.17151 “View on arXiv” Authors: Unknown Abstract We present weak approximations schemes of any order for the Heston model that are obtained by using the method developed by Alfonsi and Bally (2021). This method consists in combining approximation schemes calculated on different random grids to increase the order of convergence. We apply this method with either the Ninomiya-Victoir scheme (2008) or a second-order scheme that samples exactly the volatility component, and we show rigorously that we can achieve then any order of convergence. We give numerical illustrations on financial examples that validate the theoretical order of convergence. We also present promising numerical results for the multifactor/rough Heston model and hint at applications to other models, including the Bates model and the double Heston model. ...

July 24, 2024 · 2 min · Research Team

Gaussian Recombining Split Tree

Gaussian Recombining Split Tree ArXiv ID: 2405.16333 “View on arXiv” Authors: Unknown Abstract Binomial trees are widely used in the financial sector for valuing securities with early exercise characteristics, such as American stock options. However, while effective in many scenarios, pricing options with CRR binomial trees are limited. Major limitations are volatility estimation, constant volatility assumption, subjectivity in parameter choices, and impracticality of instantaneous delta hedging. This paper presents a novel tree: Gaussian Recombining Split Tree (GRST), which is recombining and does not need log-normality or normality market assumption. GRST generates a discrete probability mass function of market data distribution, which approximates a Gaussian distribution with known parameters at any chosen time interval. GRST Mixture builds upon the GRST concept while being flexible to fit a large class of market distributions and when given a 1-D time series data and moments of distributions at each time interval, fits a Gaussian mixture with the same mixture component probabilities applied at each time interval. Gaussian Recombining Split Tre Mixture comprises several GRST tied using Gaussian mixture component probabilities at the first node. Our extensive empirical analysis shows that the option prices from the GRST align closely with the market. ...

May 25, 2024 · 2 min · Research Team

Stochastic Expansion for the Pricing of Asian and Basket Options

Stochastic Expansion for the Pricing of Asian and Basket Options ArXiv ID: 2402.17684 “View on arXiv” Authors: Unknown Abstract We present closed analytical approximations for the pricing of basket options, also applicable to Asian options with discrete averaging under the Black-Scholes model with time-dependent parameters. The formulae are obtained by using a stochastic Taylor expansion around a log-normal proxy model and are found to be highly accurate for Asian options in practice as well as for vanilla options with discrete dividends. ...

February 27, 2024 · 1 min · Research Team

Time series generation for option pricing on quantum computers using tensor network

Time series generation for option pricing on quantum computers using tensor network ArXiv ID: 2402.17148 “View on arXiv” Authors: Unknown Abstract Finance, especially option pricing, is a promising industrial field that might benefit from quantum computing. While quantum algorithms for option pricing have been proposed, it is desired to devise more efficient implementations of costly operations in the algorithms, one of which is preparing a quantum state that encodes a probability distribution of the underlying asset price. In particular, in pricing a path-dependent option, we need to generate a state encoding a joint distribution of the underlying asset price at multiple time points, which is more demanding. To address these issues, we propose a novel approach using Matrix Product State (MPS) as a generative model for time series generation. To validate our approach, taking the Heston model as a target, we conduct numerical experiments to generate time series in the model. Our findings demonstrate the capability of the MPS model to generate paths in the Heston model, highlighting its potential for path-dependent option pricing on quantum computers. ...

February 27, 2024 · 2 min · Research Team

The implied volatility surface (also) is path-dependent

The implied volatility surface (also) is path-dependent ArXiv ID: 2312.15950 “View on arXiv” Authors: Unknown Abstract We propose a new model for the forecasting of both the implied volatility surfaces and the underlying asset price. In the spirit of Guyon and Lekeufack (2023) who are interested in the dependence of volatility indices (e.g. the VIX) on the paths of the associated equity indices (e.g. the S&P 500), we first study how vanilla options implied volatility can be predicted using the past trajectory of the underlying asset price. Our empirical study reveals that a large part of the movements of the at-the-money-forward implied volatility for up to two years time-to-maturities can be explained using the past returns and their squares. Moreover, we show that this feedback effect gets weaker when the time-to-maturity increases. Building on this new stylized fact, we fit to historical data a parsimonious version of the SSVI parameterization (Gatheral and Jacquier, 2014) of the implied volatility surface relying on only four parameters and show that the two parameters ruling the at-the-money-forward implied volatility as a function of the time-to-maturity exhibit a path-dependent behavior with respect to the underlying asset price. Finally, we propose a model for the joint dynamics of the implied volatility surface and the underlying asset price. The latter is modelled using a variant of the path-dependent volatility model of Guyon and Lekeufack and the former is obtained by adding a feedback effect of the underlying asset price onto the two parameters ruling the at-the-money-forward implied volatility in the parsimonious SSVI parameterization and by specifying Ornstein-Uhlenbeck processes for the residuals of these two parameters and Jacobi processes for the two other parameters. Thanks to this model, we are able to simulate highly realistic paths of implied volatility surfaces that are free from static arbitrage. ...

December 26, 2023 · 2 min · Research Team

Alternative models for FX, arbitrage opportunities and efficient pricing of double barrier options in Lévy models

Alternative models for FX, arbitrage opportunities and efficient pricing of double barrier options in Lévy models ArXiv ID: 2312.03915 “View on arXiv” Authors: Unknown Abstract We analyze the qualitative differences between prices of double barrier no-touch options in the Heston model and pure jump KoBoL model calibrated to the same set of the empirical data, and discuss the potential for arbitrage opportunities if the correct model is a pure jump model. We explain and demonstrate with numerical examples that accurate and fast calculations of prices of double barrier options in jump models are extremely difficult using the numerical methods available in the literature. We develop a new efficient method (GWR-SINH method) based of the Gaver-Wynn-Rho acceleration applied to the Bromwich integral; the SINH-acceleration and simplified trapezoid rule are used to evaluate perpetual double barrier options for each value of the spectral parameter in GWR-algorithm. The program in Matlab running on a Mac with moderate characteristics achieves the precision of the order of E-5 and better in several several dozen of milliseconds; the precision E-07 is achievable in about 0.1 sec. We outline the extension of GWR-SINH method to regime-switching models and models with stochastic parameters and stochastic interest rates. ...

December 6, 2023 · 2 min · Research Team

Towards Sobolev Pruning

Towards Sobolev Pruning ArXiv ID: 2312.03510 “View on arXiv” Authors: Unknown Abstract The increasing use of stochastic models for describing complex phenomena warrants surrogate models that capture the reference model characteristics at a fraction of the computational cost, foregoing potentially expensive Monte Carlo simulation. The predominant approach of fitting a large neural network and then pruning it to a reduced size has commonly neglected shortcomings. The produced surrogate models often will not capture the sensitivities and uncertainties inherent in the original model. In particular, (higher-order) derivative information of such surrogates could differ drastically. Given a large enough network, we expect this derivative information to match. However, the pruned model will almost certainly not share this behavior. In this paper, we propose to find surrogate models by using sensitivity information throughout the learning and pruning process. We build on work using Interval Adjoint Significance Analysis for pruning and combine it with the recent advancements in Sobolev Training to accurately model the original sensitivity information in the pruned neural network based surrogate model. We experimentally underpin the method on an example of pricing a multidimensional Basket option modelled through a stochastic differential equation with Brownian motion. The proposed method is, however, not limited to the domain of quantitative finance, which was chosen as a case study for intuitive interpretations of the sensitivities. It serves as a foundation for building further surrogate modelling techniques considering sensitivity information. ...

December 6, 2023 · 2 min · Research Team

A generalization of the rational rough Heston approximation

A generalization of the rational rough Heston approximation ArXiv ID: 2310.09181 “View on arXiv” Authors: Unknown Abstract Previously, in [“GR19”], we derived a rational approximation of the solution of the rough Heston fractional ODE in the special case λ= 0, which corresponds to a pure power-law kernel. In this paper we extend this solution to the general case of the Mittag-Leffler kernel with λ\geq 0. We provide numerical evidence of the convergence of the solution. ...

October 13, 2023 · 1 min · Research Team

Enhancing accuracy for solving American CEV model with high-order compact scheme and adaptive time stepping

Enhancing accuracy for solving American CEV model with high-order compact scheme and adaptive time stepping ArXiv ID: 2309.03984 “View on arXiv” Authors: Unknown Abstract In this research work, we propose a high-order time adapted scheme for pricing a coupled system of fixed-free boundary constant elasticity of variance (CEV) model on both equidistant and locally refined space-grid. The performance of our method is substantially enhanced to improve irregularities in the model which are both inherent and induced. Furthermore, the system of coupled PDEs is strongly nonlinear and involves several time-dependent coefficients that include the first-order derivative of the early exercise boundary. These coefficients are approximated from a fourth-order analytical approximation which is derived using a regularized square-root function. The semi-discrete equation for the option value and delta sensitivity is obtained from a non-uniform fourth-order compact finite difference scheme. Fifth-order 5(4) Dormand-Prince time integration method is used to solve the coupled system of discrete equations. Enhancing the performance of our proposed method with local mesh refinement and adaptive strategies enables us to obtain highly accurate solution with very coarse space grids, hence reducing computational runtime substantially. We further verify the performance of our methodology as compared with some of the well-known and better-performing existing methods. ...

September 7, 2023 · 2 min · Research Team

Fourier Neural Network Approximation of Transition Densities in Finance

Fourier Neural Network Approximation of Transition Densities in Finance ArXiv ID: 2309.03966 “View on arXiv” Authors: Unknown Abstract This paper introduces FourNet, a novel single-layer feed-forward neural network (FFNN) method designed to approximate transition densities for which closed-form expressions of their Fourier transforms, i.e. characteristic functions, are available. A unique feature of FourNet lies in its use of a Gaussian activation function, enabling exact Fourier and inverse Fourier transformations and drawing analogies with the Gaussian mixture model. We mathematically establish FourNet’s capacity to approximate transition densities in the $L_2$-sense arbitrarily well with finite number of neurons. The parameters of FourNet are learned by minimizing a loss function derived from the known characteristic function and the Fourier transform of the FFNN, complemented by a strategic sampling approach to enhance training. We derive practical bounds for the $L_2$ estimation error and the potential pointwise loss of nonnegativity in FourNet for $d$-dimensions ($d\ge 1$), highlighting its robustness and applicability in practical settings. FourNet’s accuracy and versatility are demonstrated through a wide range of dynamics common in quantitative finance, including Lévy processes and the Heston stochastic volatility models-including those augmented with the self-exciting Queue-Hawkes jump process. ...

September 7, 2023 · 2 min · Research Team