Papers › Deep Graph Matching Consensus

Deep Graph Matching Consensus

27 Jan 2020ICLR 2020 1arXiv:2001.09621archive 2025-07-28

Matthias Fey, Jan E. Lenssen, Christopher Morris, Jonathan Masci, Nils M. Kriege

This work presents a two-stage neural architecture for learning and refining structural correspondences between graphs. First, we use localized node embeddings computed by a graph neural network to obtain an initial ranking of soft correspondences between nodes. Secondly, we employ synchronous message passing networks to iteratively re-rank the soft correspondences to reach a matching consensus in local neighborhoods between graphs. We show, theoretically and empirically, that our message passing scheme computes a well-founded measure of consensus for corresponding neighborhoods, which is then used to guide the iterative re-ranking process. Our purely local and sparsity-aware architecture scales well to large, real-world inputs while still being able to recover global correspondences consistently. We demonstrate the practical effectiveness of our method on real-world tasks from the fields of computer vision and entity alignment between knowledge graphs, on which we improve upon the current state-of-the-art. Our source code is available under https://github.com/rusty1s/ deep-graph-matching-consensus.

PaperPDFConference PDFCodeMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page 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.

Syntology holds a reference implementation of DEEP GRAPH MATCHING CONSENSUS, generated from the paper text (not the authors' code), at level 3 on Syntology's ladder: V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” (quoted from Syntology's server card). No rung compares this code against the authors' implementation. For agents: get_reference_implementation(name='DEEP GRAPH MATCHING CONSENSUS') (how to connect); the free check have('2001.09621') needs no token.

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

Code

rusty1s/deep-graph-matching-consensus officialmentioned in paperpytorchSyntology: not harvested report
snap-stanford/neural-subgraph-learning-gnn mentioned on GitHubpytorchSyntology: not harvested 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

Not run by Syntology. Nothing on this page verifies that the listed code works.

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. For a generated assembly, an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as "by construction" or "not judged by a model". Where an assembly's phrase has no constructed figure, a brick that ran is not among the harvested samples this build reads, and whether a brick's run only constructed an object is read from that brick's harvested sample, so the figure was not counted; it does not say there were none.

1 assembly on this paper: 0 harvested, 1 generated.

generated Assembly for DEEP GRAPH MATCHING CONSENSUS (graph method: DEEP GRAPH MATCHING CONSENSUS), generated from the paper text, not the repository's code. 1 brick; individually on a fixture: 1 ran (1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. Ran end-to-end against an independent peer (level 3; 5 property tests passed on both).

label matches by construction: the code was generated for this method (not judged by a model)

  1. compute_neighborhood_consensus_difference entry · level 3 · ran · honoured contract · 3cceab912893e5126af20abbdda969545ecf72cd469d2f994640d9123ba07361

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2001.09621") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Entity AlignmentGraph MatchingGraph Neural NetworkKnowledge GraphsRe-Ranking

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Entity Alignment DBP15k zh-en Deep Graph Matching Consensus (L=10) Hits@1 0.8012 #12 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en Deep Graph Matching Consensus Hits@1 0.7075 #20 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en GMNN Hits@1 0.6793 #23 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en NAEA Hits@1 0.6501 #24 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en BootEA Hits@1 0.6294 #26 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en MuGNN Hits@1 0.494 #30 of 38 Archive leaderboard report
Entity Alignment DBP15k zh-en GCN-Align Hits@1 0.4125 #35 of 38 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Graph Neural Network

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