Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

On the Computational Cost of Knowledge Graph Embeddings

Title: On the Computational Cost of Knowledge Graph Embeddings
Authors: Charpenay, Victor; Zoubeirou A Mayaki, Mansour; Zimmermann, Antoine
Contributors: Victor Charpenay and Mansour Zoubeirou A Mayaki and Antoine Zimmermann
Publisher Information: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Publication Year: 2026
Collection: DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics )
Subject Terms: Knowledge Graph Embedding; Parameter Efficiency; Computational Budget; Green AI
Description: Over a decade, numerous Knowledge Graph Embedding (KGE) models have been designed and evaluated on reference datasets, always with increasing performance. In this paper, we re-evaluate these models with respect to their computational efficiency during training, by estimating the computational cost of the procedure expressed in floating-point operations. We design a cost model based on analytical expressions and apply it on a collection of 20 KGE models, representative of the state-of-the-art. We show that dimensionality or parameter efficiency, used in the literature to compare models with each other, are not suitable to evaluate the true cost of models. Through fixed-budget experiments, a novel approach to evaluate KGE models based on cost estimates, we re-assess the relative performance of model families compared to the state-of-the-art. Bilinear models such as ComplEx underperform with a low computational budget while hyperbolic linear models appear to offer no particular benefit compared to simpler Euclidian models, especially the MuRE model. Neural models, such as ConvE or CompGCN, achieve reasonable performance in the literature but their high computational cost appears unnecessary when compared with other models. The trade-off between efficiency and expressivity of both linear and neural models is to be further explored.
Document Type: article in journal/newspaper
File Description: application/pdf
Language: English
Relation: Is Part Of TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1; https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.1
DOI: 10.4230/TGDK.4.1.1
Availability: https://doi.org/10.4230/TGDK.4.1.1; https://nbn-resolving.org/urn:nbn:de:0030-drops-256863; https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.1
Rights: https://creativecommons.org/licenses/by/4.0/legalcode
Accession Number: edsbas.B4B15C1
Database: BASE