Table of Contents
Fetching ...

KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion

Yilin Wang, Minghao Hu, Zhen Huang, Dongsheng Li, Dong Yang, Xicheng Lu

TL;DR

KC-GenRe is introduced, a knowledge-constrained generative re-ranking method based on LLMs for KGC that addresses the mismatch issue, and develops a knowledge-guided interactive training method that enhances the identification and ranking of candidates.

Abstract

The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tasks such as information extraction and dialog systems. Leveraging them for KGC re-ranking is beneficial for leveraging the extensive pre-trained knowledge and powerful generative capabilities. However, it may encounter new problems when accomplishing the task, namely mismatch, misordering and omission. To this end, we introduce KC-GenRe, a knowledge-constrained generative re-ranking method based on LLMs for KGC. To overcome the mismatch issue, we formulate the KGC re-ranking task as a candidate identifier sorting generation problem implemented by generative LLMs. To tackle the misordering issue, we develop a knowledge-guided interactive training method that enhances the identification and ranking of candidates. To address the omission issue, we design a knowledge-augmented constrained inference method that enables contextual prompting and controlled generation, so as to obtain valid rankings. Experimental results show that KG-GenRe achieves state-of-the-art performance on four datasets, with gains of up to 6.7% and 7.7% in the MRR and Hits@1 metric compared to previous methods, and 9.0% and 11.1% compared to that without re-ranking. Extensive analysis demonstrates the effectiveness of components in KG-GenRe.

KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion

TL;DR

KC-GenRe is introduced, a knowledge-constrained generative re-ranking method based on LLMs for KGC that addresses the mismatch issue, and develops a knowledge-guided interactive training method that enhances the identification and ranking of candidates.

Abstract

The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tasks such as information extraction and dialog systems. Leveraging them for KGC re-ranking is beneficial for leveraging the extensive pre-trained knowledge and powerful generative capabilities. However, it may encounter new problems when accomplishing the task, namely mismatch, misordering and omission. To this end, we introduce KC-GenRe, a knowledge-constrained generative re-ranking method based on LLMs for KGC. To overcome the mismatch issue, we formulate the KGC re-ranking task as a candidate identifier sorting generation problem implemented by generative LLMs. To tackle the misordering issue, we develop a knowledge-guided interactive training method that enhances the identification and ranking of candidates. To address the omission issue, we design a knowledge-augmented constrained inference method that enables contextual prompting and controlled generation, so as to obtain valid rankings. Experimental results show that KG-GenRe achieves state-of-the-art performance on four datasets, with gains of up to 6.7% and 7.7% in the MRR and Hits@1 metric compared to previous methods, and 9.0% and 11.1% compared to that without re-ranking. Extensive analysis demonstrates the effectiveness of components in KG-GenRe.
Paper Structure (34 sections, 6 equations, 4 figures, 8 tables)

This paper contains 34 sections, 6 equations, 4 figures, 8 tables.

Figures (4)

  • Figure 1: Challenges for KGC re-ranking based on generative LLMs, given query (Jackie Chan, played in movie, ?) and the top-3 candidates, where $e_3$(Police Story) is the target entity.
  • Figure 2: Overview of KC-GenRe, which re-ranks Top-3 candidates predicted by the first-stage KGE model through LLMs for a given query $(e_h,r,?)$. Its knowledge-guided interactive training method includes query-candidate interaction and candidate-candidate interaction modules, while its knowledge-augmented constrained inference method includes query-related prompt, candidate-supporting prompt, and constrained option generation modules(omitted in the figure).
  • Figure 3: Effects of re-ranking number $K$. The front and back of the slash in the legend represent the values of $K$ during training and testing, respectively.
  • Figure 4: Influences of weight $\lambda$ in Eq.(\ref{['eq:loss']}) with different re-ranking number $K$ (Top-$K$).