Financial Tail Risk Beyond Lipschitz Continuity via Semi-Discrete Optimal Transport
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
Financial returns are heavy-tailed, and accurate tail risk estimation is central to portfolio risk management. Modern neural generators sample by pushing a simple base distribution through a learned map, and for training stability that map is built from Lipschitz components. This is the binding constraint: a Lipschitz map of a Gaussian is sub-Gaussian, so heavier-tailed targets admit no exact match at any finite Lipschitz constant. The Monge--Amp`ere equation ties the Brenier map's local distortion to the density ratio f/(gcirc T), so a deeper trough in the target density requires a higher-gain map and yields a higher-variance estimator. The argument needs only bounded distortion, so it covers normalizing flows, flow matching, GANs, and diffusion samplers alike. Semi-Discrete Optimal Transport (SDOT) relaxes the map's regularity rather than the source's tail class. Its power diagram gives every training observation a cell holding exactly 1/N of the source measure, and tail observations are reached by crossing a cell boundary rather than by stretching. Our primary experiment sweeps severity over a calibrated Merton jump-diffusion spanning kurtosis 94 to 1,679. SDOT holds tail ratios at 0.85--0.94 with cross-seed standard deviations below 0.025, while every learned generator either compresses the tails or inflates them with a variance that grows alongside. Further experiments carry the result to real S&P~500 returns and to a 21-year backtest, where SDOT gives the best risk-adjusted market-neutral strategy under CVaR optimization (Sharpe 0.70, max drawdown -2.60%, against 0.40 for the next-best generator).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 13 of its 45 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
13 of 45 references.
References · 13
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2016Density estimation using Real NVPcited by 2,042
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
- 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
- 2019Quant GANs: Deep Generation of Financial Time Seriescited by 108
- 2015Parallelizing the dual revised simplex methodcited by 89
- 2021Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributionscited by 23
1 more
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Tail Annealing for Heavy-Tailed Flow Matching
- 2025Beyond Linear Diffusions: Improved Representations for Rare Conditional Generative Modeling
- 2026Do Heavy Tails Help Diffusion? On the Subtle Trade-off Between Initialization and Training
- 2026Generative Diffusion Model for Risk-Neutral Derivative Pricing
- 2024Heavy-Tailed Diffusion Models
- 2026Towards Financial World Modeling
- 2026Addressing Market Regime Changes and Heavy-Tailed Returns in Portfolio Optimization via Bayesian VAR and Elliptical Black-Litterman
- 2025Tail-Safe Hedging: Explainable Risk-Sensitive Reinforcement Learning with a White-Box CBF--QP Safety Layer in Arbitrage-Free Markets