Answering multi-relation questions over knowledge graphs is a challenging task as it requires multi-step reasoning over a huge number of possible paths. Reasoning-based methods with complex reasoning mechanisms, such as reinforcement learning-based sequential decision making, have been regarded as the default pathway for this task. However, these mechanisms are difficult to implement and train, which hampers their reproducibility and transferability to new domains. In this paper, we propose QAGCN - a simple but effective and novel model that leverages attentional graph convolutional networks that can perform multi-step reasoning during the encoding of knowledge graphs. As a consequence, complex reasoning mechanisms are avoided. In addition, to improve efficiency, we retrieve answers using highly-efficient embedding computations and, for better interpretability, we extract interpretable paths for returned answers. On widely adopted benchmark datasets, the proposed model has been demonstrated competitive against state-of-the-art methods that rely on complex reasoning mechanisms. We also conducted extensive experiments to scrutinize the efficiency and contribution of each component of our model.
翻译:在知识图上回答多关系问题是一项艰巨的任务,因为它需要在许多可能的路径上进行多步推理。基于理性的方法,加上复杂的推理机制,例如加强学习的顺序决策,被认为是这项任务的默认途径。然而,这些机制难以实施和培训,妨碍其再复制和转移到新的领域。在本文件中,我们提议QAGCN——一个简单但有效且新的模型,利用在知识图编码过程中能够执行多步推理的注意图共进网络。因此,避免了复杂的推理机制。此外,为了提高效率,我们利用高效的嵌入计算检索答案,并为更好的解释,我们提取可解释的返回答案路径。在广泛采用的基准数据集中,拟议的模型证明与依赖复杂推理机制的先进方法具有竞争力。我们还进行了广泛的实验,以审查我们模型每个组成部分的效率和贡献。