Related papers: The Martingale Sinkhorn Algorithm
A novel approach is proposed to establish a sharp upper bound on the expected supremum of a separable martingale random field, serving as an alternative to classical universal chaining-based methods. The proposed approach begins by deriving…
We study a single-period optimal transport problem on $\mathbb{R}^2$ with a covariance-type cost function $c(x,y) = (x_1-y_1)(x_2-y_2)$ and a backward martingale constraint. We show that a transport plan $\gamma$ is optimal if and only if…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
We obtain bounds on the distribution of the maximum of a martingale with fixed marginals at finitely many intermediate times. The bounds are sharp and attained by a solution to $n$-marginal Skorokhod embedding problem in Ob{\l}\'oj and…
In this paper we estimate the rest of the approximation of a stationary process by a martingale in terms of the projections of partial sums. Then, based on this estimate, we obtain almost sure approximation of partial sums by a martingale…
Optimal Transport (OT) problems arise in a wide range of applications, from physics to economics. Getting numerical approximate solution of these problems is a challenging issue of practical importance. In this work, we investigate the…
In this paper, we are motivated by two important applications: entropy-regularized optimal transport problem and road or IP traffic demand matrix estimation by entropy model. Both of them include solving a special type of optimization…
Entropic optimal transport problems play an increasingly important role in machine learning and generative modelling. In contrast with optimal transport maps which often have limited applicability in high dimensions, Schrodinger bridges can…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…
We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein duality theory for the Hessian, 2024, preprint], and whose relaxation…
We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…
This letter investigates dynamical optimal transport of underactuated linear systems over an infinite time horizon. In our previous work, we proposed to integrate model predictive control and the celebrated Sinkhorn algorithm to perform…
We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget"…
We propose a numerical method for solving the multi-marginal Monge problem, which extends the classical Monge formulation to settings involving multiple target distributions. Our approach is based on the Hilbert space embedding of…
We formulate a dynamic reinsurance problem in which the insurer seeks to control the terminal distribution of its surplus while minimizing the L2-norm of the ceded risk. Using techniques from martingale optimal transport, we show that,…
We consider a branching Brownian motion in $\mathbb{R}^d$. We prove that there exists a random subset $\Theta$ of $\mathbb{S}^{d-1}$ such that the limit of the derivative martingale exists simultaneously for all directions $\theta \in…
We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a transport plan between two marginals that are probability measures on compact subsets of Euclidean space. We consider the case of…
A general device is proposed, which provides for extension of exponential inequalities for sums of independent real-valued random variables to those for martingales in the 2-smooth Banach spaces. This is used to obtain optimum bounds of the…
Optimal transport (OT) is a widely used tool in machine learning, but computing high-accuracy solutions for large instances remains costly. Entropic regularization and the Sinkhorn algorithm improve scalability; however, when the…
We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…