Are We Wasting Time? A Fast, Accurate Performance Evaluation Framework for Knowledge Graph Link Predictors
Filip Cornell, Yifei Jin, Jussi Karlgren, Sarunas Girdzijauskas
Abstract
The standard evaluation protocol for measuring the quality of Knowledge Graph Completion methods - the task of inferring new links to be added to a graph - typically involves a step which ranks every entity of a Knowledge Graph to assess their fit as a head or tail of a candidate link to be added. In Knowledge Graphs on a larger scale, this task rapidly becomes prohibitively heavy. Previous approaches mitigate this problem by using random sampling of entities to assess the quality of links predicted or suggested by a method. However, we show that this approach has serious limitations since the ranking metrics produced do not properly reflect true outcomes. In this paper, we present a thorough analysis of these effects along with the following findings. First, we empirically find and theoretically motivate why sampling uniformly at random vastly overestimates the ranking performance of a method. We show that this can be attributed to the effect of easy versus hard negatives. Second, we propose a framework that uses relational recommenders to guide the selection of candidates for evaluation. We provide both theoretical and empirical justification of our methodology, and find that simple and fast methods work extremely well, matching advanced neural approaches. Even when a large portion of the true candidates for a property are missed, the estimation of the ranking metrics on a downstream model barely deteriorates. With our proposed framework, we can reduce the time and computation needed similar to random sampling strategies while vastly improving the estimation; on ogbl-wikikg2, we show that accurate estimations of the full ranking can be obtained in 20 seconds instead of 30 minutes. We conclude that considerable computational effort can be saved by effective preprocessing and sampling methods and still reliably predict performance accurately of the true performance for the entire ranking procedure. We make our code available to the community11Accessible at https://github.com/Filco306/are-we-wasting-time.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- ARNS: Adaptive Relation-Aware Negative Sampling with Curriculum Learning for Inductive Knowledge Graph CompletionLing Ding, Zhizhi Yu, Di Jin, Lei HuangAAAI 2026
- Multimodal Knowledge Graph Completion via Relation-Aware Negative Sampling with Diffusion-based InterpolationQian Ma, Linfei Dai, Zhongming Yao, Yu Gu et al.VLDB 2026
Builds on14
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Inductive Relation Prediction by Subgraph ReasoningKomal K. Teru, Etienne G. Denis, William L. HamiltonICML 2020 · 493 citations
- Query2box: Reasoning over Knowledge Graphs in Vector Space Using Box EmbeddingsHongyu Ren, Weihua Hu, Jure LeskovecICLR 2020 · 355 citations
- Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge GraphsHongyu Ren, Jure LeskovecNeurIPS 2020 · 267 citations
- Relational Message Passing for Knowledge Graph CompletionHongwei Wang, Hongyu Ren, Jure LeskovecKDD 2021 · 109 citations
Related papers
- Using Model Calibration to Evaluate Link Prediction in Knowledge GraphsAishwarya Rao, Narayanan Asuri Krishnan, Carlos R. RiveroWWW 2024 · 2 citations
- Revisiting the Evaluation Protocol of Knowledge Graph Completion Methods for Link PredictionSudhanshu Tiwari, Iti Bansal, Carlos R. RiveroWWW 2021 · 16 citations
- Re-thinking Knowledge Graph Completion Evaluation from an Information Retrieval PerspectiveYing Zhou, Xuanang Chen, Ben He, Zheng Ye et al.SIGIR 2022 · 13 citations
- Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods?Anson Bastos, Kuldeep Singh, Abhishek Nadgeri, Johannes Hoffart et al.WWW 2023 · 4 citations
- RETA: A Schema-Aware, End-to-End Solution for Instance Completion in Knowledge GraphsPaolo Rosso, Dingqi Yang, Natalia Ostapuk, Philippe Cudré-MaurouxWWW 2021 · 23 citations
