Discrete Approximation of Optimal Transport on Compact Spaces
Maximiliano Frungillo
TL;DR
This work develops a general, fully discrete framework for approximating the Kantorovich and Monge formulations of optimal transport on general compact spaces using $h$-partitions to build discrete marginals and a finite cost LP. A novel element is the extension of projection maps to arbitrary metric spaces via geometric medians (or barycenters) and semidiscrete constructions, enabling map approximation without linear structure. The authors prove sharp convergence results: discrete plans converge to the Kantorovich minimizers, optimal values converge with an explicit modulus $\omega_c(h)$, and projection maps converge to the true OT map under mild (strong) uniqueness conditions; they also quantify when fully discrete convergence in the disc_p metric holds, relating it to the μ-nullity of the map’s discontinuity set. The results substantially broaden the theory of OT discretization beyond Euclidean settings, with implications for robust numerical schemes and convergence guarantees in general compact spaces.
Abstract
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values and plans by solving finite dimensional discretizations of the corresponding Kantorovich problem. Then we approximate optimal maps by means of the usual barycentric projection or by an analogous procedure available in general spaces without a linear structure. We prove the convergence of all these approximants in full generality and show that our convergence results are sharp.
