Papers › Knowledge Graph Completion with Mixed Geometry Tensor Factorization

Knowledge Graph Completion with Mixed Geometry Tensor Factorization

3 Apr 2025arXiv:2504.02589archive 2025-07-28

Viacheslav Yusupov, Maxim Rakhuba, Evgeny Frolov

In this paper, we propose a new geometric approach for knowledge graph completion via low rank tensor approximation. We augment a pretrained and well-established Euclidean model based on a Tucker tensor decomposition with a novel hyperbolic interaction term. This correction enables more nuanced capturing of distributional properties in data better aligned with real-world knowledge graphs. By combining two geometries together, our approach improves expressivity of the resulting model achieving new state-of-the-art link prediction accuracy with a significantly lower number of parameters compared to the previous Euclidean and hyperbolic models.

PaperPDFCode

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):

Code

hse-cs/migtf officialmentioned in paperpytorchSyntology: 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.

Tasks

Knowledge Graph CompletionKnowledge GraphsLink PredictionTensor DecompositionWorld Knowledge

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

TuckER

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