Deep Barycentric Regression for Optimal Transport Map Estimation and its Statistical Optimality
Not on the map. Why?
Abstract (arXiv)
The optimal transport (OT) map provides a geometric transformation for aligning probability distributions and has become a useful tool in machine learning. However, existing estimators of the OT map still exhibit a gap between sharp statistical guarantees and practical parametric estimation based on stable training objectives. Theoretical estimators achieve minimax optimal convergence rates, but they are typically nonparametric and can incur demanding implementation design or inference costs. Practical estimators are parametric and scalable, but their statistical guarantees remain underexplored, and their min-max, adversarial-like training objectives can be sensitive to optimization algorithms. We propose BROT (Barycentric Regression for OT), a simple two-step method that first computes the unregularized OT plan and then fits a deep neural network (DNN) to the induced barycentric targets by least-squares regression. Under standard regularity conditions, we prove that the DNN estimator of BROT attains the minimax convergence rate, when the ground-truth OT map is Lipschitz. Numerical studies on synthetic datasets and an image dataset show that BROT provides accurate map estimates, strong target distribution matching, and competitive transport costs, compared to existing estimation methods. Experiments on two downstream tasks, single-cell perturbation prediction and unsupervised domain adaptation, further suggest that the accurate estimation of BROT can translate into stronger task performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 53 references that are in the map. First posted on arXiv 6 Sep 2026.
Builds on
34 of 53 references.
References · 34
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2019StarGAN v2: Diverse Image Synthesis for Multiple Domainscited by 1,098
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
- 2018Computational Optimal Transportcited by 780
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2015Optimal Transport for Domain Adaptationcited by 463
22 more
- 2017VisDA: The Visual Domain Adaptation Challengecited by 435
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 433
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2018Adaptivity of deep ReLU network for learning in Besov and mixed smooth Besov spaces: optimal rate and curse of dimensionalitycited by 162
- 2022Neural Optimal Transportcited by 126
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
- 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
- 2021Generative Modeling with Optimal Transport Mapscited by 82
- 2018Optimal Transport for Multi-source Domain Adaptation under Target Shiftcited by 68
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 68
- 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 53
- 2021Neural Monge Map estimation and its applicationscited by 40
- 2022Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activationscited by 29
- 2022Optimal transport map estimation in general function spacescited by 20
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
- 2023Differentiable Neural Networks with RePU Activation: with Applications to Score Estimation and Isotonic Regressioncited by 9
- 2024Improving Neural Optimal Transport via Displacement Interpolationcited by 7
- 2025Fairness Through Matchingcited by 6
- 2025Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plancited by 6
- 2024Automatic Outlier Rectification via Optimal Transportcited by 1
Built on by
Not cited yet.