English
Related papers

Related papers: Kantorovich Distance via Spanning Trees: Propertie…

200 papers

The question of which costs admit unique optimizers in the Monge-Kantorovich problem of optimal transportation between arbitrary probability densities is investigated. For smooth costs and densities on compact manifolds, the only known…

Optimization and Control · Mathematics 2018-01-23 Robert J. McCann , Ludovic Rifford

We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…

Optimization and Control · Mathematics 2019-02-20 Amirhossein Taghvaei , Amin Jalali

We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…

Optimization and Control · Mathematics 2022-01-25 Espen Bernton , Promit Ghosal , Marcel Nutz

We introduce a new stochastic algorithm for solving entropic optimal transport (EOT) between two absolutely continuous probability measures $\mu$ and $\nu$. Our work is motivated by the specific setting of Monge-Kantorovich quantiles where…

Probability · Mathematics 2025-07-29 Bernard Bercu , Jérémie Bigot , Gauthier Thurin

We analyze optimal transport problems with additional entropic cost evaluated along curves in the Wasserstein space which join two probability measures $m_0,m_1$. The effect of the additional entropy functional results into an elliptic…

Analysis of PDEs · Mathematics 2022-11-18 Alessio Porretta

This study examines the time complexities of the unbalanced optimal transport problems from an algorithmic perspective for the first time. We reveal which problems in unbalanced optimal transport can/cannot be solved efficiently.…

Machine Learning · Computer Science 2021-01-11 Ryoma Sato , Makoto Yamada , Hisashi Kashima

We consider optimal transport problems where the cost for transporting a given probability measure $\mu_0$ to another one $\mu_1$ consists of two parts: the first one measures the transportation from $\mu_0$ to an intermediate (pivot)…

Optimization and Control · Mathematics 2025-02-05 Giuseppe Buttazzo , Guillaume Carlier , Katharina Eichinger

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…

Differential Geometry · Mathematics 2013-09-10 Bernhard Schmitzer , Christoph Schnörr

We consider Kantorovich optimal transportation problem in the case where the cost function and marginal distributions continuously depend on a parameter with values in a metric space. We prove the existence of approximate optimal Monge…

Functional Analysis · Mathematics 2023-02-27 Svetlana Popova

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…

Probability · Mathematics 2013-08-02 Christian Léonard

An analogue of the quadratic Wasserstein (or Monge-Kantorovich) distance between Borel probability measures on $\mathbf{R}^d$ has been defined in [F. Golse, C. Mouhot, T. Paul: Commun. Math. Phys. 343 (2015), 165-205] for density operators…

Mathematical Physics · Physics 2021-02-10 Emanuele Caglioti , François Golse , Thierry Paul

This article presents a new class of distances between arbitrary nonnegative Radon measures inspired by optimal transport. These distances are defined by two equivalent alternative formulations: (i) a dynamic formulation defining the…

Optimization and Control · Mathematics 2019-02-12 Lenaic Chizat , Gabriel Peyré , Bernhard Schmitzer , François-Xavier Vialard

In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…

Methodology · Statistics 2021-01-14 Giovanni Pistone , Fabio Rapallo , Maria Piera Rogantin

The presentation covers prerequisite results from Topology and Measure Theory. This is then followed by an introduction into couplings and basic definitions for optimal transport. The Kantrorovich problem is then introduced and an existence…

Probability · Mathematics 2020-10-12 Austin Vandegriffe

We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a transport plan between two marginals that are probability measures on compact subsets of Euclidean space. We consider the case of…

Optimization and Control · Mathematics 2020-10-28 Christian Clason , Dirk A. Lorenz , Hinrich Mahler , Benedikt Wirth

An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…

Probability · Mathematics 2026-01-14 Sergey G. Bobkov , Friedrich Götze

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…

Probability · Mathematics 2015-11-05 Danila Zaev

We consider the modified Monge-Kantorovich problem with additional restriction: admissible transport plans must vanish on some fixed functional subspace. Different choice of the subspace leads to different additional properties optimal…

Functional Analysis · Mathematics 2014-04-22 Danila Zaev

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…

Optimization and Control · Mathematics 2026-01-15 Alec Metsch

Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…

Optimization and Control · Mathematics 2025-12-11 Mohsen Sadr , Peyman Mohajerin Esfahani , Hossein Gorji