KnowFormer: Revisiting Transformers for Knowledge Graph Reasoning
This work addresses knowledge graph reasoning for applications like recommendation systems, but it is incremental as it adapts transformers to an existing problem.
The paper tackles the limitations of path-based methods in knowledge graph reasoning, such as missing paths and information over-squashing, by proposing KnowFormer, a transformer-based method that achieves superior performance on transductive and inductive benchmarks.
Knowledge graph reasoning plays a vital role in various applications and has garnered considerable attention. Recently, path-based methods have achieved impressive performance. However, they may face limitations stemming from constraints in message-passing neural networks, such as missing paths and information over-squashing. In this paper, we revisit the application of transformers for knowledge graph reasoning to address the constraints faced by path-based methods and propose a novel method KnowFormer. KnowFormer utilizes a transformer architecture to perform reasoning on knowledge graphs from the message-passing perspective, rather than reasoning by textual information like previous pretrained language model based methods. Specifically, we define the attention computation based on the query prototype of knowledge graph reasoning, facilitating convenient construction and efficient optimization. To incorporate structural information into the self-attention mechanism, we introduce structure-aware modules to calculate query, key, and value respectively. Additionally, we present an efficient attention computation method for better scalability. Experimental results demonstrate the superior performance of KnowFormer compared to prominent baseline methods on both transductive and inductive benchmarks.