The Monge optimal transport barycenter problem

A novel methodology is developed for the solution of the data-driven Monge optimal transport barycenter problem, where the pushforward condition is formulated in terms of the statistical independence between two sets of random variables: the factors $z$ and a transformed outcome $y$. Relaxing independence to the uncorrelation between all functions of $z$ and $y$ within suitable finite-dimensional spaces leads to an adversarial formulation, for which the adversarial strategy can be found in closed form through the first principal components of a small-dimensional matrix. The resulting pure minimization problem can be solved very efficiently through gradient descent driven flows in phase space. The methodology extends beyond scenarios where only discrete factors affect the outcome, to multivariate sets of both discrete and continuous factors, for which the corresponding barycenter problems have infinitely many marginals. Corollaries include a new framework for the solution of the Monge optimal transport problem, a procedure for the data-based simulation and estimation of conditional probability densities, and a nonparametric methodology for Bayesian inference.

💡 Research Summary

The paper introduces a novel data‑driven formulation of the Monge optimal transport barycenter problem (OTBP) and provides an efficient algorithmic solution. The authors consider a joint distribution π(x, z) of an outcome variable x and covariates z, and seek a transport map y = T(x, z) that removes from x all variability that can be explained by z. The key requirement is statistical independence between the transformed outcome y and the covariates z, while simultaneously minimizing the expected transport cost Eπ