Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.16407

Dynamic Hedging using Generated Genetic Programming Implied Volatility Models

Fathi Abid·Wafa Abdelmalek·Sana Ben Hamida
View original source ↗Read source document ↗Export metadata ↓

Abstract

The purpose of this paper is to improve the accuracy of dynamic hedging using implied volatilities generated by genetic programming. Using real data from S&P500 index options, the genetic programming's ability to forecast Black and Scholes implied volatility is compared between static and dynamic training-subset selection methods. The performance of the best generated GP implied volatilities is tested in dynamic hedging and compared with Black-Scholes model. Based on MSE total, the dynamic training of GP yields better results than those obtained from static training with fixed samples. According to hedging errors, the GP model is more accurate almost in all hedging strategies than the BS model, particularly for in-the-money call options and at-the-money put options.

Explore related subjects

q-fin.CPcs.CE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fathi Abid, Wafa Abdelmalek, Sana Ben Hamida. 2020-06-29. Dynamic Hedging using Generated Genetic Programming Implied Volatility Models. https://doi.org/10.5772/48148

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Unbiased Monte Carlo Greeks for Discontinuous Payoffs

Pathwise differentiation of Monte Carlo estimators fails at payoff discontinuities, producing zero or biased sensitivities for barriers, autocallables, and digital options. The industry workaround --- smoothing the indicator functions --- introduces bias and requires per-product calibration. We derive a correction formula that restores unbiased Greeks without smoothing. For a payoff $F(Z,\theta)$ that is piecewise smooth with discontinuities on surfaces $\{g_i = 0\}$, we show that the sensitivity decomposes into a pathwise term (computed by standard AAD) plus a sum of boundary corrections, each involving the payoff jump, the Gaussian density at the boundary, and the sensitivity of the boundary to the parameter. The correction is computed by Newton root-finding in the normal-random space, with the jump evaluated by two forward replays of the pricing kernel. The implementation uses AADC (\texttt{pip install aadc}), whose tape replay and automatic discontinuity tracking make the method fully automatic --- the quant writes standard pricing code, and the correction driver identifies and handles all discontinuities. We prove the formula for arbitrary compositions of smooth functions and indicator functions (not just outer products), covering real autocallable payoff structures with recursive alive/dead logic. Benchmarks on QuantLib models (GBM, Heston, Hull-White) show all Greeks within 0.1--4\% of analytic or bump-and-revalue references.

q-fin.CP↗
arXiv2026

Fast and explicit European option pricing under tempered stable processes

We provide series expansions for the tempered stable densities and for the price of European-style contracts in the exponential Lévy model driven by the tempered stable process. These formulas recover several popular option pricing models, and become particularly simple in some specific cases such as bilateral Gamma process and one-sided TS process. When compared to traditional Fourier pricing, our method has the advantage of not involving delicate choices of hyperparameters, but only a truncation order for the resulting analytical pricing formulas. We also provide a detailed numerical analysis and show that our technique is competitive with state-of-the-art pricing methods.

q-fin.CP↗
arXiv2026

Rethinking Synthetic Scenario Realism: Compatibility, Not Fidelity, Drives Hedging Performance

Deep hedging is a data-driven approach to learn hedging strategies. It relies on synthetic price paths generator, as real market data is often limited for training. Existing approaches primarily evaluate such generators based on realism, i.e., how well they capture statistical properties of real markets, but the relationship between realism and hedging performance remains unclear. In this work, we introduce a decision-centric perspective on synthetic data for deep hedging based on the notion of compatibility. Compatibility measures the extent to which strategies trained on synthetic scenarios remain effective in the true market. We theoretically show that 1) hedging performance decomposes into learning error and a compatibility gap, and 2) realism and compatibility can diverge. Empirically, we find that hedging performance is governed not by realism alone, but by the alignment between the generator and the hedger, together with task structure. Taken together, this work provides a principled basis for designing synthetic data in finance aligned with decision tasks.

q-fin.CP↗