arXiv:2608.02026cs.AI2026-08被引 1

用超图对比定位大模型推理失败根源,提升故障分析效率与准确性。

HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning

论文配图:HPFA: Hypergraph-Based Paired Failure Attribution for LLM Reasoning
图 1 · 摘自论文原文
  • 构建超图结构,对比失败路径与成功路径的超边差异。
  • 在数学推理和智能编码任务中,故障定位准确率显著提升。
  • 适合需要可解释性推理的AI系统研发者使用。

反思是大模型推理的重要机制,但其效果依赖于对失败步骤的精准归因,而现有方法或需昂贵的逐步反事实测试(随轨迹长度增长而恶化),或将推理过程视为线性序列,忽略非线性逻辑依赖。本文提出基于超图的成对故障归因(HPFA)框架,通过比较目标失败推理路径与参考成功路径的超边,定位故障根本原因。该方法有效缩小搜索空间,实现高效根因定位,并支持通过监督微调与强化学习训练轻量级归因模型,以合成可扩展的归因数据。在数学推理与智能编码任务上的实验表明,HPFA显著提升归因准确率与效率,且训练后的归因器在测试时持续提高推理准确率,优于缺乏图结构或成对分析的基线方法。

原文摘要 · Abstract (English)

Reflection is a powerful mechanism for LLM reasoning, yet its effectiveness hinges on accurately attributing failures to specific reasoning steps, a capability that current models notably lack. Existing failure attribution methods either require expensive step-by-step counterfactual testing that scales poorly with trajectory length, or treat reasoning traces as flat sequences that ignore the inherent non-linear logical dependencies. We propose a hypergraph-based paired failure attribution (HPFA) framework that attributes the failure root cause by comparing the hyperedges of the targeted failure reasoning path against a reference successful path. By reducing the search space, our method efficiently localizes root causes and enables scalable synthesis of attribution data for training a lightweight attributor model via supervised fine-tuning and reinforcement learning. Experiments on mathematical reasoning and agentic coding tasks demonstrate that HPFA can dramatically increase attribution accuracy and efficiency, and the trained attributor consistently improves reasoning accuracy at test time, outperforming baselines that lack graph structure or paired analysis.

大模型推理故障归因超图建模

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