Argument Graph Uncertainty: Quantifying Uncertainty from the Logical Structure of Reasoning Chains· 论证图不确定性:从推理链逻辑结构量化不确定性
Reliable uncertainty estimation is essential for deploying large language models in high-stakes reasoning tasks, yet most existing approaches rely on expensive sampling strategies or shallow token-level signals that ignore the internal logical structure of model outputs. We introduce Argument Graph Uncertainty, a post-hoc framework for multiple choice question tasks, that estimates model confidence directly from the logical structure of a single chain-of-thought reasoning trace. Our method uses either a lightweight instruction-tuned model or a simple deterministic rule to segment the reasoning chain into propositional units, then applies a NLI model to infer relational edges and construct two complementary argument graphs over these segments. The resulting edge scores are aggregated into a
从推理链逻辑结构量化大模型不确定性的新方法
- 核心方法
- 通过将推理链分割为命题单元,使用NLI模型推断关系边,构建论证图来估计模型信心
- 适合谁读
- 研究者、工程师
- 要解决的问题
- 现有不确定性估计方法成本高且忽视模型输出内部逻辑结构
- 关键实验
- 未提供
- 主要贡献
- 提出了一种低成本的、不依赖于采样策略的不确定性估计算法
- 意义与局限
- 提高大型语言模型在高风险任务中的可靠性,但可能局限于特定类型的任务