The Measure Preserving Martingale Sinkhorn Algorithm
We contribute to the recent studies of the so-called Bass martingale. Backhoff-Veraguas et al. (2020) showed it is the solution to the martingale Benamou-Brenier (mBB) problem, i.e., among all martingales with prescribed initial and terminal distributions it is the one closest to the Brownian motion. We link it with semimartingale optimal transport and deduce an alternative way to derive the dual formulation recently obtained in Backhoff-Veraguas et al. (2023). We then consider computational methods to compute the Bass martingale. The dual formulation of the transport problem leads to an iterative scheme that mirrors to the celebrated Sinkhorn algorithm for entropic optimal transport. We call it the measure preserving martingale Sinkhorn (MPMS) algorithm. We prove that in any dimension, each step of the algorithm improves the value of the dual problem, which implies its convergence. Our MPMS algorithm is equivalent to the fixed-point method of Conze and Henry-Labordere (2021), studied in Acciaio et al. (2023), and performs very well on a range of examples, including real market data.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Building arbitrage-free implied volatility: Sinkhorn's algorithm and variants
We consider the classical problem of building an arbitrage-free implied volatility surface from bid-ask quotes. We design a fast numerical procedure, for which we prove the convergence, based on the Sinkhorn algorithm th…
Compressed online Sinkhorn
The use of optimal transport (OT) distances, and in particular entropic-regularised OT distances, is an increasingly popular evaluation metric in many areas of machine learning and data science. Their use has largely bee…
An Optimal Transport approach to arbitrage correction: Application to volatility Stress-Tests
We present a method based on optimal transport to remove arbitrage opportunities within a finite set of option prices. The method is notably intended for regulatory stress-tests, which impose to apply important local dis…
MathOn Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
We provide a computational complexity analysis for the Sinkhorn algorithm that solves the entropic regularized Unbalanced Optimal Transport (UOT) problem between two measures of possibly different masses with at most $n$…
Sinkhorn Flow: A Continuous-Time Framework for Understanding and Generalizing the Sinkhorn Algorithm
Many problems in machine learning can be formulated as solving entropy-regularized optimal transport on the space of probability measures. The canonical approach involves the Sinkhorn iterates, renowned for their rich ma…