paper-with-me

홈 › Papers

Structure-Preserving Multi-View Embedding Using Gromov-Wasserstein Optimal Transport

2026-04-03 · Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante arxiv

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.

📄 PDF Abstract BibTeX arXiv:2604.02610

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Similar Papers 제목 키워드 기반

Gromov-Wasserstein Methods for Multi-View Relational Embedding and Clustering

2026-04-26 · Rafael Pereira Eufrazio, Eduardo Fernandes Montesuma, Charles Casimiro Cavalcante 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 d…

Gromov-Wasserstein Learning for Graph Matching and Node Embedding

2019-01-17 · Hongteng Xu, Dixin Luo, Hongyuan Zha, Lawrence Carin

A novel Gromov-Wasserstein learning framework is proposed to jointly match (align) graphs and learn embedding vectors for the associated graph nodes. Using Gromov-Wasserstein discrepancy, we measure the dissimilarity bet…

Graph Matching

Improving Hyperbolic Representations via Gromov-Wasserstein Regularization

2024-07-15 · Yifei Yang, Wonjun Lee, Dongmian Zou, Gilad Lerman

Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations …

Few-Shot Image Classificationimage-classificationImage ClassificationLink Prediction+1

Learning Structure-enhanced Temporal Point Processes with Gromov-Wasserstein Regularization

2025-03-29 · Qingmei Wang, Fanmeng Wang, Bing Su, Hongteng Xu

Real-world event sequences are often generated by different temporal point processes (TPPs) and thus have clustering structures. Nonetheless, in the modeling and prediction of event sequences, most existing TPPs ignore t…

ClusteringPoint Processes

$k$-Nearest Neighbors in Gromov--Wasserstein Space

2026-06-09 · Kaitlyn Hohmeier, Nicolas Fraiman, Caroline Moosmueller arxiv

The Gromov--Wasserstein (GW) distance provides a framework for comparing metric measure spaces, regardless of their underlying structure or geometry. For network-based data, it enables direct comparisons of graphs with d…