Metraipolis › archive › dc_d2c35fa05558

Latent-Space No-Arbitrage Geometry of Generative Models for Implied Volatility Surfaces — arXiv:2609.00332

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00332
License (as archived)
CC0-1.0
Archived
2026-10-17T06:33:11.655Z
SHA-256 of the archived text
7580412d5521d02192d46122ab6afbad4eb429895a3e8f5ce928b60e14029e8b
Stable URL of this page
https://metraipolis.com/documento/dc_d2c35fa05558

How to cite

Latent-Space No-Arbitrage Geometry of Generative Models for Implied Volatility Surfaces — arXiv:2609.00332 — arXiv (en), https://arxiv.org/abs/2609.00332 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d2c35fa05558 (Metraipolis archive dc_d2c35fa05558, sha256 7580412d5521d02192d46122ab6afbad4eb429895a3e8f5ce928b60e14029e8b)
BibTeX
@misc{dcd2c35fa05558,
  title = {Latent-Space No-Arbitrage Geometry of Generative Models for Implied Volatility Surfaces — arXiv:2609.00332},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00332},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d2c35fa05558; sha256 7580412d5521d02192d46122ab6afbad4eb429895a3e8f5ce928b60e14029e8b},
  year = {2026}
}

Archived text

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

Generative models for implied volatility surfaces must produce outputs that satisfy static no-arbitrage constraints. We study these constraints in latent space. For a fixed generator, we assign each latent code a scalar margin determined by the no-arbitrage conditions of the generated surface. The codes with nonnegative margin form the admissible latent set. We establish conditions under which strictly admissible codes remain admissible under small perturbations and the boundary of the admissible set is characterized by zero margin. For regular boundary components, we formulate a level-set equation whose local dynamics are directed toward the zero-margin set. The analysis treats the generator as a map from latent variables to surfaces and is therefore not restricted to a particular architecture. It applies to variational autoencoders, generative adversarial networks, and other generative models with a deterministic realization map. Numerical tests recover known boundaries in analytic examples. Experiments with a variational autoencoder trained on Heston surfaces show that similar reconstruction errors can correspond to different admissible regions and that the latent prior may be concentrated inside such a region. The computed boundary can also be used to modify latent codes that generate violating surfaces.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-02 in cs.AI).
Categorie arXiv: Computational Finance (q-fin.CP) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.00332 — 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-10-17T06:15:12.771Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).