Papers › Joint Optimal Transport and Embedding for Network Alignment

Joint Optimal Transport and Embedding for Network Alignment

26 Feb 2025arXiv:2502.19334archive 2025-07-28

Qi Yu, Zhichen Zeng, Yuchen Yan, Lei Ying, R. Srikant, Hanghang Tong

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.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 13 code samples harvested from 1 repository linked to this paper: 12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 13 samples from 1 repository, 12 ran (12 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-24 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

yq-leo/JOENA-WWW25 officialpytorchMITSyntology: 13 samples, 12 ran (0 instrument-failed) · 1 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested: 12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

12ran
1unverified

Licence: 0 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from yq-leo/JOENA-WWW25. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 3 samples that ran, the graph records a signature this page does not show: an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

yq-leo/JOENA-WWW25 official repository 13 samples, 12 ran (0 instrument-failed) · 1 unverified
build_nx_graph utils/dataset.py ran MIT (permissive) · 40068921b63e68e3 · report fixture: signature edge_index:list/1/tuple, anchor_nodes:list/1/int, x:ndarray/2/float · returned Graph · level recorded 2026-09-24
build_tg_graph utils/dataset.py ran MIT (permissive) · 23bc410c442e6d43 · report fixture: signature edge_index:ndarray/2/int, x:ndarray/2/float, rwr:ndarray/1/float, dtype:dtype/0/? · returned Data · level recorded 2026-09-24
compute_distance_matrix in 7 papers utils/metrics.py ran fingerprinted MIT (permissive) · 9166ebcdd0e8461d · report fixture: signature emb1:Tensor/2/float, emb2:Tensor/2/float · returned Tensor · level recorded 2026-09-24
compute_metrics_ltr utils/metrics.py ran MIT (permissive) · 46b3039b618c6d32 · report fixture: signature dissimilarity:Tensor/2/float, test_pairs:ndarray/2/int, hit_top_ks:tuple/1/int · returned tuple · level recorded 2026-09-25
compute_metrics_rtl utils/metrics.py ran MIT (permissive) · 8d9b40416838b0ea · report fixture: signature dissimilarity:Tensor/2/float, test_pairs:ndarray/2/int, hit_top_ks:tuple/1/int · returned tuple · level recorded 2026-09-24
get_dist_max utils/anchor.py ran MIT (permissive) · d988e6873e369fc9 · report fixture: signature anchorsets:list/1/list, dist:Tensor/2/float, device:str/0/str · returned tuple · level recorded 2026-09-25
get_random_anchorsets utils/anchor.py ran MIT (permissive) · 6b4cd1275c483693 · report fixture: signature num:int/0/int, c:float/0/float · returned list · level recorded 2026-09-24
load_data in 700 papers utils/dataset.py ran MIT (permissive) · 86d7b0a8158bedf6 · report fixture: returned tuple · level recorded 2026-09-24
preselect_anchor utils/anchor.py ran MIT (permissive) · b0746c333af745b2 · report fixture: signature G1_data:GraphData/0/?, G2_data:GraphData/0/?, random:bool/0/bool, c:int/0/int, device:str/0/str · returned tuple · level recorded 2026-09-24
rwr_score utils/distance.py ran MIT (permissive) · 80a5ca87ef90c1f8 · report fixture: returned ndarray · level recorded 2026-09-24
rwr_scores utils/distance.py ran MIT (permissive) · 60947cd85ec02d2b · report fixture: returned tuple · level recorded 2026-09-24
sinkhorn_stable model.py ran MIT (permissive) · 6343f24ce0d0ac99 · report fixture: signature inter_c:Tensor/2/float, intra_c1:Tensor/2/float, intra_c2:Tensor/2/float, threshold_lambda:Tensor/0/float, in_iter:int/0/int, out_iter:int/0/int, gw_weight:int/0/int, gamma_p:float/0/float, device:str/0/str · returned Tensor · level recorded 2026-09-24
get_rwr_matrix utils/distance.py unverified MIT (permissive) · b1613522ff2f56e7 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections