Related papers: Stochastic Monge-Kantorovich Problem and its Duali…
A result of Hohloch links the theory of integer partitions with the Monge formulation of the optimal transport problem, giving the optimal transport map between (Young diagrams of) integer partitions and their corresponding symmetric…
Optimal transport distances, otherwise known as Wasserstein distances, have recently drawn ample attention in computer vision and machine learning as a powerful discrepancy measure for probability distributions. The recent developments on…
We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set. It leads to dual equalities and characterizations of the…
We solve a generalized Kyle model type problem using Monge-Kantorovich duality and backward stochastic partial differential equations. First, we show that the the generalized Kyle model with dynamic information can be recast into a terminal…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
The Monge-Kantorovich mass transfer problem is equivalently formulated as a convex optimization problem for a potential function. In the light of this formulation an interative algorithm is developed for determining the solution. It is a…
Let $X$ be a Polish space, $\mathcal{P}(X)$ be the set of Borel probability measures on $X$, and $T\colon X\to X$ be a homeomorphism. We prove that for the simplex $\mathrm{Dom} \subseteq \mathcal{P}(X)$ of all $T$-invariant measures, the…
The purpose of this note is to show that the solution to the Kantorovich optimal transportation problem is supported on a Lipschitz manifold, provided the cost is $C^{2}$ with non-singular mixed second derivative. We use this result to…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
We consider the problem of solving the optimal transport problem between two empirical distributions with missing values. Our main assumption is that the data is missing completely at random (MCAR), but we allow for heterogeneous…
Over the past five years, multi-marginal optimal transport, a generalization of the well known optimal transport problem of Monge and Kantorovich, has begun to attract considerable attention, due in part to a wide variety of emerging…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
We consider probability measures on $\mathbb{R}^{\infty}$ and study optimal transportation mappings for the case of infinite Kantorovich distance. Our examples include 1) quasi-product measures, 2) measures with certain symmetric…
The Monge-Kantorovich mass-transportation problem has been shown to be fundamental for various basic problems in analysis and geometry in recent years. Shen and Zheng (2010) proposed a probability method to transform the celebrated…
Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely used in many machine learning applications. Unfortunately,…
Two probability distributions $\mu$ and $\nu$ in second stochastic order can be coupled by a supermartingale, and in fact by many. Is there a canonical choice? We construct and investigate two couplings which arise as optimizers for…
By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry…
Optimal transport is a foundational problem in optimization, that allows to compare probability distributions while taking into account geometric aspects. Its optimal objective value, the Wasserstein distance, provides an important loss…
Let $X,Y$ be two finite sets of points having $\#X = m$ and $\#Y = n$ points with $\mu = (1/m) \sum_{i=1}^{m} \delta_{x_i}$ and $\nu = (1/n) \sum_{j=1}^{n} \delta_{y_j}$ being the associated uniform probability measures. A result of…
We develop a projected Wasserstein distance for the two-sample test, a fundamental problem in statistics and machine learning: given two sets of samples, to determine whether they are from the same distribution. In particular, we aim to…