Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clustering
Not on the map. Why?
Abstract (arXiv)
Learning low-dimensional representations from multi-view relational data is challenging when underlying geometries differ across views. We propose Bary-GWMDS, a Gromov-Wasserstein-based method that operates directly on distance matrices to learn a consensus embedding preserving shared relational structure. By leveraging intrinsic distances, the approach naturally handles nonlinear distortions across views. We also introduce Mean-GWMDS-C, a clustering-oriented formulation that averages distance matrices and learns reduced-support representations via a consensus Gromov-Wasserstein transport. Experiments on synthetic and real-world datasets show that the proposed framework yields stable and geometrically meaningful embeddings.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 26 Apr 2026.
Builds on
7 of 23 references.
References · 7
- 2013A Survey on Multi-view Learningcited by 152
- 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
- 2024Generalized Dimension Reduction Using Semi-Relaxed Gromov-Wasserstein Distancecited by 13
- 2024Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wassersteincited by 12
- 2021Multi-view Data Visualisation via Manifold Learningcited by 7
- 2025A dimensionality reduction technique based on the Gromov-Wasserstein distancecited by 3
- 2026Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transportcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.