Paper: arXiv 2511.09175

Authors: Jian’an Zhang

Abstract

We study the construction of SPX–VIX (multi\textendash product) option surfaces that are simultaneously free of static arbitrage and dynamically chain\textendash consistent across maturities. Our method unifies \emph{“constructive”} PCA–Smolyak approximation and a \emph{“chain\textendash consistent”} diffusion model with a tri\textendash marginal, martingale\textendash constrained entropic OT (c\textendash EMOT) bridge on a single yardstick \(\LtwoW\). We provide \emph{“computable certificates”} with explicit constant dependence: a strong\textendash convexity lower bound \(\muhat\) controlled by the whitened kernel Gram’s \(λ_{"\min"}\), the entropic strength \(\varepsilon\), and a martingale\textendash moment radius; solver correctness via \(\KKT\) and geometric decay \(\rgeo\); and a \(1\)-Lipschitz metric projection guaranteeing Dupire/Greeks stability. Finally, we report an end\textendash to\textendash end \emph{“log\textendash additive”} risk bound \(\RiskTotal\) and a \emph{“Gate\textendash V2”} decision protocol that uses tolerance bands (from \(α\)\textendash mixing concentration) and tail\textendash robust summaries, under which all tests \emph{“pass”}: for example \(\KKT=\CTwoKKT\ (\le 4!!\times!10^{"-2"})\), \(\rgeo=\CTworgeo\ (\le 1.05)\), empirical Lipschitz \(\CThreelipemp!\le!1.01\), and Dupire nonincrease certificate \(=\texttt{“True”}\).

Complexity vs Empirical Score

  • Math Complexity: 9.2/10
  • Empirical Rigor: 8.5/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper employs advanced mathematics including multi-marginal entropic optimal transport, PCA-Smolyak approximation, and functional analysis, while providing detailed empirical metrics (KKT residuals, Lipschitz bounds, Dupire certificates) and an end-to-end risk bound.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Construct Arbitrage-Free & Chain-Consistent<br>SPX-VIX Surfaces"] --> B["Key Methodology:<br>Unify PCA-Smolyak &<br>c-EMOT Transport"]
  B --> C["Data/Inputs:<br>SPX/VIX Market Prices &<br>Yardstick L2W Distance"]
  C --> D["Computational Process:<br>Solve Proximal Gradients<br>w/ Martingale Constraints"]
  D --> E["Key Findings/Outcomes"]
  E --> F["Certificates:<br>KKT ≤ 4e-2, r_geo ≤ 1.05"]
  E --> G["Stability:<br>Lipschitz ≤ 1.01 &<br>Dupire Non-Increase"]
  E --> H["Protocol:<br>Gate-V2 Decision Passes<br>(Log-Additive Risk Bound)"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes an auditable, end‑to‑end pipeline that combines constructive PCA‑Smolyak approximation, a chain‑consistent diffusion model, and a multi‑marginal c‑EMOT routine within a unified L2(W) geometry.

Source sentence
We propose an auditable, end-to-end pipeline in the single geometry L2(W), whose components are designed to compose both algorithmically and statistically:

Assumes 4

  • The target function belongs to a mixed‑smoothness Sobolev space and the weight function is bounded away from zero and infinity. model
    Source sentence
    Assume g∗∈H(βK,βτ )mix(Ω) with βK, βτ ∈N, and let the weight w satisfy 0 < wmin ≤w(x) ≤wmax < ∞for all x ∈Ω⊂R2.
  • Static no‑arbitrage constraints are enforced on a fixed strike‑maturity grid. market
    Source sentence
    ARBITER addresses static no-arbitrage on a fixed grid and VIX2 consistency via the discretization in Sec.
  • All distances, projections and certificates are measured in the L2(W) norm weighted by vega. statistical
    Source sentence
    Unless stated otherwise, all distances, projections and certificates are measured in L2(W).
  • The synthetic market generator produces coupled SPX–VIX dynamics under the risk‑neutral measure Q. other
    Source sentence
    To test external validity under controlled ground truth, we simulate coupled SPX–VIX dynamics under Q.

Data

  • Option price grid options unknown
    Source sentence
    The dataset provides option prices (or implied volatilities mapped to prices) on the (K, τ) grid.
  • Synthetic SPX–VIX market generator synthetic proprietary
    Source sentence
    To test external validity under controlled ground truth, we simulate coupled SPX–VIX dynamics under Q.

Costs

Not applicable The paper reports no trading or execution result.

Finds 2

  • All certificates and thresholded tests pass under the Gate‑V2 protocol, with reproducible results across twelve audited figures. theoretical
    Source sentence
    all certificates and thresholded tests PASS and are reproducible, as evidenced by the twelve audited figures (Sec. 9).
  • Key numerical certificates meet the prescribed tolerances: KKT ≤ 4×10⁻², geometric decay rgeo ≤ 1.05, empirical Lipschitz constant ≤ 1.01, and Dupire non‑increase certificate true. statistical
    Source sentence
    ≤1.01, and Dupire nonincrease certificate =\texttt{True}.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 10 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (102)

  1. Fourier Neural Operator for Parametric Partial Differential Equations (2021)
  2. Neural Operator: Learning Maps Between Function Spaces (2023)
  3. Learning Nonlinear Operators via DeepONet Based on the Universal Approximation Theorem of Operators (2021)
  4. Sparse Grids and Applications—A Survey (2013)
  5. Sparse Polynomial Approximation of Parametric Elliptic PDEs (2016)
  6. Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems (2019)
  7. Low-Rank Sinkhorn Factorization (2021)
  8. Stabilized and Differentiable Sinkhorn Divergences (2021)
and 94 more
  1. On the Convergence of Sinkhorn’s Algorithm (2021)
  2. A Multi-Marginal Martingale Optimal Transport Approach to Joint Calibration of S&P and VIX Options (2024) — link
  3. Dispersion-Constrained Martingale Schr "o dinger Problems and the Exact Joint S&P 500 / VIX Smile Calibration Puzzle (2024)
  4. Score-Based Generative Modeling Through Stochastic Differential Equations (2021)
  5. Elucidating the Design Space of Diffusion-Based Generative Models (2022)
  6. Flow Matching for Generative Modeling (2023)
  7. Flow Straight and Fast: Learning to Rectify Flow for Probabilistic Generative Modeling (2022)
  8. Diffusion Schr "o dinger Bridge with Applications to Score-Based Generative Modeling (2021)
  9. Diffusion Schr "o dinger Bridge Matching (2023) — link
  10. Entropic Martingale Optimal Transport and Schr "o dinger Problems (2021) — link
  11. Tractable Approximations of Optimal Transport via Sinkhorn (2022)
  12. A Kernel Two-Sample Test (2012)
  13. A Kernel Test of Goodness of Fit (2015)
  14. A Signature-Based Model for Joint Dynamics of S&P 500 and VIX Options (2023)
  15. A Quintic OU Volatility Model with VIX Implications (2023)
  16. Arbitrage-Free SVI Volatility Surfaces (2014)
  17. Volatility Interpolation (2011)
  18. Pricing with a Smile (1994)
  19. Pricing Under Rough Volatility (2016)
  20. Computational Optimal Transport: With Applications to Data Science (2019)
  21. Interpolating Between Optimal Transport and MMD Using Sinkhorn Divergences (2019)
  22. Wasserstein GAN (2017)
  23. Unbalanced Optimal Transport: Dynamic and Kantorovich Formulations (2018)
  24. Neural Optimal Transport (2023)
  25. Martingale Optimal Transport and Applications (2020)
  26. Spectral Graph Theory (1997)
  27. Arbitrage-Free Smoothing of the Implied Volatility Surface (2009)
  28. Generalization Properties of Learning with Random Features (2017)
  29. Multi-Marginal Martingale Optimal Transport: Theory and Numerics (2024) — link
  30. Schr "o dinger Bridges in Quantitative Finance (2023)
  31. Projections on Convex Sets: Theory and Applications (2012)
  32. Arbitrage-Free Term Structure Models (2012)
  33. Trust-Region Training for Constrained Diffusion Models (2023)
  34. Measure-Preserving Martingale Schr "o dinger Bridges (2024) — link
  35. No-Arbitrage Neural Networks for Option Pricing (2019)
  36. Deep Calibration of (Rough) Stochastic Volatility Models (2020)
  37. Convergence Rate of the Sinkhorn Algorithm for Regularized Optimal Transport (2021)
  38. Consistency Models (2024)
  39. Aggregated Kernel Tests Based on Incomplete U-Statistics (2022)
  40. Kernel Two-Sample Tests in High Dimensions: Interplay Between Moment Discrepancy and Dimension (2023)
  41. Testing the Equality of Distributions Using Integrated Maximum Mean Discrepancy (2024)
  42. Accurate Monotonicity Preserving Cubic Interpolation (1983)
  43. Generation of Finite Difference Formulas on Arbitrarily Spaced Grids (1988)
  44. Calculation of Weights in Finite Difference Formulas (1998)
  45. Finite Difference Methods for Ordinary and Partial Differential Equations (2007)
  46. Spectral Methods in MATLAB (2000)
  47. Smoothing and Differentiation of Data by Simplified Least Squares Procedures (1964)
  48. Local Polynomial Modelling and Its Applications (1996)
  49. Sparse Grids (2004)
  50. Tractability of Multivariate Problems, Vol.\ I–III (2008)
  51. Hyperbolic Cross Approximation (2016)
  52. Greedy Approximation (2008)
  53. Convex Analysis (1970)
  54. Optimal Approximation of Piecewise Smooth Functions Using Deep ReLU Neural Networks (2018)
  55. On the Power of Depth for Feedforward Neural Networks (2018)
  56. On the Number of Linear Regions of Deep Neural Networks (2014)
  57. Error Bounds for Approximations with Deep ReLU Networks (2017)
  58. Hilbert Space Embeddings and Metrics on Probability Measures (2010)
  59. Universality, Characteristic Kernels and RKHS Embedding of Measures (2011)
  60. Scaling-up Empirical Risk Minimization: Optimization of Incomplete U-Statistics (2016)
  61. Fast Two-Sample Testing with Analytic Representations of Probability Measures (2015)
  62. Asymptotically Minimax Adaptive Estimation. I: Upper Bounds (1991)
  63. Generative Models and Model Criticism via Optimized Maximum Mean Discrepancy (2016)
  64. On the Decreasing Power of Kernel and Distance Based Nonparametric Hypothesis Tests in High Dimensions (2015)
  65. Limiting Behavior of U-statistics for Stationary, Absolutely Regular Processes (1976)
  66. Central Limit Theorem for U-statistics of Strongly Mixing Sequences (2010)
  67. Law of the Iterated Logarithm for U-statistics of Weakly Dependent Observations (2011)
  68. Th 'e orie Asymptotique des Processus Al 'e atoires Faiblement D 'e pendants (2000)
  69. Bernstein Inequality and Moderate Deviations under Strong Mixing Conditions (2009)
  70. Concentration Inequalities: A Nonasymptotic Theory of Independence (2013)
  71. A Simple, Positive Semi-definite, Heteroskedasticity and Autocorrelation Consistent Covariance Matrix (1987)
  72. A General Qualitative Definition of Robustness (1971)
  73. Robust Statistics (2009)
  74. Geometric Median and Robust Estimation in Banach Spaces (2015)
  75. Sinkhorn Distances: Lightspeed Computation of Optimal Transport (2013)
  76. Iterative Bregman Projections for Regularized Transportation Problems (2015)
  77. A Survey of the Schr "o dinger Problem and Some of its Connections with Optimal Transport (2014)
  78. Asymptotic Analysis of the Exponential Penalty Trajectory in Linear Programming (1994)
  79. On the Scaling of Multidimensional Matrices (1989)
  80. Near-Linear Time Approximation Algorithms for Optimal Transport via Sinkhorn Iterations (2017)
  81. Using the Nystr "o m Method to Speed Up Kernel Machines (2001)
  82. Revisiting the Nystr "o m Method for Improved Large-Scale Machine Learning (2016)
  83. Random Features for Large-Scale Kernel Machines (2007)
  84. Tensor Decompositions and Applications (2009)
  85. Tensor-Train Decomposition (2011)
  86. Model-Independent Bounds for Option Prices—A Mass Transport Approach (2013)
  87. On a Problem of Optimal Transport under Marginal and Martingale Constraints (2016)
  88. Complete Duality for Martingale Optimal Transport on the Line (2017)
  89. Scaling Algorithms for Unbalanced Transport Problems (2018)
  90. Statistical Inference under Order Restrictions (1972)
  91. Nonparametric Least Squares Estimation of a Multivariate Convex Regression Function (2011)
  92. A Multi-Marginal c-Convex Duality Theorem for Martingale Optimal Transport (2024) — link
  93. Dispersion-Constrained Martingale Schr "o dinger Problems and the Exact Joint S&P 500/VIX Smile (2024) — link
  94. Entropic Martingale Optimal Transport: Inference and Asymptotics (2021) — link

0 of 102 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.