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

• URL: http://arxiv.org/abs/2609.00332v1
• Date: Mon, 31 Aug 2026 20:27:40 GMT
• Title: Latent-Space No-Arbitrage Geometry of Generative Models for Implied Volatility Surfaces
• Abstract summary: Generative models for implied volatility surfaces must produce outputs that satisfy static no-arbitrage constraints.<n>For a fixed generator, we assign each latent code a scalar margin determined by the no-arbitrage conditions of the generated surface.<n>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.
• Score: 1.8352395597748326
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Across the Loss Landscape with Progressive Growth [51.366966420881646]
  We show how grow-and-optimize strategies to train toward flatter regions by viewing growth as progressive relaxation.<n>We empirically validate these predictions in controlled toy basins and in a realistic ResNet/CI-100 setting.<n>Although progressive subspace growth reliably produces flatter solutions, curvature reductions do not universally translate into improved test performance, highlighting subtleties in the flatness-generalization connection.
  arXiv  Detail & Related papers  (2026-08-25T13:50:48Z)
• Neuro-Symbolic Closed-Loop Control of Laser Powder Bed Fusion with an In-Loop Ontology [0.28675177318965045]
  A geometry-conditioned, neuro-symbolic closed-loop architecture is proposed for laser powder bed fusion.<n>A standards-aligned ontology operates inside the control loop and couples symbolic reasoning with statistical learning to set the targets of a constraint-aware predictive controller.<n>The architecture eliminates the dross produced by a geometry-blind controller, holds dross at zero with only a small residual lack-of-fusion under dual scoring.
  arXiv  Detail & Related papers  (2026-08-06T09:05:38Z)
• Rethinking Structural Anomaly Detection: From Decision Boundaries to Projection Operators [51.771100367755544]
  We introduce a geometric perspective to address the mismatch between the inductive bias of existing methods and the structure of the data.<n>Specifically, we learn a projection operator onto the manifold of normal samples and define a sample as anomalous if it is altered by this projection.<n> Notably, it provides a unifying interpretation of reconstruction-based methods by explaining their success and failure in terms of projection quality.
  arXiv  Detail & Related papers  (2026-06-13T12:37:20Z)
• Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
  We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
  arXiv  Detail & Related papers  (2026-06-01T18:28:56Z)
• Primal-Dual Guided Decoding for Constrained Discrete Diffusion [5.219025684249083]
  We propose primal-dual guided decoding, an inference-time method that formulates constrained generation as a KL-regularised optimisation problem.<n>At each denoising step, the method modifies token logits through an additive, constraint-dependent bias, with multipliers updated by mirror descent based on constraint violation.<n>We evaluate our approach on topical text generation, molecular design, and music playlist generation, showing that a single algorithm instantiated via domain-specific scoring functions improves constraint satisfaction while preserving relevant domain-specific quality metrics.
  arXiv  Detail & Related papers  (2026-05-10T20:55:19Z)
• Inpainting physics: self-supervised learning for context-driven fluid simulation [2.1529676354218674]
  We propose to reformulate steady CFD inference as context-conditioned inpainting.<n>Instead of training on explicit boundary conditions, we learn a self-supervised prior over velocity fields.<n>On intracranial aneurysm hemodynamics, our method reconstructs full velocity fields from sparse boundary context.
  arXiv  Detail & Related papers  (2026-05-09T09:37:34Z)
• UVTran: Accurate Hole-Filling Parameterization with Transformers [5.131212158757835]
  In industrial design, N-sided hole filling is typically formulated as the construction of a single trimmed B-spline surface.<n>We propose UVTran, a transformer-based framework that predicts an auxiliary projection surface better to capture the geometric characteristics of the hole boundary.
  arXiv  Detail & Related papers  (2026-04-27T14:12:03Z)
• Exact Constraint Enforcement in Physics-Informed Extreme Learning Machines using Null-Space Projection Framework [0.0]
  This work introduces Null-Space Projected PIELM, achieving exact constraint enforcement through algebraic projection in coefficient space.<n>NP-PIELM exploits the geometric structure of the admissible coefficient manifold, recognizing that it admits a decomposition through the null space of the boundary operator.<n>This eliminates penalty coefficients, dual variables, and problem-specific constructions while preserving single-shot training efficiency.
  arXiv  Detail & Related papers  (2026-01-16T05:18:56Z)
• Constrained Discrete Diffusion [61.81569616239755]
  This paper introduces Constrained Discrete Diffusion (CDD), a novel integration of differentiable constraint optimization within the diffusion process.<n>CDD directly imposes constraints into the discrete diffusion sampling process, resulting in a training-free and effective approach.
  arXiv  Detail & Related papers  (2025-03-12T19:48:12Z)
• Thinner Latent Spaces: Detecting Dimension and Imposing Invariance with Conformal Autoencoders [8.743941823307967]
  We show that orthogonality relations within the latent layer of the network can be leveraged to infer the intrinsic dimensionality of nonlinear manifold data sets.<n>We outline the relevant theory relying on differential geometry, and describe the corresponding gradient-descent optimization algorithm.
  arXiv  Detail & Related papers  (2024-08-28T20:56:35Z)
• Constrained Synthesis with Projected Diffusion Models [47.56192362295252]
  This paper introduces an approach to generative diffusion processes the ability to satisfy and certify compliance with constraints and physical principles. The proposed method recast the traditional process of generative diffusion as a constrained distribution problem to ensure adherence to constraints.
  arXiv  Detail & Related papers  (2024-02-05T22:18:16Z)
• On the Forward Invariance of Neural ODEs [92.07281135902922]
  We propose a new method to ensure neural ordinary differential equations (ODEs) satisfy output specifications. Our approach uses a class of control barrier functions to transform output specifications into constraints on the parameters and inputs of the learning system.
  arXiv  Detail & Related papers  (2022-10-10T15:18:28Z)
• Attribute-Guided Adversarial Training for Robustness to Natural Perturbations [64.35805267250682]
  We propose an adversarial training approach which learns to generate new samples so as to maximize exposure of the classifier to the attributes-space. Our approach enables deep neural networks to be robust against a wide range of naturally occurring perturbations.
  arXiv  Detail & Related papers  (2020-12-03T10:17:30Z)
• Identification of Probability weighted ARX models with arbitrary domains [75.91002178647165]
  PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX) The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field.
  arXiv  Detail & Related papers  (2020-09-29T12:50:33Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.