为大模型推理结果提供带统计保证的不确定性量化方法
Quantifying and Understanding Uncertainty in Large Reasoning Models

- 基于置信预测构建推理-答案结构的不确定性集
- 首次实现推理步骤与答案间逻辑关联的可解释性分析
- 适合关注模型可信度与决策透明性的研究人员
大型推理模型(LRMs)在复杂推理任务上取得显著进展。然而,传统生成不确定性量化方法缺乏有限样本保证,难以应对推理过程的复杂性。本文提出一种新方法,利用无分布假设且模型无关的置信预测(CP),对推理链与最终答案联合建模,构建具有统计严格性的不确定性集合。针对现有方法忽略推理路径与答案之间逻辑关联的问题,本文进一步设计统一的示例到步骤解释框架,通过Shapley值识别出保留保证所需的最小训练示例子集及其关键推理步骤。理论分析证明了所提方法的可靠性。在多个高难度推理数据集上的大量实验验证了方法的有效性。
原文摘要 · Abstract (English)
Large Reasoning Models (LRMs) have recently demonstrated significant improvements in complex reasoning. While quantifying generation uncertainty in LRMs is crucial, traditional methods are often insufficient because they do not provide finite-sample guarantees for reasoning-answer generation. Conformal prediction (CP) stands out as a distribution-free and model-agnostic methodology that constructs statistically rigorous uncertainty sets. However, existing CP methods ignore the logical connection between the reasoning trace and the final answer. Additionally, prior studies fail to interpret the origins of uncertainty coverage for LRMs as they typically overlook the specific training factors driving valid reasoning. Notably, it is challenging to disentangle reasoning quality from answer correctness when quantifying uncertainty, while simultaneously establishing theoretical guarantees for computationally efficient explanation methods. To address these challenges, we first propose a novel methodology that quantifies uncertainty in the reasoning-answer structure with statistical guarantees. Subsequently, we develop a unified example-to-step explanation framework using Shapley values that identifies a provably sufficient subset of training examples and their key reasoning steps to preserve the guarantees. We also provide theoretical analyses of our proposed methods. Extensive experiments on challenging reasoning datasets verify the effectiveness of the proposed methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。