arXiv AI

Latent-Space No-Arbitrage Geometry of Generative Models for Implied Volatility Surfaces

The paper investigates how generative models for implied volatility surfaces must respect static no‑arbitrage constraints. By mapping latent codes to surfaces, it defines a scalar margin for each code and identifies the admissible latent set where this margin is nonnegative. The authors prove that admissible codes remain admissible under small perturbations, characterize the boundary via a zero‑margin condition, and derive a level‑set equation guiding dynamics toward this boundary. The framework applies broadly to models such as variational autoencoders and GANs, and numerical experiments confirm known boundaries in analytic examples and demonstrate how the boundary can correct violating latent codes.

arXiv Machine Learning
Jul 28

Beyond ICA: Identifiability by Symmetry Breaking

arXiv:2607. 23182v1 Announce Type: cross Abstract: We prove the identifiability of deep generative models (DGMs) with piecewise-affine (PWA) decoders and Gaussian mixture model (GMM) priors, in a purely unsupervised setting.

By Pengzhou Wu
arXiv Machine Learning
Oct 2

Manifold-Aware Perturbations for Constrained Generative Modeling

The paper introduces a new method for perturbing data distributions in a way that respects equality constraints, allowing generative models to better handle constrained data. By adjusting the distribution while preserving the manifold geometry, the approach ensures support matches the ambient space dimension. Experiments with diffusion models and normalizing flows demonstrate improved data recovery and stable sampling across several tasks.

By Katherine Keegan, Lars Ruthotto