Papers › Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction

Self-attention Presents Low-dimensional Knowledge Graph Embeddings for Link Prediction

20 Dec 2021arXiv:2112.10644archive 2025-07-28

Peyman Baghershahi, Reshad Hosseini, Hadi Moradi

A few models have tried to tackle the link prediction problem, also known as knowledge graph completion, by embedding knowledge graphs in comparably lower dimensions. However, the state-of-the-art results are attained at the cost of considerably increasing the dimensionality of embeddings which causes scalability issues in the case of huge knowledge bases. Transformers have been successfully used recently as powerful encoders for knowledge graphs, but available models still have scalability issues. To address this limitation, we introduce a Transformer-based model to gain expressive low-dimensional embeddings. We utilize a large number of self-attention heads as the key to applying query-dependent projections to capture mutual information between entities and relations. Empirical results on WN18RR and FB15k-237 as standard link prediction benchmarks demonstrate that our model has favorably comparable performance with the current state-of-the-art models. Notably, we yield our promising results with a significant reduction of 66.9% in the dimensionality of embeddings compared to the five best recent state-of-the-art competitors on average.

PaperPDFCode

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

Code

peyman-bi/sattle officialmentioned in paperpytorch 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.

Tasks

Knowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge GraphsLink Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction FB15k-237 SAttLE Hits@1 0.268 #18 of 75 Archive leaderboard report
Link Prediction FB15k-237 SAttLE Hits@10 0.545 #18 of 75 Archive leaderboard report
Link Prediction FB15k-237 SAttLE Hits@3 0.396 #18 of 75 Archive leaderboard report
Link Prediction FB15k-237 SAttLE MRR 0.36 #18 of 75 Archive leaderboard report
Link Prediction WN18RR SAttLE Hits@1 0.454 #45 of 75 Archive leaderboard report
Link Prediction WN18RR SAttLE Hits@10 0.558 #45 of 75 Archive leaderboard report
Link Prediction WN18RR SAttLE Hits@3 0.508 #45 of 75 Archive leaderboard report
Link Prediction WN18RR SAttLE MRR 0.491 #45 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

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

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