SearcharxivSearch

arXiv subjects

Changqing Teng

Publications and source records attributed to Changqing Teng.

3 recordsLinked to original sources

Efficient Simulation and Calibration of the Rough Bergomi Model via Wasserstein Distance

Despite the empirical success of the rough Bergomi (rBergomi) model in modeling volatility dynamics, its practical use remains challenging due to high computational complexity in both pricing and calibration arising from its non-Markovian structure. To address these difficulties, we develop an efficient computational framework. First, we propose a modified-sum-of-exponentials (mSOE) Monte Carlo scheme within the class of hybrid multifactor approximations. The method combines an exact treatment of the singular kernel over the first time step with a sum-of-exponentials approximation over the remaining time interval, and exact Gaussian simulation of the resulting multifactor components. For a fixed number of exponential terms, the method maintains linear online complexity with respect to the number of time steps. It achieves high pricing accuracy in numerical experiments, particularly for out-of-the-money options. Second, building on this pricing engine, we formulate a calibration approach based on distributional matching of the terminal underlying asset via the Wasserstein-1 distance. Instead of fitting option prices only at selected strikes, this method compares model-generated and market-implied terminal distributions through the Kantorovich-Rubinstein dual representation. Numerical experiments indicate that the mSOE scheme exhibits stable convergence, and the Wasserstein-based calibration scheme improves parameter recovery, optimization stability, and out-of-sample performance relative to conventional MSE-based fitting in the rBergomi setting considered in this paper.

q-fin.CP

Unsupervised Learning-based Calibration Scheme for Rough Volatility Models

Existing deep learning-based calibration scheme for rough volatility models predominantly rely on supervised learning frameworks, which incur significant computational costs due to the necessity of generating massive synthetic training datasets. In this work, we propose a novel unsupervised learning-based calibration scheme for rough volatility models that eliminates the data generation bottleneck. Our approach leverages the backward stochastic differential equation (BSDE) representation of the pricing function derived by Bayer et al. \cite{bayer2022pricing}. By treating model parameters as trainable variables, we simultaneously approximate the BSDE solution and optimize the parameters within a unified neural network training process, with the terminal misfit as the loss. We theoretically establish that the mean squared error between the model-implied prices and market data is bounded by the loss function. Furthermore, we prove that the loss can be minimized to an arbitary degree, depending on the model's market fitting capacity and the universal approximation capability of neural networks. Numerical experiments for both simulated and historical S\&P 500 data based on rough Bergomi (rBergomi) model demonstrate the efficiency and accuracy of the proposed scheme.

q-fin.CP

Neural option pricing for rough Bergomi model

The rough Bergomi (rBergomi) model can accurately describe the historical and implied volatilities, and has gained much attention in the past few years. However, there are many hidden unknown parameters or even functions in the model. In this work, we investigate the potential of learning the forward variance curve in the rBergomi model using a neural SDE. To construct an efficient solver for the neural SDE, we propose a novel numerical scheme for simulating the volatility process using the modified summation of exponentials. Using the Wasserstein 1-distance to define the loss function, we show that the learned forward variance curve is capable of calibrating the price process of the underlying asset and the price of the European-style options simultaneously. Several numerical tests are provided to demonstrate its performance.

q-fin.CP