The Monge Optimal Transport Barycentre Problem

Summary A novel methodology is developed for the solution of the data‐driven Monge optimal transport barycentre problem, where the pushforward condition is formulated in terms of the statistical independence between two sets of random variables: the factors and a transformed outcome . Relaxing independence to the uncorrelation between all functions of and within suitable inner‐product spaces leads to an adversarial formulation, for which the adversarial strategy can be found in closed form through the first principal components of a matrix, and the resulting pure minimization problem can be solved efficiently through 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 barycentre 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.

Authors

Institutions

Publication Details

Journal
International Statistical Review
Published
2026-11-18
DOI
https://doi.org/10.1111/insr.70075
Citations
5
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
4.29

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

The Monge Optimal Transport Barycentre Problem

Giulio Trigila, Esteban G. Tabak, X.D. Ye, Wenjun Zhao et al.
5 citations
International Statistical Review
Geometric Analysis and Curvature Flows
4.29
article

The Monge Optimal Transport Barycentre Problem

Giulio Trigila, Esteban G. Tabak, X.D. Ye, Wenjun Zhao, Yating Wang, Andrew D. Lipnick
article en
5 citations

Abstract

Summary A novel methodology is developed for the solution of the data‐driven Monge optimal transport barycentre problem, where the pushforward condition is formulated in terms of the statistical independence between two sets of random variables: the factors and a transformed outcome . Relaxing independence to the uncorrelation between all functions of and within suitable inner‐product spaces leads to an adversarial formulation, for which the adversarial strategy can be found in closed form through the first principal components of a matrix, and the resulting pure minimization problem can be solved efficiently through 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 barycentre 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.

International Statistical Review
Baruch College (US), Lafayette College (US), Courant Institute of Mathematical Sciences (US), Wake Forest University (US), New York University (US)
Office of Naval Research, Division of Mathematical Sciences
Openalex Percentile: Top 8%
Geometric Analysis and Curvature Flows
4.29
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.

Laika access coming soon