Related papers: The Martingale Sinkhorn Algorithm
Correctly estimating the discrepancy between two data distributions has always been an important task in Machine Learning. Recently, Cuturi proposed the Sinkhorn distance which makes use of an approximate Optimal Transport cost between two…
We propose a variational model with diffeomorphic optimal transportation for joint image reconstruction and motion estimation. The proposed model is a production of assembling the Wasserstein distance with the Benamou--Brenier formula in…
In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is…
A natural and important question in multi-marginal optimal transport is whether the \emph{Monge ansatz} is justified; does there exist a solution of Monge, or deterministic, form? We address this question for the quadratic cost when each…
We introduce and study a multi-marginal optimal partial transport problem. Under a natural and sharp condition on the dominating marginals, we establish uniqueness of the optimal plan. Our strategy of proof establishes and exploits a…
We introduce polynomial processes taking values in an arbitrary Banach space $B$ via their infinitesimal generator $L$ and the associated martingale problem. We obtain two representations of the (conditional) moments in terms of solutions…
We introduce the proximal optimal transport divergence, a novel discrepancy measure that interpolates between information divergences and optimal transport distances via an infimal convolution formulation. This divergence provides a…
We consider the optimal mass transportation problem in $\RR^d$ with measurably parameterized marginals, for general cost functions and under conditions ensuring the existence of a unique optimal transport map. We prove a joint measurability…
We provide a simple proof, as well as several generalizations, of a recent result by Davis and Suh, characterizing a class of continuous submartingales and supermartingales that can be expressed in terms of a squared Brownian motion and of…
We show that, under certain smoothness conditions, a Brownian martingale at a fixed time can be represented as an exponential of its value at a later time. The time-dependent generator of this exponential operator is equal to one half times…
This work is concerned with the efficient optimization method for solving a large class of optimal mass transport problems. An inexact primal-dual algorithm is presented from the time discretization of a proper dynamical system, and by…
Stability of the value function and the set of minimizers w.r.t. the given data is a desirable feature of optimal transport problems. For the classical Kantorovich transport problem, stability is satisfied under mild assumptions and in…
Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans $\pi_1, \pi_2, \ldots$ converges weakly to a transport plan $\pi$, then $\pi$ is also optimal (between its…
We present a new approach to Bayesian inference that entirely avoids Markov chain simulation, by constructing a map that pushes forward the prior measure to the posterior measure. Existence and uniqueness of a suitable measure-preserving…
When the limiting compensator of a sequence of martingales is continuous, we obtain a weak convergence theorem for the martingales; the limiting process can be written as a Brownian motion evaluated at the compensator and we find sufficient…
We study a stochastic control problem for continuous multidimensional martingales with fixed quadratic variation. In a radially symmetric environment, we are able to find an explicit solution to the control problem and find an optimal…
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…
We investigate the martingale Schr\"odinger bridge, recently introduced by Nutz and Wiesel as a distinguished martingale transport plan between two probability measures in convex order. We show that this construction extends naturally to…
We study finite-horizon optimal switching with discrete intervention dates on a general filtration, allowing continuous-time observations between decision dates, and develop a deep-learning-based dual framework with computable upper bounds.…
We propose two models for the interpolation between RGB images based on the dynamic optimal transport model of Benamou and Brenier [8]. While the application of dynamic optimal transport and its extensions to unbalanced transform were…