mlsanityData to 7 Oct 2026

Conditional Random Ordered Transport Spaces

arXiv 2606.08113 ↗First posted 6 Jun 2026cs.LG math.FA math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

A small Wasserstein distance does not certify that a transformation is admissible. In evidence-constrained, semantic, causal, physical, monotone, or risk-sensitive learning, one must ask not only how far two probability laws are, but whether mass has moved in a direction allowed by available information. We introduce conditional random ordered transport spaces (CROTS), a class of (L0)-valued spaces of random probability measures equipped with a Wasserstein ambient metric, a closed stochastic order, hard and soft ordered transport discrepancies, and a conditional risk functional for evaluating order violation under an evidence sigma-field. The central object is an order-admissible transport geometry for random measure-valued dynamics, distinct from cone-valued metrics, ordered Kantorovich constructions, random Wasserstein spaces alone, and model-specific residuals for generative paths. We develop the foundations of CROTS as a space theory for reliable distributional learning. The results include well-posedness and duality for hard and soft ordered transport, soft-to-hard variational convergence, measurability and completeness of the random lifted space, reductions to classical Wasserstein and ordered geometries, ordered geodesics, constrained barycenters and projections, conditional risk-transport duality, and separation of order-violating distributions. The main stability theorem shows that random learning dynamics may converge in the ambient Wasserstein metric while its local admissibility leakage follows a separate conditional order-risk recursion. The resulting asymptotic order-risk floor provides a mathematical language for evidence overreach, ordered distribution shift, robustness failure, and admissible distributional dynamics.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 31 references that are in the map. First posted on arXiv 6 Jun 2026.

Builds on

10 of 31 references.

References · 10

  1. 2018Computational Optimal Transportcited by 765
  2. 2024Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matchingcited by 34
  3. 2024Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifoldscited by 28
  4. 2014Nuclear Norm based Matrix Regression with Applications to Face Recognition with Occlusion and Illumination Changescited by 19
  5. 2022Tangential Wasserstein Projectionscited by 4
  6. 2024ERDDCI: Exact Reversible Diffusion via Dual-Chain Inversion for High-Quality Image Editingcited by 4
  7. 2025Straighten Viscous Rectified Flow via Noise Optimizationcited by 4
  8. 2018Stochastic order on metric spaces and the ordered Kantorovich monadcited by 1
  9. 2024Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Directioncited by 1
  10. 2026L2 over Wasserstein: Statistical Analysis for Optimal Transportcited by 1

Built on by

Not cited yet.