Runtime Performances Benchmark for Knowledge Graph Embedding Methods

by   Angelica Sofia Valeriani, et al.

This paper wants to focus on providing a characterization of the runtime performances of state-of-the-art implementations of KGE alghoritms, in terms of memory footprint and execution time. Despite the rapidly growing interest in KGE methods, so far little attention has been devoted to their comparison and evaluation; in particular, previous work mainly focused on performance in terms of accuracy in specific tasks, such as link prediction. To this extent, a framework is proposed for evaluating available KGE implementations against graphs with different properties, with a particular focus on the effectiveness of the adopted optimization strategies. Graphs and models have been trained leveraging different architectures, in order to enlighten features and properties of both models and the architectures they have been trained on. Some results enlightened with experiments in this document are the fact that multithreading is efficient, but benefit deacreases as the number of threads grows in case of CPU. GPU proves to be the best architecture for the given task, even if CPU with some vectorized instructions still behaves well. Finally, RAM utilization for the loading of the graph never changes between different architectures and depends only on the type of graph, not on the model.


page 7

page 8


On the performance of various parallel GMRES implementations on CPU and GPU clusters

As the need for computational power and efficiency rises, parallel syste...

Multiple Run Ensemble Learning withLow-Dimensional Knowledge Graph Embeddings

Among the top approaches of recent years, link prediction using knowledg...

Decompressing Knowledge Graph Representations for Link Prediction

This paper studies the problem of predicting missing relationships betwe...

Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study

In the active research area of employing embedding models for knowledge ...

Convolutional Hypercomplex Embeddings for Link Prediction

Knowledge graph embedding research has mainly focused on the two smalles...

Forget Markov Logic: Efficient Mining of Prediction Rules in Large Graphs

Graph representations of large knowledge bases may comprise billions of ...

An Evaluation of Models for Runtime Approximation in Link Discovery

Time-efficient link discovery is of central importance to implement the ...

Please sign up or login with your details

Forgot password? Click here to reset