mlsanityData to 14 Oct 2026

Structured Matching via Cost-Regularized Unbalanced Optimal Transport

arXiv 2511.19075 ↗First posted 24 Nov 2025stat.ML cs.LG stat.APcited by 0

Not on the map. Why?

Abstract (arXiv)

Unbalanced optimal transport (UOT) provides a flexible way to match or compare nonnegative finite Radon measures. However, UOT requires a predefined ground transport cost, which may misrepresent the data's underlying geometry. Choosing such a cost is particularly challenging when datasets live in heterogeneous spaces, often motivating practitioners to adopt Gromov-Wasserstein formulations. To address this challenge, we introduce cost-regularized unbalanced optimal transport (CR-UOT), a framework that allows the ground cost to vary while allowing mass creation and removal. We show that CR-UOT incorporates unbalanced Gromov-Wasserstein type problems through families of inner-product costs parameterized by linear transformations, enabling the matching of measures or point clouds across Euclidean spaces. We develop algorithms for such CR-UOT problems using entropic regularization and demonstrate that this approach improves the alignment of heterogeneous single-cell omics profiles, especially when many cells lack direct matches.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 44 references that are in the map. First posted on arXiv 24 Nov 2025.

Builds on

19 of 44 references.

References · 19

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  3. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  5. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
  6. 2018Optimal Transport for structured data with application on graphscited by 172
  7. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
  8. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 126
  9. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
  10. 2021Entropic estimation of optimal transport mapscited by 90
  11. 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
  12. 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 55
7 more
  1. 2023Unbalancedness in Neural Monge Maps Improves Unpaired Domain Translationcited by 33
  2. 2022Aligning individual brains with Fused Unbalanced Gromov-Wassersteincited by 23
  3. 2020A contribution to Optimal Transport on incomparable spacescited by 15
  4. 2023Slicing Unbalanced Optimal Transportcited by 10
  5. 2023Structured Transforms Across Spaces with Cost-Regularized Optimal Transportcited by 8
  6. 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Losscited by 7
  7. 2025Unsupervised Learning for Optimal Transport plan prediction between unbalanced graphscited by 3

Built on by

Not cited yet.