Related papers: Quantitative Stability in Discrete Optimal Transpo…
Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…
The stability of optimal transport maps with respect to perturbations of the marginals is a question of interest for several reasons, ranging from the justification of the linearized optimal transport framework to numerical analysis and…
In this paper, we want to establish some general results in the Lorentzian optimal transport theory that have well-known Riemannian counterparts. As a first result, we will provide non-trivial assumptions on the measures to ensure strong…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
Given two probability measures on sequential data, we investigate the transport problem with time-inconsistent preferences in a discrete-time setting. Motivating examples are nonlinear objectives, state-dependent costs, and regularized…
We show continuity of the martingale optimal transport optimisation problem as a functional of its marginals. This is achieved via an estimate on the projection in the nested/causal Wasserstein distance of an arbitrary coupling on to the…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…
We investigate the problem of optimal transport in the so-called Kantorovich form, i.e. given two Radon measures on two compact sets, we seek an optimal transport plan which is another Radon measure on the product of the sets that has these…
A generalized unbalanced optimal transport distance ${\rm WB}_{\Lambda}$ on matrix-valued measures $\mathcal{M}(\Omega,\mathbb{S}_+^n)$ was defined in [arXiv:2011.05845] \`{a} la Benamou-Brenier, which extends the Kantorovich-Bures and the…
Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or…
We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
We propose a fundamental metric for measuring the distance between two distributions. This metric, referred to as the decision-focused (DF) divergence, is tailored to stochastic linear optimization problems in which the objective…
Variational problems that involve Wasserstein distances and more generally optimal transport (OT) theory are playing an increasingly important role in data sciences. Such problems can be used to form an examplar measure out of various…
The optimal transport problem with quadratic regularization is useful when sparse couplings are desired. The density of the optimal coupling is described by two functions called potentials; equivalently, potentials can be defined as a…
We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex…
We study stability of optimizers and convergence of Sinkhorn's algorithm for the entropic optimal transport problem. In the special case of the quadratic cost, our stability bounds imply that if one of the two entropic potentials is…
The fundamental theorem of classical optimal transport establishes strong duality and characterizes optimizers through a complementary slackness condition. Milestones such as Brenier's theorem and the Kantorovich-Rubinstein formula are…
Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…
We develop a full theory for the new class of Optimal Entropy-Transport problems between nonnegative and finite Radon measures in general topological spaces. They arise quite naturally by relaxing the marginal constraints typical of Optimal…
This paper investigates the robust optimal control of sampled-data stochastic systems with multiplicative noise and distributional ambiguity. We consider a class of discrete-time optimal control problems where the controller \emph{jointly}…