arXiv:2505.18971cs.CLcs.IR2025-05

用简单模型实现可解释的知识图谱补全,性能更优且更快

Is Architectural Complexity Overrated? Competitive and Interpretable Knowledge Graph Completion with RelatE

  • 采用实值相位-模长分解,通过正弦相位对齐捕捉关系模式
  • 在YAGO3-10上MRR达0.521,优于所有基线方法
  • 结构扰动下鲁棒性更强,训练和推理效率提升明显

我们重新评估了简单实值嵌入模型在知识图谱补全中的有效性,提出RelatE——一种可解释、模块化的双表示集成方法。RelatE采用实值相位-模长分解,利用正弦相位对齐编码对称性、逆关系和复合关系等关系模式。相比基于复值嵌入或深层神经网络的方法,RelatE保持架构简洁,同时在标准基准上达到竞争性或更优性能。实验表明,其在YAGO3-10上达到MRR 0.521、Hit@10 0.680,超越所有基线。此外,训练时间减少24%,推理延迟降低31%,峰值GPU内存使用下降22%。扰动分析显示,其鲁棒性显著提升:在边删除和关系互换等结构修改下,MRR下降比TransE少61%,比RotatE少19%。形式化分析证明模型具备完整表达能力,能表征一阶逻辑推理模式。这些结果使RelatE成为复杂架构的高效可解释替代方案。

原文摘要 · Abstract (English)

We revisit the efficacy of simple, real-valued embedding models for knowledge graph completion and introduce RelatE, an interpretable and modular method that efficiently integrates dual representations for entities and relations. RelatE employs a real-valued phase-modulus decomposition, leveraging sinusoidal phase alignments to encode relational patterns such as symmetry, inversion, and composition. In contrast to recent approaches based on complex-valued embeddings or deep neural architectures, RelatE preserves architectural simplicity while achieving competitive or superior performance on standard benchmarks. Empirically, RelatE outperforms prior methods across several datasets: on YAGO3-10, it achieves an MRR of 0.521 and Hit@10 of 0.680, surpassing all baselines. Additionally, RelatE offers significant efficiency gains, reducing training time by 24%, inference latency by 31%, and peak GPU memory usage by 22% compared to RotatE. Perturbation studies demonstrate improved robustness, with MRR degradation reduced by up to 61% relative to TransE and by up to 19% compared to RotatE under structural edits such as edge removals and relation swaps. Formal analysis further establishes the model's full expressiveness and its capacity to represent essential first-order logical inference patterns. These results position RelatE as a scalable and interpretable alternative to more complex architectures for knowledge graph completion.

知识图谱可解释性嵌入模型效率优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。