We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2504.02589")
get_code_for_paper("2504.02589")
have("2504.02589")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2504.02589.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2504.02589)
Connect an agent — have() is free.