用神经网络加速逻辑推理,让知识推理更高效。
DeepProofLog: Efficient Proving in Deep Stochastic Logic Programs
- 用神经网络参数化每步推理,实现高效引导。
- 在标准基准上性能超越现有最先进系统。
- 适合需要大规模知识推理的场景。
神经符号(NeSy)AI旨在结合神经网络与符号推理的优势,提升模型的准确性、可解释性和泛化能力。尽管基于子符号模块的逻辑推理能有效保障这些特性,但通常会带来可扩展性下降的问题,严重限制了NeSy模型的实际应用。本文提出DeepProofLog(DPrL),一种基于随机逻辑程序的新型NeSy系统,解决了以往方法的可扩展性瓶颈。DPrL通过神经网络参数化所有推导步骤,实现对证明过程的高效神经引导。此外,我们建立了深度随机逻辑程序的归结过程与马尔可夫决策过程之间的形式映射,使动态规划和强化学习技术可用于高效推理与学习。该理论联系提升了复杂证明空间和大规模知识库下的可扩展性。在标准NeSy基准和知识图谱推理任务上的实验表明,DPrL优于现有最先进的NeSy系统,将可扩展性推进至此前无法实现的大规模复杂场景。
原文摘要 · Abstract (English)
Neurosymbolic (NeSy) AI aims to combine the strengths of neural architectures and symbolic reasoning to improve the accuracy, interpretability, and generalization capability of AI models. While logic inference on top of subsymbolic modules has been shown to effectively guarantee these properties, this often comes at the cost of reduced scalability, which can severely limit the usability of NeSy models. This paper introduces DeepProofLog (DPrL), a novel NeSy system based on stochastic logic programs, which addresses the scalability limitations of previous methods. DPrL parameterizes all derivation steps with neural networks, allowing efficient neural guidance over the proving system. Additionally, we establish a formal mapping between the resolution process of our deep stochastic logic programs and Markov Decision Processes, enabling the application of dynamic programming and reinforcement learning techniques for efficient inference and learning. This theoretical connection improves scalability for complex proof spaces and large knowledge bases. Our experiments on standard NeSy benchmarks and knowledge graph reasoning tasks demonstrate that DPrL outperforms existing state-of-the-art NeSy systems, advancing scalability to larger and more complex settings than previously possible.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。