Source-linked AI summary
A Re-evaluation of Knowledge Graph Completion Methods
Zhiqing Sun, Shikhar Vashishth, Soumya Sanyal, Partha Talukdar, Yiming Yang
TL;DR
Recent neural KGC methods report unusually high gains that vary across datasets. The paper proposes RANDOM evaluation and finds that re-examination identifies inflated results and distinguishes affected methods from others.
Problem
Recent neural KGC methods report unusually high gains that vary across datasets, leaving a need to assess their benchmark performance consistently.
Source: §1 · p. 1, §3.1 · p. 2Method
The paper proposes RANDOM evaluation, which breaks ties among same-scored candidates by selecting one randomly for KGC model comparisons.
Source: §4 · p. 4Results
Takeaways & Limitations
The authors encourage the research community to use RANDOM for KGC evaluation purposes.
Source: §6 · p. 5The authors leave TransGate re-evaluation as future work because they could not find an open-source implementation.
Source: §5.4 · p. 4
Abstract
from arXiv · showhide
Knowledge Graph Completion (KGC) aims at automatically predicting missing links for large-scale knowledge graphs. A vast number of state-of-the-art KGC techniques have got published at top conferences in several research fields, including data mining, machine learning, and natural language processing. However, we notice that several recent papers report very high performance, which largely outperforms previous state-of-the-art methods. In this paper, we find that this can be attributed to the inappropriate evaluation protocol used by them and propose a simple evaluation protocol to address this problem. The proposed protocol is robust to handle bias in the model, which can substantially affect the final results. We conduct extensive experiments and report the performance of several existing methods using our protocol. The reproducible code has been made publicly available
1 Introduction
The paper argues that unusual performance gains reported by recent neural KGC methods stem from an evaluation protocol that can reward constant-output models. It proposes a fairer evaluation protocol and uses it to re-examine recent methods against existing approaches.
1 Introduction
- Knowledge Graph Completion predicts missing links in incomplete knowledge bases, commonly by embedding entities and relations and scoring candidate triplets.Knowledge bases are represented as multi-relational graphs of factual triplets.Source: §1 · p. 1
- Recent neural KGC papers report unusually high performance gains that vary across datasets, and these results are often unanalyzed and misleading to the research community.The methods use complex black-box CNN, RNN, GNN, and capsule-network score functions.Source: §1 · p. 1
- The proposed evaluation protocol addresses a flaw that gives a perfect score to a model that outputs a constant regardless of its input, enabling fair comparisons across score functions.The authors use it to re-examine recent methods and compare them with existing approaches.Source: §1 · p. 1
2 Background
This section defines knowledge graph completion and its ranking-based evaluation, then reviews prior work that motivates scrutiny of evaluation procedures.
Background
- Table 1 reports inconsistent MRR improvements relative to ConvE across methods on FB15k-237 and WN18RR.Source: Table 1 · p. 2
- KGC predicts missing facts from known triplets; common methods embed entities and relations and score valid triplets above invalid ones.A score function maps each (head, relation, tail) triplet to a score.Source: §2 · p. 2
- Evaluation ranks the true triplet against candidates, while the filtered setting removes other known correct triplets from the candidate set.The filtered setting removes known correct triplets from training, validation, and test data except the triplet being evaluated.Source: §2 · p. 2
Related Work
- Kadlec et al. (2017) and Jain et al. (2020) questioned whether model gains stem from architecture rather than tuning or training objectives; this paper instead scrutinizes evaluation procedures.Chandrahas et al. (2018) studied embedding geometry and task performance, while Nayyeri et al. (2019) examined loss functions.Source: §2 · p. 2
- Jain et al. (2018) studied protocols for out-of-vocabulary entities, but their analysis was limited to non-neural approaches.Source: §2 · p. 2
Background
- In one ConvKB example, 58.5% of negative samples received the same score as the valid triplet.Scores are normalized to [0, 1], with lower scores better.Source: Figure 1 · p. 2
3 Observations
Recent methods can improve over ConvE on one benchmark yet regress on another. ConvKB and CapsE also produce unusually many tied scores, associated with ReLU zeroing that makes triplet representations similar.
3.1 Inconsistent Improvements over Benchmark Datasets
- ConvKB improves MRR by 21.8% over ConvE on FB15k-237 but degrades by 42.3% on WN18RR, while RotatE and TuckER improve consistently across both datasets.These inconsistent gains occur for several recent neural-network methods.Source: §3.1 · p. 2
3.2 Observations on Score Functions
- On FB15k-237, ConvKB and CapsE average 125 and 197 entities tied with valid-triplet scores, respectively, versus around 0.002 for ConvE.For one triplet, 8,520 of 14,541 negatively sampled triplets received exactly the same score as the valid triplet.Source: Figure 2 · p. 3, §3.2 · p. 3
- ReLU zeros 87.3% of ConvKB neurons and 92.2% of CapsE neurons, versus around 41.1% for ConvE, making several triplet representations similar and their scores identical.At least 14.2% of ConvKB neurons and 22.0% of CapsE neurons are zeroed.Source: §3.2 · p. 3, Figure 3 · p. 3
4 Evaluation Protocols for KGC
The section defines three tie-breaking protocols for equally scored candidate triplets and argues that RANDOM is the rigorous, fair choice for KGC performance comparisons.
4 Evaluation Protocols for KGC
- The proposed scheme breaks ties by placing the correct triplet at the beginning (TOP), end (BOTTOM), or a random position (RANDOM) in T ′.It assumes that triplets are sorted in a stable manner.Source: §4 · p. 3
- TOP can advantage models biased toward equal scores, while BOTTOM can penalize them by assigning the correct triplet the least possible rank among tied candidates.Under BOTTOM, this occurs when many triplets share the correct triplet’s score.Source: §4 · p. 4
- RANDOM is recommended for model comparisons because it is both rigorous and fair when multiple candidates receive the same score.The authors say this reflects the real-world choice among equally scored candidates: select one randomly.Source: §4 · p. 4
5 Experiments
The experiments compare existing KGC methods under the proposed evaluation protocols and find that protocol effects differ by method category.
5.1 Datasets
- The evaluation uses FB15k-237, a subset of FB15k with inverse relations deleted to prevent direct inference of test triples from training.Source: §5.1 · p. 4
5.2 Methods Analyzed
- The study classifies ConvE, RotatE, and TuckER as non-affected, and ConvKB, CapsE, TransGate2, and KBAT as affected methods.Source: §5.2 · p. 4
5.3 Evaluation Metrics
- Using authors’ code and hyperparameters, the authors evaluate filtered Mean Reciprocal Rank (MRR), Mean Rank (MR), and Hits@10 (H@10).Source: §5.3 · p. 4
5.4 Evaluation Results
- Affected methods varied considerably by protocol, scoring best with TOP and worst with BOTTOM, while ConvE, RotatE, and TuckER remained consistent.The RANDOM protocol was robust to random seeds; results averaged five runs with standard deviations, and the authors could not re-evaluate TransGate because no open-source implementation was available.Source: §5.4 · pp. 4–5
6 Conclusion
The study finds that score-function issues, combined with inappropriate evaluation protocols, inflated the reported performance of many recent neural network-based KGC methods. It proposes the RANDOM evaluation protocol to distinguish affected methods from others and encourages its use for all KGC evaluations.
- The proposed RANDOM protocol can distinguish KGC methods affected by score-function issues and inappropriate evaluation from other methods.The study encourages the research community to use RANDOM for all KGC evaluation purposes.Source: §6 · p. 5
- Many recent neural network-based KGC methods have score-function issues that, alongside inappropriate evaluation protocols, inflated their reported performance.Source: §6 · p. 5
- The study reexamines recent neural network-based KGC techniques extensively.Source: §6 · p. 5
Appendix · A Results on WN18RR dataset
The evaluation protocols are also applied to WN18RR, where Figure 4 shows that only ConvKB has many negative triplets receiving the same score as valid triplets. Table 3 compares performance across protocols, with TOP and BOTTOM changes measured against RANDOM.
A Results on WN18RR dataset
- The protocols are evaluated on WN18RR, a WN18 subset containing lexical relations between words, with inverse relations removed.The paper says the WN18RR results support conclusions similar to those in Section 5, but those conclusions are not specified in the supplied passages.Source: A Results on WN18RR dataset · p. 6
- Table 3 compares performance under different evaluation protocols, reporting TOP and BOTTOM changes relative to RANDOM.The supplied passage gives the table’s scope but not its result values.Source: Table 3 · p. 7
- On WN18RR, CapsE uses pre-trained 100-dimensional Glove embeddings for initialization, while KBAT’s test-data leakage is fixed in these experiments.The table caption notes that CapsE’s initialization makes its comparison on WN18RR still unfair.Source: Table 3 · p. 7
- Only ConvKB has a large number of negative triplets assigned the same score as valid triplets on WN18RR.Figure 4 plots the frequency of negative triplets with the same score as the valid triplet during evaluation.Source: Figure 4 · p. 7