Metraipolis › archive › dc_4e9534e35a0e

Functional Tensor Trains for High-Order Greeks and Exposure Tails of Multi-Asset Structured Products — arXiv:2610.42119

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.42119
License (as archived)
CC0-1.0
Archived
2026-11-03T08:17:53.040Z
SHA-256 of the archived text
727c6c8abac458cebf77ee51322307edb84105e6b71f2a054e2e62a59d923f97
Stable URL of this page
https://metraipolis.com/documento/dc_4e9534e35a0e

How to cite

Functional Tensor Trains for High-Order Greeks and Exposure Tails of Multi-Asset Structured Products — arXiv:2610.42119 — arXiv (en), https://arxiv.org/abs/2610.42119 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4e9534e35a0e (Metraipolis archive dc_4e9534e35a0e, sha256 727c6c8abac458cebf77ee51322307edb84105e6b71f2a054e2e62a59d923f97)
BibTeX
@misc{dc4e9534e35a0e,
  title = {Functional Tensor Trains for High-Order Greeks and Exposure Tails of Multi-Asset Structured Products — arXiv:2610.42119},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.42119},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4e9534e35a0e; sha256 727c6c8abac458cebf77ee51322307edb84105e6b71f2a054e2e62a59d923f97},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.42119. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Risk management of worst-of autocallables needs price sensitivities (Greeks) up to third order and the potential future exposure, a tail quantile of the note's future value. In Monte Carlo, each order of differentiation multiplies the sampling noise by a factor that grows with the observation frequency, and nested simulation turns the noise of its inner paths into a bias of the quantile. We instead solve the backward pricing recursion, storing the continuation value as an $hp$ functional tensor train (hp-FTT) whose piecewise-polynomial cores are split at the barriers, so that worst-of barrier events act exactly, with rank one. For Gaussian transitions we show that the polynomial degree sufficient for an error $\varepsilon$ grows only as $\sqrt{\log(1/\varepsilon)}$. One solve then gives every Greek at any spot without sampling noise, by integrating the likelihood-ratio weight against the stored value, and the values it stores at future dates replace inner simulation. Against the strongest Monte Carlo estimators we could build or find published, on worst-of autocallables observed monthly on three to five assets, the order of the Greek and the accuracy decide which method is cheaper. At $1\%$ accuracy Monte Carlo is more than an order of magnitude cheaper for deltas, second-order Greeks go either way, and hp-FTT is cheaper for every third-order Greek, by up to two orders of magnitude. At $0.1\%$ hp-FTT is cheaper for every Greek we could check, under geometric Brownian motion and local volatility alike. For the exposure alone Monte Carlo is cheaper at $1\%$ and hp-FTT at $0.1\%$, and a solve run for the Greeks yields it for little more than scenario sampling. Sampling pays in variance for each derivative and hp-FTT in rank for each asset, so Monte Carlo keeps low-order Greeks at percent accuracy, rarely observed contracts and many assets.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Computational Finance (q-fin.CP) ; Numerical Analysis (math.NA); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.42119 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:08.788Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).