Estimation of Stochastic Optimal Transport Maps
Sloan Nietert, Ziv Goldfeld

TL;DR
This paper develops a new framework for estimating stochastic optimal transport maps, providing efficient estimators with strong theoretical guarantees that work under minimal assumptions and in contaminated data scenarios.
Contribution
It introduces a novel metric for stochastic map quality, develops near-optimal estimators with risk bounds, and extends OT map estimation theory to stochastic and adversarial settings.
Findings
Proposed a new metric for stochastic transport quality.
Designed estimators with near-optimal finite-sample risk bounds.
Validated the approach through empirical experiments.
Abstract
The optimal transport (OT) map is a geometry-driven transformation between high-dimensional probability distributions which underpins a wide range of tasks in statistics, applied probability, and machine learning. However, existing statistical theory for OT map estimation is quite restricted, hinging on Brenier's theorem (quadratic cost, absolutely continuous source) to guarantee existence and uniqueness of a deterministic OT map, on which various additional regularity assumptions are imposed to obtain quantitative error bounds. In many real-world problems these conditions fail or cannot be certified, in which case optimal transportation is possible only via stochastic maps that can split mass. To broaden the scope of map estimation theory to such settings, this work introduces a novel metric for evaluating the transportation quality of stochastic maps. Under this metric, we develop…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAutomated Road and Building Extraction · Data Management and Algorithms · Traffic Prediction and Management Techniques
