Papers › SimplE Embedding for Link Prediction in Knowledge Graphs
SimplE Embedding for Link Prediction in Knowledge Graphs
Seyed Mehran Kazemi, David Poole
Knowledge graphs contain knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs contain only a small subset of what is true in the world. Link prediction approaches aim at predicting new links for a knowledge graph given the existing links among the entities. Tensor factorization approaches have proved promising for such link prediction problems. Proposed in 1927, Canonical Polyadic (CP) decomposition is among the first tensor factorization approaches. CP generally performs poorly for link prediction as it learns two independent embedding vectors for each entity, whereas they are really tied. We present a simple enhancement of CP (which we call SimplE) to allow the two embeddings of each entity to be learned dependently. The complexity of SimplE grows linearly with the size of embeddings. The embeddings learned through SimplE are interpretable, and certain types of background knowledge can be incorporated into these embeddings through weight tying. We prove SimplE is fully expressive and derive a bound on the size of its embeddings for full expressivity. We show empirically that, despite its simplicity, SimplE outperforms several state-of-the-art tensor factorization techniques. SimplE's code is available on GitHub at https://github.com/Mehran-k/SimplE.
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.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="1802.04868", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1802.04868")
Code
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
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Link Prediction | FB15k | SimplE | Hits@1 | 0.660 | #16 of 23 | Archive leaderboard | report |
| Link Prediction | FB15k | SimplE | Hits@10 | 0.838 | #16 of 23 | Archive leaderboard | report |
| Link Prediction | FB15k | SimplE | Hits@3 | 0.773 | #16 of 23 | Archive leaderboard | report |
| Link Prediction | FB15k | SimplE | MRR | 0.727 | #16 of 23 | Archive leaderboard | report |
| Link Prediction | WN18 | SimplE | Hits@1 | 0.939 | #25 of 37 | Archive leaderboard | report |
| Link Prediction | WN18 | SimplE | Hits@10 | 0.947 | #25 of 37 | Archive leaderboard | report |
| Link Prediction | WN18 | SimplE | Hits@3 | 0.944 | #25 of 37 | Archive leaderboard | report |
| Link Prediction | WN18 | SimplE | MRR | 0.942 | #25 of 37 | 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