mlsanityData to 7 Oct 2026

Learning Generative Models across Incomparable Spaces

arXiv 1905.05461 ↗First posted 14 May 2019cs.LG stat.MLcited by 53

Not on the map. Why?

Abstract (arXiv)

Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety. However, in some cases, we may want to only learn some aspects (e.g., cluster or manifold structure), while modifying others (e.g., style, orientation or dimension). In this work, we propose an approach to learn generative models across such incomparable spaces, and demonstrate how to steer the learned distribution towards target properties. A key component of our model is the Gromov-Wasserstein distance, a notion of discrepancy that compares distributions relationally rather than absolutely. While this framework subsumes current generative models in identically reproducing distributions, its inherent flexibility allows application to tasks in manifold learning, relational learning and cross-domain learning.

Key facts. Cited by 53 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 13; 2022: 11; 2023: 16; 2024: 5; 2025: 4; 2026: 4.

53 papers.

Sort:

By area:

  1. 2023Diff-Instruct: A Universal Approach for Transferring Knowledge From Pre-trained Diffusion Modelscited by 232
  2. 2021Minibatch optimal transport distances; analysis and applicationscited by 62
  3. 2021Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costscited by 61
  4. 2022Unbalanced Optimal Transport, from Theory to Numericscited by 45
  5. 2021A Survey on Optimal Transport for Machine Learning: Theory and Applicationscited by 35
  6. 20213D Pose Transfer with Correspondence Learning and Mesh Refinementcited by 30
  7. 2022Your Contrastive Learning Is Secretly Doing Stochastic Neighbor Embeddingcited by 28
  8. 2023Scalable Optimal Transport Methods in Machine Learning: A Contemporary Surveycited by 27
  9. 2022Unsupervised 3D Pose Transfer with Cross Consistency and Dual Reconstructioncited by 21
  10. 2021Quantized Gromov-Wassersteincited by 18
  11. 2022Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metricscited by 18
  12. 2021On Transportation of Mini-batches: A Hierarchical Approachcited by 15
38 more
  1. 2023Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transportcited by 15
  2. 2021Entropy Partial Transport with Tree Metrics: Theory and Practicecited by 13
  3. 2021Entropic Gromov-Wasserstein between Gaussian Distributionscited by 12
  4. 2022OTAdapt: Optimal Transport-based Approach For Unsupervised Domain Adaptationcited by 12
  5. 2022Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsificationcited by 11
  6. 2023Scalable Unbalanced Sobolev Transport for Measures on a Graphcited by 10
  7. 2023A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Datacited by 10
  8. 2023Semidefinite Relaxations of the Gromov-Wasserstein Distancecited by 10
  9. 2023Optimal Transport for Measures with Noisy Tree Metriccited by 7
  10. 2022Online Learning to Transport via the Minimal Selection Principlecited by 6
  11. 2023Outlier-Robust Gromov-Wasserstein for Graph Datacited by 6
  12. 2025Geometry-Preserving Encoder/Decoder in Latent Generative Modelscited by 6
  13. 2021Sliced Multi-Marginal Optimal Transportcited by 5
  14. 2021Cycle Consistent Probability Divergences Across Different Spacescited by 5
  15. 2023Personalised Federated Learning On Heterogeneous Feature Spacescited by 5
  16. 2023Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Spacecited by 4
  17. 2022MoReL: Multi-omics Relational Learningcited by 3
  18. 2022Improving Generative Flow Networks with Path Regularizationcited by 3
  19. 2023Monotone Generative Modeling via a Gromov-Monge Embeddingcited by 3
  20. 2024OTCXR: Rethinking Self-supervised Alignment using Optimal Transport for Chest X-ray Analysiscited by 3
  21. 2021Sketching Merge Trees for Scientific Data Visualizationcited by 2
  22. 2021Music-to-Dance Generation with Optimal Transportcited by 2
  23. 2023CROVIA: Seeing Drone Scenes from Car Perspective via Cross-View Adaptationcited by 2
  24. 2023Learning representations that are closed-form Monge mapping optimal with application to domain adaptationcited by 2
  25. 2023Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Arecited by 2
  26. 2024Fast Gradient Computation for Gromov-Wasserstein Distancecited by 2
  27. 2024Improving Hyperbolic Representations via Gromov-Wasserstein Regularizationcited by 2
  28. 2021Heterogeneous Wasserstein Discrepancy for Incomparable Distributionscited by 1
  29. 2022Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Datacited by 1
  30. 2022Hybrid Gromov-Wasserstein Embedding for Capsule Learningcited by 1
  31. 2023Revisiting invariances and introducing priors in Gromov-Wasserstein distancescited by 1
  32. 2023Robust Point Matching with Distance Profilescited by 1
  33. 2025Robust Alignment via Partial Gromov-Wasserstein Distancescited by 1
  34. 2024Strongly Isomorphic Neural Optimal Transport Across Incomparable Spacescited by 0
  35. 2024Note on computational complexity of the Gromov-Wasserstein distancecited by 0
  36. 2025Relation-Aware Slicing in Cross-Domain Alignmentcited by 0
  37. 2025Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numericcited by 0
  38. 2026SGW-GAN: Sliced Gromov-Wasserstein Guided GANs for Retinal Fundus Image Enhancementcited by 0

50 most cited of 53 All 53 (JSON)