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