Generalized Dimension Reduction Using Semi-Relaxed Gromov-Wasserstein Distance
Not on the map. Why?
Abstract (arXiv)
Dimension reduction techniques typically seek an embedding of a high-dimensional point cloud into a low-dimensional Euclidean space which optimally preserves the geometry of the input data. Based on expert knowledge, one may instead wish to embed the data into some other manifold or metric space in order to better reflect the geometry or topology of the point cloud. We propose a general method for manifold-valued multidimensional scaling based on concepts from optimal transport. In particular, we establish theoretical connections between the recently introduced semi-relaxed Gromov-Wasserstein (srGW) framework and multidimensional scaling by solving the Monge problem in this setting. We also derive novel connections between srGW distance and Gromov-Hausdorff distance. We apply our computational framework to analyze ensembles of political redistricting plans for states with two Congressional districts, achieving an effective visualization of the ensemble as a distribution on a circle which can be used to characterize typical neutral plans, and to flag outliers.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 May 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 4; 2025: 2; 2026: 7.
13 papers.
Sort:
By area:
- 2024The Z-Gromov-Wasserstein Distancecited by 12
- 2024On Probabilistic Embeddings in Optimal Dimension Reductioncited by 5
- 2025A dimensionality reduction technique based on the Gromov-Wasserstein distancecited by 3
- 2024Metric properties of partial and robust Gromov-Wasserstein distancescited by 2
- 2025Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalizationcited by 2
- 2026Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transportcited by 2
- 2026Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clusteringcited by 1
- 2024On Robust Cross Domain Alignmentcited by 0
- 2026Feature-based morphological analysis of shape graph datacited by 0
- 2026Fused Gromov-Wasserstein Distance with Feature Selectioncited by 0
- 2026Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Modelscited by 0
- 2026Network Learning with Semi-relaxed Gromov-Wassersteincited by 0
1 more
- 2026Gromov-Wasserstein Distillation for Inductive Multi-View Embedding30 Sep 2026
- 2026Network Learning with Semi-relaxed Gromov-Wasserstein1 Jun 2026
- 2026Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models27 May 2026
- 2026Fused Gromov-Wasserstein Distance with Feature Selection12 May 2026
- 2026Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clustering26 Apr 2026
- 2026Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transport3 Apr 2026
- 2026Feature-based morphological analysis of shape graph data18 Feb 2026
- 2025Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalization11 Feb 2025
- 2025A dimensionality reduction technique based on the Gromov-Wasserstein distance23 Jan 2025
- 2024On Robust Cross Domain Alignment20 Dec 2024
- 2024Metric properties of partial and robust Gromov-Wasserstein distances4 Nov 2024
- 2024The Z-Gromov-Wasserstein Distance15 Aug 2024
1 more
- 2024The Z-Gromov-Wasserstein Distancecited by 12
- 2024On Probabilistic Embeddings in Optimal Dimension Reductioncited by 5
- 2025A dimensionality reduction technique based on the Gromov-Wasserstein distancecited by 3
- 2024Metric properties of partial and robust Gromov-Wasserstein distancescited by 2
- 2025Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalizationcited by 2
- 2026Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transportcited by 2
- 2026Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clusteringcited by 1
- 2024On Robust Cross Domain Alignmentcited by 0
- 2026Feature-based morphological analysis of shape graph datacited by 0
- 2026Fused Gromov-Wasserstein Distance with Feature Selectioncited by 0
- 2026Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Modelscited by 0
- 2026Network Learning with Semi-relaxed Gromov-Wassersteincited by 0
- 2026Network Learning with Semi-relaxed Gromov-Wasserstein1 Jun 2026
- 2026Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models27 May 2026
- 2026Fused Gromov-Wasserstein Distance with Feature Selection12 May 2026
- 2026Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clustering26 Apr 2026
- 2026Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transport3 Apr 2026
- 2026Feature-based morphological analysis of shape graph data18 Feb 2026
- 2025Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalization11 Feb 2025
- 2025A dimensionality reduction technique based on the Gromov-Wasserstein distance23 Jan 2025
- 2024On Robust Cross Domain Alignment20 Dec 2024
- 2024Metric properties of partial and robust Gromov-Wasserstein distances4 Nov 2024
- 2024The Z-Gromov-Wasserstein Distance15 Aug 2024
- 2024On Probabilistic Embeddings in Optimal Dimension Reduction5 Aug 2024