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

arXiv:2605.23074v2 Announce Type: replace Abstract: Large Reasoning Language Models (LRMs) tackle complex tasks through test-time scaling, generating long-form Chain-of-Thought (CoT) trajectories during inference. These trajectories contain reflection markers such as wait, but, and alternatively, accompanying hesitation, revision, and alternative explorations. Recent test-time control methods use these markers to steer reasoning, but treating them as one coarse-grained category can obscure their distinct intervention effects. We study how marker identity and reasoning context shape these effects. Type-wise suppression produces different accuracy--length tradeoffs, while fixed-prefix interventions show that the relative benefit of continuation and revision varies across prefixes and tasks. Motivated by these findings, we introduce PathCal, a training-free controller that adjusts the strength of a fixed continuation bias using instantaneous competition among continuation, revision, and alternative-opening markers. It applies finite logit adjustments without additional model forward passes. An exact log-odds identity and frozen-prefix probes establish its local directional effect. Experiments show that PathCal improves the accuracy--length tradeoff in many mathematical reasoning settings and also reduces generation length in coding and multilingual mathematics.