Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transport
Authors: Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante
Organizations: Instituto Federal de Educação, Ciência e Tecnologia do Ceará, Canindé, Ceará, Brazil · Department of Teleinformatics Engineering, Federal University of Ceará, Fortaleza, Ceará, Brazil · Sigma Nova, Paris, France
Multi-view data analysis seeks to integrate multiple representations of the same samples in order to recover a coherent low-dimensional structure. Classical approaches often rely on feature concatenation or explicit alignment assumptions, which become restrictive under heterogeneous geometries or nonlinear distortions. In this work, we propose two geometry-aware multi-view embedding strategies grounded in Gromov-Wasserstein (GW) optimal transport. The first, termed Mean-GWMDS, aggregates view-specific relational information by averaging distance matrices and applying GW-based multidimensional scaling to obtain a representative embedding. The second strategy, referred to as Multi-GWMDS, adopts a selection-based paradigm in which multiple geometry-consistent candidate embeddings are generated via GW-based alignment and a representative embedding is selected. Experiments on synthetic manifolds and real-world datasets show that the proposed methods effectively preserve intrinsic relational structure across views. These results highlight GW-based approaches as a flexible and principled framework for multi-view representation learning.
Figures & tables
Multi GWMDS
Mean GWMDS
CCA
MCCA
MVMDS
S-curve
view 1
0.8484
0.7750
0.7776
0.7726
0.7748
view 2
0.8530
0.9334
0.8878
0.8545
0.8491
mean
0.8507
0.8542
0.8327
0.8135
0.8119
Swiss Roll
view 1
0.7762
0.8095
0.7620
0.7418
0.8235
view 2
0.9289
0.9055
0.8066
0.4527
0.8872
mean
0.8525
0.8575
0.7843
0.5973
0.8554
Table 1: Correlation results for each view across different multi-view methods. For Multi-GWMDS and Mean-GWMDS, Euclidean distances are used to construct the relational structures in each view.
Figure 1: Embeddings obtained on the S-curve dataset using different multi-view methods.
Multi-GWMDS
Mean-GWMDS
Multi-Isomap
S-curve
view 1
0.9556
0.9788
0.8009
view 2
0.9811
0.9765
0.8197
mean
0.9684
0.9777
0.8103
Swiss Roll
view 1
0.9771
0.8507
0.7472
view 2
0.3002
0.6452
0.6833
mean
0.6387
0.7480
0.7153
Table 2: Correlation results for each view across different multi-view methods. For all methods, relational structures are constructed from geodesic distance.
Figure 2: Embeddings obtained on the S-curve dataset using different multi-view strategies with geodesic distance.
Figure 3: Low-dimensional embeddings of the Electricity Load Diagrams (ELD) dataset obtained using different multi-view methods under geodesic distances.
Figure 4: Low-dimensional embeddings of the Electricity Load Diagrams (ELD) dataset obtained with Multi-GWMDS using geodesic distances. Each panel corresponds to an embedding induced by a different view.
Geodesic distances
Multi-GWMDS
Mean-GWMDS
Multi-Isomap
view 1
0.3342
0.4814
0.2956
view 2
0.3891
0.5004
0.3484
view 3
0.7913
0.4771
0.3697
view 4
0.3950
0.5036
0.3744
mean
0.4774
0.4906
0.3470
Table 3: Correlation between the low-dimensional embeddings and the ground-truth temporal manifold coordinates on the Electricity Load Diagrams (ELD) dataset. Results are reported using geodesic distances (top block) and Euclidean distances (bottom block).
Figure 5: Embeddings on the Electricity Load Diagrams dataset obtained with different multi-view methods. Multi-GWMDS and Mean-GWMDS use Euclidean distances and are contrasted with Euclidean and correlation-based baselines.
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.
Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante
Instituto Federal de Educação, Ciência e Tecnologia do Ceará, Canindé, Ceará, Brazil · Federal University of Ceara, Fortaleza, Ceará, Brazil · Sigma Nova, Paris, France
Gromov-Wasserstein multidimensional scaling (GW-MDS) learns low-dimensional representations from relational data but remains transductive, providing no explicit mapping for unseen samples. We introduce an inductive framework based on barycentric distillation. A GW-MDS teacher learns a latent support and an optimal transport plan from the training data, and barycentric projection converts the resulting coupling into sample-aligned targets. A neural student then learns an explicit out-of-sample mapping, avoiding additional relational-matrix construction and GW optimization at inference. We formulate the approach for single-view data and extend it to Mean-GWMDS and Multi-GWMDS teachers through consensus and selected-projection targets learned by a multi-view student with view-specific encoders. We also investigate a direct neural baseline trained solely with a GW objective. Experiments on synthetic and real-world data using Euclidean, geodesic, and cosine relations show that the distilled models preserve the teacher geometry on unseen samples and consistently outperform direct neural GW training in sample-indexed relational preservation. These results establish barycentric projection as an effective bridge between transductive GW embeddings and inductive neural mappings.
Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante
Instituto Federal do Ceará (IFCE) Canindé, Ceará, Brazil · Federal University of Ceará (UFC) Fortaleza, Ceará, Brazil · Sigma Nova Paris, France
Multi-view learning jointly exploits multiple complementary representations of the same data and has become increasingly important in machine learning. However, the Python ecosystem lacks actively maintained, unified tooling for end-to-end multi-view workflows. In this paper, we present polyview, a Python package that provides tools for multi-view embedding, clustering, fusion, and view augmentation, as well as for handling incomplete views, all compatible with scikit-learn. The library offers a unified interface for composing heterogeneous multi-view workflows, including seamless transitions between multi-view and single-view stages. It is built around a core set of classes and utilities that enable composition of different methods and straightforward implementation of new ones. We illustrate the package on five real multi-view datasets and compare its components based on canonical correlation analysis with those of two established libraries. polyview aims to be both a practical toolkit for benchmarking and prototyping multi-view methods and a foundation for future research and development in this area.