mlsanityData to 7 Oct 2026

Joint Optimal Transport and Embedding for Network Alignment

arXiv 2502.19334 ↗First posted 26 Feb 2025cs.AI cs.LG cs.SIcited by 10

Not on the map. Why?

Abstract (arXiv)

Network alignment, which aims to find node correspondence across different networks, is the cornerstone of various downstream multi-network and Web mining tasks. Most of the embedding-based methods indirectly model cross-network node relationships by contrasting positive and negative node pairs sampled from hand-crafted strategies, which are vulnerable to graph noises and lead to potential misalignment of nodes. Another line of work based on the optimal transport (OT) theory directly models cross-network node relationships and generates noise-reduced alignments. However, OT methods heavily rely on fixed, pre-defined cost functions that prohibit end-to-end training and are hard to generalize. In this paper, we aim to unify the embedding and OT-based methods in a mutually beneficial manner and propose a joint optimal transport and embedding framework for network alignment named JOENA. For one thing (OT for embedding), through a simple yet effective transformation, the noise-reduced OT mapping serves as an adaptive sampling strategy directly modeling all cross-network node pairs for robust embedding learning.For another (embedding for OT), on top of the learned embeddings, the OT cost can be gradually trained in an end-to-end fashion, which further enhances the alignment quality. With a unified objective, the mutual benefits of both methods can be achieved by an alternating optimization schema with guaranteed convergence. Extensive experiments on real-world networks validate the effectiveness and scalability of JOENA, achieving up to 16% improvement in MRR and 20x speedup compared with the state-of-the-art alignment methods.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 32 of its 87 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

32 of 87 references.

References · 32

  1. 2017Inductive Representation Learning on Large Graphscited by 6,284
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  4. 2018Deep Graph Infomaxcited by 1,101
  5. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  6. 2018Computational Optimal Transportcited by 765
  7. 2019Position-aware Graph Neural Networkscited by 203
  8. 2018Optimal Transport for structured data with application on graphscited by 170
  9. 2016Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignmentcited by 128
  10. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 125
  11. 2019Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphscited by 106
  12. 2019Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matchingcited by 102
20 more
  1. 2019GOT: An Optimal Transport framework for Graph comparisoncited by 64
  2. 2021EE-Net: Exploitation-Exploration Neural Networks in Contextual Banditscited by 43
  3. 2018REGAL: Representation Learning-based Graph Alignmentcited by 40
  4. 2023Networked Time Series Imputation via Position-aware Graph Enhanced Variational Autoencoderscited by 32
  5. 2018AceKG: A Large-scale Knowledge Graph for Academic Data Miningcited by 28
  6. 2023Ensuring User-side Fairness in Dynamic Recommender Systemscited by 27
  7. 2024Towards Unified Multi-Modal Personalization: Large Vision-Language Models for Generative Recommendation and Beyondcited by 25
  8. 2023Hierarchical Multi-Marginal Optimal Transport for Network Alignmentcited by 24
  9. 2020COPT: Coordinated Optimal Transport for Graph Sketchingcited by 17
  10. 2022COIN: Co-Cluster Infomax for Bipartite Graphscited by 14
  11. 2024APEX2: Adaptive and Extreme Summarization for Personalized Knowledge Graphscited by 13
  12. 2021Unsupervised Belief Representation Learning with Information-Theoretic Variational Graph Auto-Encoderscited by 12
  13. 2023STERLING: Synergistic Representation Learning on Bipartite Graphscited by 12
  14. 2023Privacy-Preserving Graph Machine Learning from Data to Computation: A Surveycited by 10
  15. 2024A Collaborative Ensemble Framework for CTR Predictioncited by 10
  16. 2019Optimal Transport-based Alignment of Learned Character Representations for String Similaritycited by 7
  17. 2022WL-Align: Weisfeiler-Lehman Relabeling for Aligning Users across Networks via Regularized Representation Learningcited by 7
  18. 2023Neural Exploitation and Exploration of Contextual Banditscited by 7
  19. 2021Graph Matching via Optimal Transportcited by 6
  20. 2019Domain-adversarial Network Alignmentcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 6.

10 papers.