English
Related papers

Related papers: Disintegrated optimal transport for metric fiber b…

200 papers

We introduce a one-parameter family of metrics on the space of Borel probability measures on Euclidean space with finite $p$th moment for $1\leq p <\infty$, called the $\textit{sliced Monge--Kantorovich metrics}$, which include the sliced…

Metric Geometry · Mathematics 2024-05-29 Jun Kitagawa , Asuka Takatsu

We prove existence and duality on a wide class of metric spaces, and uniqueness results on any connected, complete Riemannian manifold, with or without boundary, for classical Monge--Kantorovich barycenters. In particular, this is the first…

Metric Geometry · Mathematics 2026-01-22 Jun Kitagawa , Asuka Takatsu

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

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…

Functional Analysis · Mathematics 2025-12-29 Ho Yun , Yoav Zemel

The Monge-Kantorovich problem for the infinite Wasserstein distance presents several peculiarities. Among them the lack of convexity and then of a direct duality. We study in dimension 1 the dual problem introduced by Barron, Bocea and…

Optimization and Control · Mathematics 2017-08-08 Luigi De Pascale , Jean Louet

This paper focuses on the Monge-Kantorovich formulation of the optimal transport problem and the associated $L^2$ Wasserstein distance. We use the $L^2$ Wasserstein distance in the Nearest Neighbour (NN) machine learning architecture to…

Computer Vision and Pattern Recognition · Computer Science 2019-03-20 Michael Snow , Jan Van lent

We consider the Monge-Kantorovich problem between two random measuress. More precisely, given probability measures $\mathbb{P}_1,\mathbb{P}_2\in\mathcal{P}(\mathcal{P}(M))$ on the space $\mathcal{P}(M)$ of probability measures on a smooth…

Probability · Mathematics 2024-10-10 Pedram Emami , Brendan Pass

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…

Probability · Mathematics 2017-08-29 Soumik Pal

The dual attainment of the Monge--Kantorovich transport problem is analyzed in a general setting. The spaces $X, Y$ are assumed to be polish and equipped with Borel probability measures $\mu$ and $\nu$. The transport cost function $c:\XY…

Optimization and Control · Mathematics 2020-07-17 Mathias Beiglböck , Christian Léonard , Walter Schachermayer

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 discuss the relation between the Wasserstein distance of order 1 between probability distributions on a metric space, arising in the study of Monge-Kantorovich transport problem, and the spectral distance of noncommutative geometry.…

Operator Algebras · Mathematics 2015-03-13 Francesco D'Andrea , Pierre Martinetti

A quantum version of the Monge--Kantorovich optimal transport problem is analyzed. The transport cost is minimized over the set of all bipartite coupling states $\rho^{AB}$, such that both of its reduced density matrices $\rho^A$ and…

Quantum Physics · Physics 2022-09-21 Shmuel Friedland , Michał Eckstein , Sam Cole , Karol Życzkowski

We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X,dN) a possibly branching geodesic space. We show that under some assumptions on the…

Probability · Mathematics 2012-10-01 Fabio Cavalletti

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

In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…

Combinatorics · Mathematics 2025-05-14 Emanuele Delucchi , Lukas Kühne , Leonie Mühlherr

We establish several quantitative stability estimates for optimal transport maps between non-degenerate densities on uniformly convex domains for the quadratic cost. Under H\"older regularity assumptions, we prove Lipschitz $L^2$…

Analysis of PDEs · Mathematics 2026-05-26 F. -U. Caja-Lopez , Matias G. Delgadino , Jun Kitagawa

We propose an extension of the computational fluid mechanics approach to the Monge-Kantorovich mass transfer problem, which was developed by Benamou-Brenier. Our extension allows optimal transfer of unnormalized and unequal masses. We…

Optimization and Control · Mathematics 2019-10-23 Wilfrid Gangbo , Wuchen Li , Stanley Osher , Michael Puthawala

We suggest a new way of defining optimal transport of positive-semidefinite matrix-valued measures. It is inspired by a recent rendering of the incompressible Euler equations and related conservative systems as concave maximization…

Optimization and Control · Mathematics 2019-07-16 Yann Brenier , Dmitry Vorotnikov

The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…

Optimization and Control · Mathematics 2024-07-30 Théo Dumont , Théo Lacombe , François-Xavier Vialard

Recent advances have discussed cell complexes as ideal learning representations. However, there is a lack of available machine learning methods suitable for learning on CW complexes. In this paper, we derive an explicit expression for the…

Machine Learning · Computer Science 2025-07-23 Rahul Khorana
‹ Prev 1 2 3 10 Next ›