Papers › Inductive Entity Representations from Text via Link Prediction

Inductive Entity Representations from Text via Link Prediction

7 Oct 2020arXiv:2010.03496archive 2025-07-28

Daniel Daza, Michael Cochez, Paul Groth

Knowledge Graphs (KG) are of vital importance for multiple applications on the web, including information retrieval, recommender systems, and metadata annotation. Regardless of whether they are built manually by domain experts or with automatic pipelines, KGs are often incomplete. Recent work has begun to explore the use of textual descriptions available in knowledge graphs to learn vector representations of entities in order to preform link prediction. However, the extent to which these representations learned for link prediction generalize to other tasks is unclear. This is important given the cost of learning such representations. Ideally, we would prefer representations that do not need to be trained again when transferring to a different task, while retaining reasonable performance. In this work, we propose a holistic evaluation protocol for entity representations learned via a link prediction objective. We consider the inductive link prediction and entity classification tasks, which involve entities not seen during training. We also consider an information retrieval task for entity-oriented search. We evaluate an architecture based on a pretrained language model, that exhibits strong generalization to entities not observed during training, and outperforms related state-of-the-art methods (22% MRR improvement in link prediction on average). We further provide evidence that the learned representations transfer well to other tasks without fine-tuning. In the entity classification task we obtain an average improvement of 16% in accuracy compared with baselines that also employ pre-trained models. In the information retrieval task, we obtain significant improvements of up to 8.8% in NDCG@10 for natural language queries. We thus show that the learned representations are not limited KG-specific tasks, and have greater generalization properties than evaluated in previous work.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2010.03496")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: official repository: 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

dfdazac/blp officialpytorchMIT report
raphaelsty/mkb mentioned on GitHubpytorch 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

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 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 dfdazac/blp. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

complex_score dfdazac/blp/models.py official repository unverified MIT (permissive) · 1ab7d265b717db60 · report
distmult_score dfdazac/blp/models.py official repository unverified MIT (permissive) · 4de8ec87799ab1b4 · report
file_to_ids dfdazac/blp/data.py official repository unverified MIT (permissive) · 4205ada232da5c54 · report
get_negative_sampling_indices dfdazac/blp/data.py official repository unverified MIT (permissive) · a3936f53f9d93ed1 · report
get_triple_filters dfdazac/blp/utils.py official repository unverified MIT (permissive) · 8f2e45be8b37061d · report
make_ent2idx dfdazac/blp/utils.py official repository unverified MIT (permissive) · aa62acaf56a8519a · report
transe_score dfdazac/blp/models.py official repository unverified MIT (permissive) · 3f0f68e2573aecf3 · report

Tasks

Inductive Link PredictionInductive knowledge graph completionInformation RetrievalKnowledge Graph EmbeddingsKnowledge GraphsLanguage ModellingLink PredictionNatural Language QueriesNode ClassificationPredictionRecommendation SystemsRetrieval

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Inductive knowledge graph completion FB15k-237-ind BLP-TransE Hit@1 0.113 #1 of 1 Archive leaderboard report
Inductive knowledge graph completion FB15k-237-ind BLP-TransE Hits@10 0.363 #1 of 1 Archive leaderboard report
Inductive knowledge graph completion FB15k-237-ind BLP-TransE Hits@3 0.213 #1 of 1 Archive leaderboard report
Inductive knowledge graph completion FB15k-237-ind BLP-TransE MRR 0.195 #1 of 1 Archive leaderboard report
Inductive knowledge graph completion WN18RR-ind BLP-TransE Hit@10 0.58 #1 of 2 Archive leaderboard report
Inductive knowledge graph completion WN18RR-ind BLP-TransE Hits@3 0.361 #1 of 2 Archive leaderboard report
Inductive knowledge graph completion WN18RR-ind BLP-TransE MRR 0.285 #1 of 2 Archive leaderboard report
Inductive knowledge graph completion WN18RR-ind BLP-ComplEx Hits@1 0.156 #2 of 2 Archive leaderboard report
Inductive knowledge graph completion Wikidata5m-ind BLP-SimplE Hits@1 0.289 #1 of 3 Archive leaderboard report
Inductive knowledge graph completion Wikidata5m-ind BLP-SimplE MRR 0.493 #1 of 3 Archive leaderboard report
Inductive knowledge graph completion Wikidata5m-ind BLP-ComplEx Hits@10 0.877 #3 of 3 Archive leaderboard report
Inductive knowledge graph completion Wikidata5m-ind BLP-ComplEx Hits@3 0.664 #3 of 3 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.

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