Joint Optimal Transport and Embedding for Network Alignment
Qi Yu, Zhichen Zeng, Yuchen Yan, Lei Ying, R. Srikant, Hanghang Tong
Abstract
Network alignment, which aims to find node correspondence across different networks, is the cornerstone of various downstream multinetwork 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 20× speedup compared with the state-of-the-art alignment methods. CCS Concepts • Computing methodologies → Machine learning; • Information systems → Data mining; World Wide Web.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 09f0c6be-3219-48e6-8dfb-1fdee000f041Cited by top-tier papers8
- PLANETALIGN: A Comprehensive Python Library for Benchmarking Network AlignmentQi Yu, Zhichen Zeng, Yuchen Yan, Zhining Liu et al.ICLR 2026 · 12 citations
- Graph Data Selection for Domain Adaptation: A Model-Free ApproachTing-Wei Li, Ruizhong Qiu, Hanghang TongNeurIPS 2025 · 7 citations
- Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence RecommendationXiao Lin, Zhicheng Tang, Weilin Cong, Mengyue Hang et al.WWW 2026 · 3 citations
- Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learningRuizhong Qiu, Ting-Wei Li, Gaotang Li, Hanghang TongICLR 2026 · 2 citations
- AvAtar: Learning to Align via Active Optimal TransportQi Yu, Ruizhong Qiu, Zhichen Zeng, My T. Thai et al.ICML 2026 · 1 citation
Builds on32
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan et al.ICLR 2020 · 1,155 citations
- InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information MaximizationFan-Yun Sun, Jordan Hoffmann, Vikas Verma, Jian TangICLR 2020 · 1,010 citations
- Graph Optimal Transport for Cross-Domain AlignmentLiqun Chen, Zhe Gan, Yu Cheng, Linjie Li et al.ICML 2020 · 193 citations
- Dynamic Knowledge Graph AlignmentYuchen Yan, Lihui Liu, Yikun Ban, Baoyu Jing et al.AAAI 2021 · 100 citations
Related papers
- Hierarchical Multi-Marginal Optimal Transport for Network AlignmentZhichen Zeng, Boxin Du, Si Zhang, Yinglong Xia et al.AAAI 2024 · 39 citations
- Contrastive Multi-View Multiplex Network Embedding with Applications to Robust Network AlignmentHao Xiong, Junchi Yan, Li PanKDD 2021 · 26 citations
- Robust Attributed Graph Alignment via Joint Structure Learning and Optimal TransportJianheng Tang, Weiqi Zhang, Jiajin Li, Kangfei Zhao et al.ICDE 2023 · 32 citations
- SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge EnhancementChenxu Wang, Wencong Lin, Pinghui Wang, Tao Qin et al.KDD 2026
- NetTrans: Neural Cross-Network TransformationSi Zhang, Hanghang Tong, Yinglong Xia, Liang Xiong et al.KDD 2020 · 30 citations
