false

Almost-Exact Simulation Scheme for Heston-type Models: Bermudan and American Option Pricing

Almost-Exact Simulation Scheme for Heston-type Models: Bermudan and American Option Pricing ArXiv ID: 2601.00815 “View on arXiv” Authors: Mara Kalicanin Dimitrov, Marko Dimitrov, Anatoliy Malyarenko, Ying Ni Abstract Recently, an Almost-Exact Simulation (AES) scheme was introduced for the Heston stochastic volatility model and tested for European option pricing. This paper extends this scheme for pricing Bermudan and American options under both Heston and double Heston models. The AES improves Monte Carlo simulation efficiency by using the non-central chi-square distribution for the variance process. We derive the AES scheme for the double Heston model and compare the performance of the AES schemes under both models with the Euler scheme. Our numerical experiments validate the effectiveness of the AES scheme in providing accurate option prices with reduced computational time, highlighting its robustness for both models. In particular, the AES achieves higher accuracy and computational efficiency when the number of simulation steps matches the exercise dates for Bermudan options. ...

December 22, 2025 · 2 min · Research Team

Heston vol-of-vol and the VVIX

Heston vol-of-vol and the VVIX ArXiv ID: 2512.19611 “View on arXiv” Authors: Jherek Healy Abstract The Heston stochastic volatility model is arguably, the most popular stochastic volatility model used to price and risk manage exotic derivatives. In spite of this, it is not necessarily easy to calibrate to the market and obtain stable exotic option prices with this model. This paper focuses on the vol-of-vol parameter and its relation with the volatility of volatility index (VVIX) level. Four different approaches to estimate the VVIX in the Heston model are presented: two based on the known transition density of the variance, one analytical approximation, and one based on the Heston PDE which computes the value directly out of the underlying SPX500. Finally we explore their use to improve calibration stability. ...

December 22, 2025 · 2 min · Research Team

How to choose my stochastic volatility parameters? A review

How to choose my stochastic volatility parameters? A review ArXiv ID: 2512.19821 “View on arXiv” Authors: Fabien Le Floc’h Abstract Based on the existing literature, this article presents the different ways of choosing the parameters of stochastic volatility models in general, in the context of pricing financial derivative contracts. This includes the use of stochastic volatility inside stochastic local volatility models. Keywords: Stochastic Volatility, Local Volatility, Derivatives Pricing, Parameter Estimation, Volatility Modeling, Equity Derivatives ...

December 22, 2025 · 1 min · Research Team

Convolution-FFT for option pricing in the Heston model

Convolution-FFT for option pricing in the Heston model ArXiv ID: 2512.05326 “View on arXiv” Authors: Xiang Gao, Cody Hyndman Abstract We propose a convolution-FFT method for pricing European options under the Heston model that leverages a continuously differentiable representation of the joint characteristic function. Unlike existing Fourier-based methods that rely on branch-cut adjustments or empirically tuned damping parameters, our approach yields a stable integrand even under large frequency oscillations. Crucially, we derive fully analytical error bounds that quantify both truncation error and discretization error in terms of model parameters and grid settings. To the best of our knowledge, this is the first work to provide such explicit, closed-form error estimates for an FFT-based convolution method specialized to the Heston model. Numerical experiments confirm the theoretical rates and illustrate robust, high-accuracy option pricing at modest computational cost. ...

December 5, 2025 · 2 min · Research Team

Efficient simulation of prices for European call options under Heston stochastic-local volatility model: a comparison of methods

Efficient simulation of prices for European call options under Heston stochastic-local volatility model: a comparison of methods ArXiv ID: 2509.24449 “View on arXiv” Authors: Meng cai, Tianze Li Abstract The Heston stochastic-local volatility model, consisting of a asset price process and a Cox–Ingersoll–Ross-type variance process, offers a wide range of applications in the financial industry. The pursuit for efficient model evaluation has been assiduously ongoing and central to which is the numerical simulation of CIR process. Different from the weakly convergent noncentral chi-squared approximation used in 25, this paper considers two strongly convergent and positivity-preserving methods for CIR process under Lamperti transformation, namely, the truncated Euler method and the backward Euler method. It should be noted that these two methods are completely different. The explicit truncated Euler method is computationally effective and remains robust under high volatility, while the implicit backward Euler method provides high computational accuracy and stable performance. Numerical experiments on European call options are presented to show the superiority of different methods. ...

September 29, 2025 · 2 min · Research Team

Meta-Learning Neural Process for Implied Volatility Surfaces with SABR-induced Priors

Meta-Learning Neural Process for Implied Volatility Surfaces with SABR-induced Priors ArXiv ID: 2509.11928 “View on arXiv” Authors: Jirong Zhuang, Xuan Wu Abstract We treat implied volatility surface (IVS) reconstruction as a learning problem guided by two principles. First, we adopt a meta-learning view that trains across trading days to learn a procedure that maps sparse option quotes to a full IVS via conditional prediction, avoiding per-day calibration at test time. Second, we impose a structural prior via transfer learning: pre-train on SABR-generated dataset to encode geometric prior, then fine-tune on historical market dataset to align with empirical patterns. We implement both principles in a single attention-based Neural Process (Volatility Neural Process, VolNP) that produces a complete IVS from a sparse context set in one forward pass. On SPX options, the VolNP outperforms SABR, SSVI, and Gaussian process. Relative to an ablation trained only on market data, the SABR-induced prior reduces RMSE by about 40% and suppresses large errors, with pronounced gains at long maturities where quotes are sparse. The resulting model is fast (single pass), stable (no daily recalibration), and practical for deployment at scale. ...

September 15, 2025 · 3 min · Research Team

Fast reliable pricing and calibration of the rough Heston model

Fast reliable pricing and calibration of the rough Heston model ArXiv ID: 2508.15080 “View on arXiv” Authors: Svetlana Boyarchenko, Marco de Innocentis, Sergei Levendorskiĭ Abstract The paper is an extended and modified version of the preprint S.Boyarchenko and S.Levendorskiĭ Correct implied volatility shapes and reliable pricing in the rough Heston model". We combine a modification of the Adams method with the SINH-acceleration method S.Boyarchenko and S.Levendorskii (IJTAF 2019, v.22) of Fourier inversion (iFT) to price vanilla options under the rough Heston model. For moderate or long maturities and strikes near spot, thousands of prices are computed in several milliseconds (ms) in Matlab on a Mac with moderate specs, with relative errors $\lesssim 10^{"-4"}$. Even for options close to expiry and far-OTM, the pricing takes a few tens or hundreds of ms. We show that, for the calibrated parameters in El Euch and Rosenbaum (Math.Finance 2019, v.29), the model implied vol surface is much flatter and fits the market data poorly; thus the calibration in op.cit. is a case of ghost calibration’’ (M.Boyarchenko and S.Levendorskiĭ, Quant. Finance 2015, v.15): numerical error and model specification error offset each other, creating an apparently good fit that vanishes when a more accurate pricer is used. We explain how such errors arise in popular iFT implementations that use fixed numerical parameters, yielding spurious smiles/skews, and provide numerical evidence that SINH acceleration is faster and more accurate than competing methods. Robust error control is ensured by a general Conformal Bootstrap principle that we formulate; the principle is applicable to many Fourier-pricing methods. We outline how this principle and our method enable accurate calibration procedures that are hundreds of times faster than approaches commonly used in the industry. Disclaimer: The views expressed herein are those of the authors only. No other representation should be attributed. ...

August 20, 2025 · 3 min · Research Team

Time Deep Gradient Flow Method for pricing American options

Time Deep Gradient Flow Method for pricing American options ArXiv ID: 2507.17606 “View on arXiv” Authors: Jasper Rou Abstract In this research, we explore neural network-based methods for pricing multidimensional American put options under the BlackScholes and Heston model, extending up to five dimensions. We focus on two approaches: the Time Deep Gradient Flow (TDGF) method and the Deep Galerkin Method (DGM). We extend the TDGF method to handle the free-boundary partial differential equation inherent in American options. We carefully design the sampling strategy during training to enhance performance. Both TDGF and DGM achieve high accuracy while outperforming conventional Monte Carlo methods in terms of computational speed. In particular, TDGF tends to be faster during training than DGM. ...

July 23, 2025 · 2 min · Research Team

Monte-Carlo Option Pricing in Quantum Parallel

Monte-Carlo Option Pricing in Quantum Parallel ArXiv ID: 2505.09459 “View on arXiv” Authors: Robert Scriba, Yuying Li, Jingbo B Wang Abstract Financial derivative pricing is a significant challenge in finance, involving the valuation of instruments like options based on underlying assets. While some cases have simple solutions, many require complex classical computational methods like Monte Carlo simulations and numerical techniques. However, as derivative complexities increase, these methods face limitations in computational power. Cases involving Non-Vanilla Basket pricing, American Options, and derivative portfolio risk analysis need extensive computations in higher-dimensional spaces, posing challenges for classical computers. Quantum computing presents a promising avenue by harnessing quantum superposition and entanglement, allowing the handling of high-dimensional spaces effectively. In this paper, we introduce a self-contained and all-encompassing quantum algorithm that operates without reliance on oracles or presumptions. More specifically, we develop an effective stochastic method for simulating exponentially many potential asset paths in quantum parallel, leading to a highly accurate final distribution of stock prices. Furthermore, we demonstrate how this algorithm can be extended to price more complex options and analyze risk within derivative portfolios. ...

May 14, 2025 · 2 min · Research Team

Deep Reinforcement Learning Algorithms for Option Hedging

Deep Reinforcement Learning Algorithms for Option Hedging ArXiv ID: 2504.05521 “View on arXiv” Authors: Unknown Abstract Dynamic hedging is a financial strategy that consists in periodically transacting one or multiple financial assets to offset the risk associated with a correlated liability. Deep Reinforcement Learning (DRL) algorithms have been used to find optimal solutions to dynamic hedging problems by framing them as sequential decision-making problems. However, most previous work assesses the performance of only one or two DRL algorithms, making an objective comparison across algorithms difficult. In this paper, we compare the performance of eight DRL algorithms in the context of dynamic hedging; Monte Carlo Policy Gradient (MCPG), Proximal Policy Optimization (PPO), along with four variants of Deep Q-Learning (DQL) and two variants of Deep Deterministic Policy Gradient (DDPG). Two of these variants represent a novel application to the task of dynamic hedging. In our experiments, we use the Black-Scholes delta hedge as a baseline and simulate the dataset using a GJR-GARCH(1,1) model. Results show that MCPG, followed by PPO, obtain the best performance in terms of the root semi-quadratic penalty. Moreover, MCPG is the only algorithm to outperform the Black-Scholes delta hedge baseline with the allotted computational budget, possibly due to the sparsity of rewards in our environment. ...

April 7, 2025 · 2 min · Research Team