Related papers: Unnormalized Optimal Transport
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…
The paper is accompanying "A general Duality Theorem for the Monge-Kantorovich Transport Problem". We explain the methods used in this article in an elementary setting and present two examples complementing the results obtained therein.
Normalizing Flows (NF) are powerful likelihood-based generative models that are able to trade off between expressivity and tractability to model complex densities. A now well established research avenue leverages optimal transport (OT) and…
This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…
In this paper, we introduce weak optimal entropy transport problems that cover both optimal entropy transport problems and weak optimal transport problems introduced by Liero, Mielke, and Savar\'{e} [27]; and Gozlan, Roberto, Samson and…
Recently a Dynamic-Monge-Kantorovich formulation of the PDE-based $L^1$-optimal transport problem was presented. The model considers a diffusion equation enforcing the balance of the transported masses with a time-varying conductivity that…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We establish a Kantorovich duality for the pseudometric $\mathcal{E}_\hbar$ introduced in [F. Golse, T. Paul, Arch. Rational Mech. Anal. 223 (2017), 57--94], obtained from the usual Monge-Kantorovich distance $d_{MK,2}$ between classical…
In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…
In this paper we study continuum-marginal optimal transport. Given a time-continuous family of probability marginals, the problem is to recover the minimum-energy velocity field whose flow reproduces every marginal. This problem is the…
In this paper, we present a numerical method, based on iterative Bregman projections, to solve the optimal transport problem with Coulomb cost. This is related to the strong interaction limit of Density Functional Theory. The first idea is…
We introduce folded optimal transport, as a method to extend a cost or distance defined on the extreme boundary of a convex to the whole convex, related to convex extension. This construction broadens the framework of standard optimal…
We show that introducing an exponential cut-off on a suitable Sobolev norm facilitates the proof of quasi-invariance of Gaussian measures with respect to Hamiltonian PDE flows and allows us to establish the exact Jacobi formula for the…
In this work we present a numerical method for the Optimal Mass Transportation problem. Optimal Mass Transportation (OT) is an active research field in mathematics.It has recently led to significant theoretical results as well as…
In this paper, we investigate the geodesic structure and the associated Kantorovich-type duality for a Benamou-Brenier-type transportation metric defined on the space of nonnegative measures over a finite reversible Markov chain. The metric…
In this article we study the noncommutative transport distance introduced by Carlen and Maas and its entropic regularization defined by Becker and Li. We prove a duality formula that can be understood as a quantum version of the dual…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
This paper investigates causal optimal transportation problems, in the framework of two Polish spaces, both endowed with filtrations. Specific concretizations yield primal problems equivalent to several classical problems of stochastic…
Many problems in dynamic data driven modeling deals with distributed rather than lumped observations. In this paper, we show that the Monge-Kantorovich optimal transport theory provides a unifying framework to tackle such problems in the…
We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…