arXiv:2605.23074cs.AI2026-05

区分反思标记类型,动态调整推理路径,提升大模型推理效率与准确率。

PathCal: State-Aware Reflection-Marker Calibration for Efficient Reasoning

论文配图:PathCal: State-Aware Reflection-Marker Calibration for Efficient Reasoning
图 1 · 摘自论文原文
  • 按反思标记功能分类型干预,识别推理中的不确定状态
  • 在模型未稳定前干预,显著减少生成长度30%以上,保持准确率
  • 无需额外验证器或采样,适合资源受限场景的高效推理

大型推理语言模型通过测试时扩展生成长链思维(CoT)轨迹来处理复杂任务,这些轨迹常包含如'wait'、'but'、'alternatively'等反思标记,分别表示犹豫、修正和考虑替代路径。现有方法将这些标记视为单一粗粒度类别,忽视其功能差异。本文通过类型抑制与固定前缀干预发现,不同标记对准确率和生成长度影响各异,且其作用在模型尚未形成稳定推理轨迹前最为关键。基于此,我们提出PathCal——一种无需训练的解码控制器,通过分析反思标记分布,判断当前轨迹与潜在分支的竞争强度,在局部不确定性状态下软性重平衡标记逻辑,仅在必要时干预。在六个推理基准上的实验表明,PathCal在不依赖外部验证器或额外采样的前提下,实现更优的效率-性能权衡:准确率保持或提升的同时,生成长度平均减少32.6%,最大降幅达41.2%。

原文摘要 · Abstract (English)

The emergence of Large Reasoning Language Models (LRMs) has paved the way for tackling complex reasoning tasks through test-time scaling by generating long-form Chain-of-Thought (CoT) trajectories during inference. Meanwhile, these trajectories often contain explicit reflection markers such as ``wait'', ``but'', and ``alternatively'', signaling hesitation, revision, and the consideration of alternative explorations, respectively. Recent studies on test-time control leverage such markers as lightweight handles for steering reasoning, typically treating them as a single coarse-grained category rather than distinguishing their distinct functional roles. In this paper, we conduct type-wise suppression and fixed-prefix intervention, revealing that reflection markers differ not only in their functional roles but also in when they exert the greatest influence. Specifically, different marker classes affect accuracy and generation length in distinct ways, and marker choices are most consequential before the model settles into a stable reasoning trajectory. Motivated by these findings, we introduce PathCal, a novel training-free decoding controller that calibrates reasoning paths by distinguishing marker types and intervening only at locally uncertain states. At each decoding step, PathCal utilizes the distribution over reflection-markers to estimate local competition between maintaining the current reasoning trajectory and initiating a competing branch, and softly rebalances marker logits when competing-branch evidence becomes excessive. Experiments across six reasoning benchmarks demonstrate that PathCal achieves a better efficiency--performance trade-off, improving or preserving accuracy while reducing generation length, without relying on external verifiers or additional sampling.

推理优化反思标记高效生成无监督控制

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