Related papers: Orlicz space regularization of continuous optimal …
The Kantorovich metric provides a way of measuring the distance between two Borel probability measures on a metric space. This metric has a broad range of applications from bioinformatics to image processing, and is commonly linked to the…
We introduce a new framework for data denoising, partially inspired by martingale optimal transport. For a given noisy distribution (the data), our approach involves finding the closest distribution to it among all distributions which 1)…
In this paper we study theoretical properties of the entropy-transport functional with repulsive cost functions. We provide sufficient conditions for the existence of a minimizer in a class of metric spaces and prove 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 study solutions to the multi-marginal Monge-Kantorovich problem which are concentrated on several graphs over the first marginal. We first present two general conditions on the cost function which ensure, respectively, that any solution…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This…
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…
We study MinMax solution methods for a general class of optimization problems related to (and including) optimal transport. Theoretically, the focus is on fitting a large class of problems into a single MinMax framework and generalizing…
In mathematical modelling, the data and solutions are represented as measurable functions and their quality is oftentimes captured by the membership to a certain function space. One of the core questions for an analysis of a model is the…
This chapter describes techniques for the numerical resolution of optimal transport problems. We will consider several discretizations of these problems, and we will put a strong focus on the mathematical analysis of the algorithms to solve…
Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal…
We consider some repulsive multimarginal optimal transportation problems which include, as a particular case, the Coulomb cost. We prove a regularity property of the minimizers (optimal transportation plan) from which we deduce existence…
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…
This article introduces a generalization of the discrete optimal transport, with applications to color image manipulations. This new formulation includes a relaxation of the mass conservation constraint and a regularization term. These two…
We study the dual formulation of the Monge-Kantorovich optimal transportation problem, in particular under what circumstances it is permitted in an infinite dimensional setting to use cylindrical functions, i.e. functions of the form…
Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…
Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the…
We prove quantitative bounds on the stability of optimal transport maps and Kantorovich potentials from a fixed source measure $\rho$ under variations of the target measure $\mu$, when the cost function is the squared Riemannian distance on…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…