LGLOJun 21, 2024

Pathformer: Recursive Path Query Encoding for Complex Logical Query Answering

arXiv:2406.14880v11 citations
Originality Incremental advance
AI Analysis

This work addresses a challenging task in knowledge graph reasoning, offering an incremental improvement by better modeling query context and dependencies for enhanced performance.

The paper tackles the problem of Complex Logical Query Answering over incomplete knowledge graphs by proposing Pathformer, a neural one-point embedding method that recursively encodes path query sequences using a transformer encoder to capture complex dependencies. Experimental results show that Pathformer outperforms existing competitive neural query embedding methods.

Complex Logical Query Answering (CLQA) over incomplete knowledge graphs is a challenging task. Recently, Query Embedding (QE) methods are proposed to solve CLQA by performing multi-hop logical reasoning. However, most of them only consider historical query context information while ignoring future information, which leads to their failure to capture the complex dependencies behind the elements of a query. In recent years, the transformer architecture has shown a strong ability to model long-range dependencies between words. The bidirectional attention mechanism proposed by the transformer can solve the limitation of these QE methods regarding query context. Still, as a sequence model, it is difficult for the transformer to model complex logical queries with branch structure computation graphs directly. To this end, we propose a neural one-point embedding method called Pathformer based on the tree-like computation graph, i.e., query computation tree. Specifically, Pathformer decomposes the query computation tree into path query sequences by branches and then uses the transformer encoder to recursively encode these path query sequences to obtain the final query embedding. This allows Pathformer to fully utilize future context information to explicitly model the complex interactions between various parts of the path query. Experimental results show that Pathformer outperforms existing competitive neural QE methods, and we found that Pathformer has the potential to be applied to non-one-point embedding space.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes