Related papers: The Martingale Sinkhorn Algorithm
Classical entropy regularization is poorly suited to continuous-time martingale transport, since relative entropy between diffusion laws typically forces their volatility characteristics to coincide. We introduce a specific-entropy…
In this paper, we consider a class of stochastic optimal control problems with risk constraints that are expressed as bounded probabilities of failure for particular initial states. We present here a martingale approach that diffuses a risk…
In this paper, we introduce a primal-dual algorithm for solving (martingale) optimal transportation problems, with cost functions satisfying the twist condition, close to the one that has been used recently for training generative…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
We investigate existence of dual optimizers in one-dimensional martingale optimal transport problems. While [BNT16] established such existence for weak (quasi-sure) duality, [BHP13] showed existence for the natural stronger pointwise…
We establish the uniform in time stability, w.r.t. the marginals, of the Iterative Proportional Fitting Procedure, also known as Sinkhorn algorithm, used to solve entropy-regularised Optimal Transport problems. Our result is quantitative…
Motivated by modern machine learning applications where we only have access to empirical measures constructed from finite samples, we relax the marginal constraints of the classical Schr\"odinger bridge problem by penalizing the transport…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
A convex duality result for martingale optimal transport problems with two marginals was established in Beiglb\"ock et al. (2013). In this paper we provide a generalization of this result to the multi-period setting.
The calibration of volatility models from observable option prices is a fundamental problem in quantitative finance. The most common approach among industry practitioners is based on the celebrated Dupire's formula [6], which requires the…
Starting from Brenier's relaxed formulation of the incompressible Euler equation in terms of geodesics in the group of measure-preserving diffeomorphisms, we propose a numerical method based on Sinkhorn's algorithm for the entropic…
We consider the numerical solution of the discrete multi-marginal optimal transport (MOT) by means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of dimensionality with respect to the number of…
In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However,…
The dynamic formulation of optimal transport, also known as the Benamou-Brenier formulation, has been extended to the unbalanced case by introducing a source term in the continuity equation. When this source term is penalized based on the…
We pursue robust approach to pricing and hedging in mathematical finance. We consider a continuous time setting in which some underlying assets and options, with continuous paths, are available for dynamic trading and a further set of…
We prove the Duality Theorems for the stochastic optimal transportation problems with a convex cost function without a regularity assumption that is often supposed in the proof of the lower semicontinuity of an action integral. In our new…
Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When…
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 require applying significant local distortions to…
We consider an optimal transport problem with backward martingale constraint. The objective function is given by the scalar product of a pseudo-Euclidean space $S$. We show that the supremums over maps and plans coincide, provided that the…
The Schr\"odinger bridge problem seeks the optimal stochastic process that connects two given probability distributions with minimal energy modification. While the Sinkhorn algorithm is widely used to solve the static optimal transport…