Papers › Composition-based Multi-Relational Graph Convolutional Networks

Composition-based Multi-Relational Graph Convolutional Networks

8 Nov 2019ICLR 2020 1arXiv:1911.03082archive 2025-07-28

Shikhar Vashishth, Soumya Sanyal, Vikram Nitin, Partha Talukdar

Graph Convolutional Networks (GCNs) have recently been shown to be quite successful in modeling graph-structured data. However, the primary focus has been on handling simple undirected graphs. Multi-relational graphs are a more general and prevalent form of graphs where each edge has a label and direction associated with it. Most of the existing approaches to handle such graphs suffer from over-parameterization and are restricted to learning representations of nodes only. In this paper, we propose CompGCN, a novel Graph Convolutional framework which jointly embeds both nodes and relations in a relational graph. CompGCN leverages a variety of entity-relation composition operations from Knowledge Graph Embedding techniques and scales with the number of relations. It also generalizes several of the existing multi-relational GCN methods. We evaluate our proposed method on multiple tasks such as node classification, link prediction, and graph classification, and achieve demonstrably superior results. We make the source code of CompGCN available to foster reproducible research.

PaperPDFConference PDFCodeCode 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 6 code samples harvested from 2 repositories linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 3 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 3 samples from 1 repository, 2 ran (0 with no instrument failure; 2 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.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

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

malllabiisc/CompGCN officialmentioned in papermentioned on GitHubpytorchApache-2.0Syntology: 3 samples, 3 ran (0 instrument-failed) · 0 unverified report
anilakash/indkgc mentioned on GitHubpytorchSyntology: 3 samples, 2 ran (2 instrument-failed) · 1 unverified report
pykeen/ilpc2022 mentioned on GitHubpytorchMITSyntology: not harvested report
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

6 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 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.

2ran · our draft was wrong
3ran
1unverified

Licence: 3 of the 6 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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”. “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.

malllabiisc/CompGCN official repository 3 samples, 3 ran (0 instrument-failed) · 0 unverified
get_combined_results helper.py ran Apache-2.0 (permissive) · 1693e0374b56cfbc · report fixture: signature left_results:dict/0/?, right_results:dict/0/? · returned dict · level recorded 2026-09-25
get_logger in 383 papers helper.py ran Apache-2.0 (permissive) · 4ecef8549fab0398 · report fixture: signature name:str/0/str, log_dir:str/0/str, config_dir:str/0/str · returned Logger · level recorded 2026-09-25
get_param in 15 papers helper.py ran Apache-2.0 (permissive) · 892c466d12dfb05b · report fixture: signature shape:tuple/1/int · returned Parameter · level recorded 2026-09-25
anilakash/indkgc community (archive-listed) 3 samples, 2 ran (2 instrument-failed) · 1 unverified
process_nbfnet_rank script/eval_anyburl.py ran · our draft was wrong fingerprinted no licence file found · pointer only · 92482118031a5b26 · report fixture: signature data_dir:str/0/str, num_nbfnet_runs:int/0/int · returned defaultdict · level recorded 2026-09-22
shuffle_batch script/eval_anyburl.py ran · our draft was wrong no licence file found · pointer only · cf1e4406130d8693 · report fixture: signature batch_score:dict/0/? · returned dict · level recorded 2026-09-22
process_nbfnet_score script/eval_anyburl.py unverified no licence file found · pointer only · d5f75c3eba2a7d63 · report

Tasks

General ClassificationGraph ClassificationGraph EmbeddingKnowledge Graph EmbeddingLink PredictionNode Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction FB15k-237 CompGCN Hits@1 0.264 #25 of 75 Archive leaderboard report
Link Prediction FB15k-237 CompGCN Hits@10 0.535 #25 of 75 Archive leaderboard report
Link Prediction FB15k-237 CompGCN Hits@3 0.390 #25 of 75 Archive leaderboard report
Link Prediction FB15k-237 CompGCN MR 197 #25 of 75 Archive leaderboard report
Link Prediction FB15k-237 CompGCN MRR 0.355 #25 of 75 Archive leaderboard report
Link Prediction WN18RR CompGCN Hits@1 0.443 #54 of 75 Archive leaderboard report
Link Prediction WN18RR CompGCN Hits@10 0.546 #54 of 75 Archive leaderboard report
Link Prediction WN18RR CompGCN Hits@3 0.494 #54 of 75 Archive leaderboard report
Link Prediction WN18RR CompGCN MR 3533 #54 of 75 Archive leaderboard report
Link Prediction WN18RR CompGCN MRR 0.479 #54 of 75 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

GCN

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