mlsanityData to 7 Oct 2026

Strongly Isomorphic Neural Optimal Transport Across Incomparable Spaces

arXiv 2407.14957 ↗First posted 20 Jul 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Optimal Transport (OT) has recently emerged as a powerful framework for learning minimal-displacement maps between distributions. The predominant approach involves a neural parametrization of the Monge formulation of OT, typically assuming the same space for both distributions. However, the setting across ``incomparable spaces'' (e.g., of different dimensionality), corresponding to the Gromov- Wasserstein distance, remains underexplored, with existing methods often imposing restrictive assumptions on the cost function. In this paper, we present a novel neural formulation of the Gromov-Monge (GM) problem rooted in one of its fundamental properties: invariance to strong isomorphisms. We operationalize this property by decomposing the learnable OT map into two components: (i) an approximate strong isomorphism between the source distribution and an intermediate reference distribution, and (ii) a GM-optimal map between this reference and the target distribution. Our formulation leverages and extends the Monge gap regularizer of Uscidda & Cuturi (2023) to eliminate the need for complex architectural requirements of other neural OT methods, yielding a simple but practical method that enjoys favorable theoretical guarantees. Our preliminary empirical results show that our framework provides a promising approach to learn OT maps across diverse spaces.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 39 references that are in the map. First posted on arXiv 20 Jul 2024.

Builds on

18 of 39 references.

References · 18

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2015Variational Inference with Normalizing Flowscited by 2,161
  4. 2017Generative Adversarial Networks: An Overviewcited by 588
  5. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  6. 2019Optimal transport mapping via input convex neural networkscited by 202
  7. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  8. 2022Neural Optimal Transportcited by 123
  9. 2019Wasserstein-2 Generative Networkscited by 96
  10. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 96
  11. 2019Learning Generative Models across Incomparable Spacescited by 53
  12. 2021Cross-Domain Imitation Learning via Optimal Transportcited by 49
6 more
  1. 2021Neural Monge Map estimation and its applicationscited by 40
  2. 2023The Monge Gap: A Regularizer to Learn All Transport Mapscited by 32
  3. 2020Non-Euclidean Universal Approximationcited by 29
  4. 2022On the existence of Monge maps for the Gromov-Wasserstein problemcited by 16
  5. 2020A contribution to Optimal Transport on incomparable spacescited by 14
  6. 2023Structured Transforms Across Spaces with Cost-Regularized Optimal Transportcited by 8

Built on by

Not cited yet.