Nonlinear dimensionality reduction through optimal transport between incomparable spaces

Abstract We study a dimensionality reduction method grounded in optimal transport theory, leveraging the Gromov–Wasserstein (GW) distance to align the relational geometry of data across incomparable spaces. Building on recent advances that connect GW and semi-relaxed GW formulations with multidimensional scaling, we adopt a probabilistic perspective in which MDS and Isomap can be viewed through soft correspondences defined by optimal transport plans rather than rigid one-to-one mappings. Our approach, termed Gromov–Wasserstein MDS (GW-MDS), seeks a low-dimensional embedding whose pairwise distances match the structural relationships of the original space under a GW objective. We also investigate a semi-relaxed variant (srGW-MDS) that fixes only the marginal over the original data distribution, allowing greater flexibility in the embedding space. We further analyze the integration of Euclidean and graph-based geodesic distance within this framework and provide a convergence analysis for the proposed alternating optimization scheme. Experiments on synthetic manifolds and real datasets demonstrate the impact of geodesic structure preservation and highlight the robustness of the semi-relaxed formulation in low-sample regimes.

Authors

Institutions

Publication Details

Journal
Information Geometry
Published
2026-05-21
DOI
https://doi.org/10.1007/s41884-026-00208-4
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nonlinear dimensionality reduction through optimal transport between incomparable spaces

Charles C. Cavalcante, Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma
Information Geometry
3D Shape Modeling and Analysis
article

Nonlinear dimensionality reduction through optimal transport between incomparable spaces

Charles C. Cavalcante, Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma
article en

Abstract

Abstract We study a dimensionality reduction method grounded in optimal transport theory, leveraging the Gromov–Wasserstein (GW) distance to align the relational geometry of data across incomparable spaces. Building on recent advances that connect GW and semi-relaxed GW formulations with multidimensional scaling, we adopt a probabilistic perspective in which MDS and Isomap can be viewed through soft correspondences defined by optimal transport plans rather than rigid one-to-one mappings. Our approach, termed Gromov–Wasserstein MDS (GW-MDS), seeks a low-dimensional embedding whose pairwise distances match the structural relationships of the original space under a GW objective. We also investigate a semi-relaxed variant (srGW-MDS) that fixes only the marginal over the original data distribution, allowing greater flexibility in the embedding space. We further analyze the integration of Euclidean and graph-based geodesic distance within this framework and provide a convergence analysis for the proposed alternating optimization scheme. Experiments on synthetic manifolds and real datasets demonstrate the impact of geodesic structure preservation and highlight the robustness of the semi-relaxed formulation in low-sample regimes.

Information Geometry
Universidade Federal do Ceará (BR), Instituto Federal de Educação, Ciência e Tecnologia do Ceará (BR), Novartis (France) (FR)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Conselho Nacional de Desenvolvimento Científico e Tecnológico
Sustainable cities and communities
Openalex Percentile: Top 6%
3D Shape Modeling and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.