Paper: arXiv 2512.00448
Authors: Changqing Teng, Guanglian Li
Abstract
Despite the empirical success in modeling volatility of the rough Bergomi (rBergomi) model, it suffers from pricing and calibration difficulties stemming from its non-Markovian structure. To address this, we propose a comprehensive computational framework that enhances both simulation and calibration. First, we develop a modified Sum-of-Exponentials (mSOE) Monte Carlo scheme which hybridizes an exact simulation of the singular kernel near the origin with a multi-factor approximation for the remainder. This method achieves high accuracy, particularly for out-of-the-money options, with an \(\mathcal{“O”}(n)\) computational cost. Second, based on this efficient pricing engine, we then propose a distribution-matching calibration scheme by using Wasserstein distance as the optimization objective. This leverages a minimax formulation against Lipschitz payoffs, which effectively distributes pricing errors and improving robustness. Our numerical results confirm the mSOE scheme’s convergence and demonstrate that the calibration algorithm reliably identifies model parameters and generalizes well to path-dependent options, which offers a powerful and generic tool for practical model fitting.
Complexity vs Empirical Score
- Math Complexity: 8.0/10
- Empirical Rigor: 6.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper presents a sophisticated, non-Markovian model (rBergomi) with advanced mathematical techniques like fractional Brownian motion and Wasserstein distance optimization, requiring a high math score. It includes explicit numerical validation and an open-source GitHub repository, indicating strong empirical implementation and data-driven results, warranting a high rigor score.
Research Flowchart
flowchart TD A["Research Goal<br>Efficient Calibration in rBergomi"] --> B["Methodology Step 1<br>Modified Sum-of-Exponentials mSOE Scheme"] A --> C["Methodology Step 2<br>Wasserstein Calibration via Distribution Matching"] B --> D["Computational Process<br>Hybrid Monte Carlo Simulation<br>Exact Singular Kernel + Multi-Factor Approximation"] C --> E["Computational Process<br>Minimax Optimization<br>Minimizing Pricing Errors via Lipschitz Payoffs"] D --> F["Key Outcomes"] E --> F F --> G["High Accuracy Pricing<br>O(n) Cost, especially OTM Options"] F --> H["Robust Calibration<br>Reliable Parameter ID & Path-Dependent Option Generalization"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a modified sum-of-exponentials Monte Carlo scheme for the rough Bergomi model and a calibration method based on Wasserstein-1 distance.
Source sentence
First, we propose a modified-sum-of-exponentials (mSOE) Monte Carlo scheme within the class of hybrid multifactor approximations.
Assumes 3
- Interest rate is zero and the initial variance curve ξ0(t) is bounded and bounded away from zero. model
Source sentence
Without loss of generality, we assume interest rate r = 0 and ξ0(t) is bounded on [0, T], and bounded away from 0.
- Zero interest rate is assumed for the pricing error bound. model
Source sentence
For simplicity, assume a zero interest rate.
- The singular kernel is treated exactly only on the first time step. model
Source sentence
We keep the kernel exact only on the first time step, which is sufficient to preserve the local singular behavior while keeping the construction simple
Data
- Oracle target distributions (synthetic) synthetic unknown
Source sentence
"W1-Direct" denotes Wasserstein calibration using the oracle target distributions.
Costs
Not applicable
Finds 4
- The mSOE pricing engine achieves stable convergence and high accuracy, especially for out-of-the-money options. pricing-calibration
Source sentence
The resulting pricing engine achieves stable convergence and high accuracy, particularly for out-of-the-money options.
- Wasserstein-1 based calibration consistently yields more accurate in- and out-of-sample results than MSE-based calibration. performance
Source sentence
As evidenced in Table 7, the calibration based on the Wasserstein-1 distance consistently yields more accurate results than the MSE-based calibration.
- Wasserstein calibration produces uniformly smaller parameter errors across all cases compared to MSE calibration. statistical
Source sentence
The Wasserstein-based calibration exhibits consistently smaller parameter errors for all four parameters in every parameter case.
- Barrier option prices from Wasserstein-calibrated parameters are nearly indistinguishable from benchmark prices and stay within confidence bands. pricing-calibration
Source sentence
the pricing curves generated by Wasserstein-calibrated parameters (red) are nearly indistinguishable from the benchmark across all maturities and barrier levels
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 58 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (41)
- Strong convergence rates for M arkovian representations of fractional B rownian motion (2019) — link
- Markovian approximation of the rough B ergomi model for M onte C arlo option pricing (2021)
- Deep calibration with random grids — → 2306.11061
- Pricing under rough volatility (2016)
- Volatility is rough (2022)
- Markovian approximations of stochastic Volterra equations with the fractional kernel (2023)
- On VIX futures in the rough B ergomi model (2018)
- A pproximation of 1/x by exponential sums in [1,$\infty$) (2005)
and 33 more
- Neural SDEs as infinite-dimensional GANs (2021)
- Neural options pricing (2021)
- Hybrid scheme for Brownian semistationary processes (2017)
- Fractional Brownian motion and the Markov property (1998)
- Fractional Brownian motions, fractional noises and applications (1968)
- Learning fractional white noises in neural stochastic differential equations (2022)
- Multifactor approximation of rough volatility models (2019)
- Nonlinear approximation theory (2012)
- Hybrid multifactor scheme for stochastic V olterra equations with completely monotone kernels (2022)
- Topics in optimal transportation (2021)
- Adam: A Method for Stochastic Optimization (2015)
- Completely monotonic functions (2001)
- Weak M arkovian approximations of rough H eston — → 2309.07023
- Deep learning volatility: a deep neural network perspective on pricing and calibration in (rough) volatility models (2021)
- Parsimonious modeling of yield curves (1987)
- Pathwise versions of the Burkholder–Davis–Gundy inequality (2015)
- Markov processes over denumerable products of spaces, describing large systems of automata (1969)
- Calculation of the Wasserstein distance between probability distributions on the line (1974)
- Why the 1- W asserstein distance is the area between the two marginal CDFs (2021) — link
- Risk-neutral densities: A review (2018)
- On the martingale property in the rough B ergomi model (2019)
- Weak error rates for option pricing under linear rough volatility (2022)
- Fast evaluation of the C aputo fractional derivative and its applications to fractional diffusion equations (2017)
- A generative adversarial network approach to calibration of local stochastic volatility models (2020)
- TensorFlow: a system for Large-Scale machine learning (2016)
- Weak error estimates for rough volatility models — → 2212.01591
- Gaussian stochastic volatility models: Scaling regimes, large deviations, and moment explosions (2020)
- A neural network-based framework for financial model calibration (2019)
- Arbitrage-free SVI volatility surfaces (2014)
- Gaussian measures (1998)
- A parsimonious arbitrage-free implied volatility parameterization with application to the valuation of volatility derivatives (2004)
- A limited memory algorithm for bound constrained optimization (1995)
- Algorithm 778: L-BFGS-B : Fortran subroutines for large-scale bound-constrained optimization (1997)
3 of 41 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.