让大模型推理更可靠,通过模拟直觉与反思的双重思维模式。
CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs
- 用关系蓝图快速引导搜索方向,对抗噪声干扰
- 发现推理卡顿时自动回溯重试,突破停滞瓶颈
- 无需训练即可提升准确率与效率,适合知识图谱应用
大型语言模型(LLMs)虽具强大推理能力,但常面临幻觉等可靠性问题。尽管知识图谱(KG)提供明确依据,现有基于KG的LLM方法多采用单一搜索策略,对邻域噪声和结构偏差敏感,易导致推理停滞。为此,我们提出CoG,一种受双过程理论启发的无训练框架,模拟直觉与反思的协同机制。首先,关系蓝图引导模块作为快速直觉过程,利用可解释的关系蓝图作为软结构约束,快速稳定搜索路径以抵御噪声。其次,故障感知精炼模块作为审慎分析过程,在遭遇推理困境时触发证据驱动的反思并执行可控回溯,克服停滞。在三个基准测试上的实验表明,CoG显著优于现有先进方法,在准确率与效率上均有提升。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have demonstrated remarkable reasoning capabilities but often grapple with reliability challenges like hallucinations. While Knowledge Graphs (KGs) offer explicit grounding, existing paradigms of KG-augmented LLMs typically exhibit cognitive rigidity--applying homogeneous search strategies that render them vulnerable to instability under neighborhood noise and structural misalignment leading to reasoning stagnation. To address these challenges, we propose CoG, a training-free framework inspired by Dual-Process Theory that mimics the interplay between intuition and deliberation. First, functioning as the fast, intuitive process, the Relational Blueprint Guidance module leverages relational blueprints as interpretable soft structural constraints to rapidly stabilize the search direction against noise. Second, functioning as the prudent, analytical process, the Failure-Aware Refinement module intervenes upon encountering reasoning impasses. It triggers evidence-conditioned reflection and executes controlled backtracking to overcome reasoning stagnation. Experimental results on three benchmarks demonstrate that CoG significantly outperforms state-of-the-art approaches in both accuracy and efficiency.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。