The Fundamental Limits of Valid Transport Map Estimation

• URL: http://arxiv.org/abs/2606.30574v1
• Date: Mon, 29 Jun 2026 17:17:55 GMT
• Title: The Fundamental Limits of Valid Transport Map Estimation
• Abstract summary: We formalize the task of estimating any valid transport map in a rigorous minimax framework.<n>We show that, though strong, stability assumptions from the OT literature, estimating any valid transport map is statistically as hard as estimating the OT map.<n>Our minimax framing provides a rigorous foundation for understanding the statistical limits of modern transport-based generative methods.
• Score: 8.610170779272432
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint. In this short note, we formalize the task of estimating any valid transport map in a rigorous minimax framework. One consequence of this framing is that it yields sample complexity lower bounds for any method whose learned object is evaluated as a transport map or plan, including flow matching and diffusion-based generative models, in settings where direct analysis would be challenging due to the analytic complexity of the methods and their target maps. We observe that, under standard, though strong, stability assumptions from the OT literature, estimating any valid transport map is statistically as hard as estimating the OT map. We complement these results with some examples showing that when these stability assumptions fail, alternative transport maps can be learned substantially more accurately than the OT map. Our minimax framing provides a rigorous foundation for understanding the statistical limits of modern transport-based generative methods and clarifies when targeting sub-optimal maps can provide real statistical advantages.

Related papers

• Coupled Optimal Transport with Landmark Constraints [64.98367856457412]
  An optimal transport (OT) model seeks a map or plan between distributions by minimizing a prescribed transport cost or distortion.<n>This paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation.<n>The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching.
  arXiv  Detail & Related papers  (2026-08-20T08:28:13Z)
• Estimation of Stochastic Optimal Transport Maps [20.559434126392205]
  We introduce a novel metric for evaluating the transportation quality of maps.<n>Under this metric, we develop computationally efficient map estimators with near-optimal finite-sample risk bounds.<n>These contributions constitute the first general-purpose theory for map estimation, compatible with a wide spectrum of real-world applications.
  arXiv  Detail & Related papers  (2025-12-10T10:23:40Z)
• Test-time scaling of diffusions with flow maps [68.79792714591564]
  A common recipe to improve diffusion models at test-time is to introduce the gradient of the reward into the dynamics of the diffusion itself.<n>We propose a simple solution by working directly with a flow map.<n>By exploiting a relationship between the flow map and velocity field governing the instantaneous transport, we construct an algorithm, Flow Map Trajectory Tilting (FMTT), which provably performs better ascent on the reward than standard test-time methods.
  arXiv  Detail & Related papers  (2025-11-27T18:44:12Z)
• Stability Bounds for Smooth Optimal Transport Maps and their Statistical Implications [16.906924555293916]
  We focus on plugin estimators derived from the optimal transport (OT) map between two probability distributions.<n>We develop novel stability bounds for OT maps which generalize those in past work.<n>As an illustrative application, we develop and analyze a novel tuning parameter-free estimator for the OT map between two strongly log-concave distributions.
  arXiv  Detail & Related papers  (2025-02-17T21:17:03Z)
• Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plan [5.374547520354591]
  Semi-dual Neural OT, a widely used approach for learning OT Maps with neural networks, often generates spurious solutions that fail to transfer one distribution to another accurately.<n>We propose a novel method, OTP, which learns both the OT Map and the Optimal Transport Plan, representing the optimal coupling between two distributions.<n>Our experiments show that the OTP model recovers the optimal transport map where existing methods fail and outperforms current OT-based models in image-to-image translation tasks.
  arXiv  Detail & Related papers  (2025-02-07T00:37:12Z)
• A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solvers [70.37553728026309]
  In this paper, we establish upper bounds on the generalization error of an approximate OT map recovered by the minimax quadratic OT solver.<n>While our analysis focuses on the quadratic OT, we believe that similar bounds could be derived for general OT case, paving the promising direction for future research.
  arXiv  Detail & Related papers  (2025-02-03T12:37:20Z)
• Optimal transport map estimation in general function spaces [17.323588442718926]
  We study the problem of estimating a function $T$ given independent samples from a distribution $P$ and from the pushforward distribution $T_sharp P$. This setting is motivated by applications in the sciences, where $T$ represents the evolution of a physical system over time. We present a unified methodology for obtaining rates of estimation of optimal transport maps in general function spaces.
  arXiv  Detail & Related papers  (2022-12-07T15:42:11Z)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark [133.46066694893318]
  We evaluate the performance of neural network-based solvers for optimal transport. We find that existing solvers do not recover optimal transport maps even though they perform well in downstream tasks.
  arXiv  Detail & Related papers  (2021-06-03T15:59:28Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)
• Statistical Optimal Transport posed as Learning Kernel Embedding [0.0]
  This work takes the novel approach of posing statistical Optimal Transport (OT) as that of learning the transport plan's kernel mean embedding from sample based estimates of marginal embeddings. A key result is that, under very mild conditions, $epsilon$-optimal recovery of the transport plan as well as the Barycentric-projection based transport map is possible with a sample complexity that is completely dimension-free.
  arXiv  Detail & Related papers  (2020-02-08T14:58:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.