On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem

Computing the infinity Wasserstein distance and retrieving projections of a probability measure onto a closed subset of probability measures are critical sub-problems in various applied fields. However, the practical applicability of these objects is limited by two factors: either the associated quantities are computationally prohibitive or there is a lack of available algorithms capable of calculating them. In this paper, we propose a novel class of Linear Programming problems and a routine that allows us to compute the infinity Wasserstein distance and to compute a projection of a probability measure over a generic subset of probability measures with respect to any $p$-Wasserstein distance with $p\in[1,\infty]$.

Publication Details

Journal
ArXiv.org
Published
2025-08-14
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem

ArXiv.org
Geometric Analysis and Curvature Flows
article

On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem

article en

Abstract

Computing the infinity Wasserstein distance and retrieving projections of a probability measure onto a closed subset of probability measures are critical sub-problems in various applied fields. However, the practical applicability of these objects is limited by two factors: either the associated quantities are computationally prohibitive or there is a lack of available algorithms capable of calculating them. In this paper, we propose a novel class of Linear Programming problems and a routine that allows us to compute the infinity Wasserstein distance and to compute a projection of a probability measure over a generic subset of probability measures with respect to any $p$-Wasserstein distance with $p\in[1,\infty]$.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 39%
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem · ArXiv.org (2025) | TGRS Research Map | TGRS