- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies models that continue reasoning after they have settled on an answer. Their method uses classifier probes trained on the model’s hidden states to detect this point, then they penalize continued reasoning during GRPO training. The same classifier can also stop reasoning at inference time. The paper reports shorter responses with similar average accuracy to standard GRPO. (They also report substantial accuracy drops on harder benchmarks.)
Critical strengths
S1. The problem and the method intuitively make sense. Targeting reasoning after answer commitment could preserve useful computation better than penalizing all generated text (especially for problems that require longer reasoning).
Critical weaknesses
W1. I am not convinced that the methodological contribution is sufficiently significant relative to existing work. The commitment probe is used by [1], forced exits are used by [2], and ProFIL already uses a commitment-related probe to modify GRPO training. The main difference seems to be just changing the reward function by applying a graded penalty.
Comparisons with closely related efficient-reasoning methods are also missing (there are many training optimization methods like [3]). The comparisons against inference-time works also lack (such as [4]), and also many entropy-based methods.
[1] Reasoning Models Know When They’re Right [2] LYNX: Learning Dynamic Exits for Confidence-Controlled Reasoning [3] SLAT: Segment-Level Adaptive Trimming for Efficient CoT Reasoning [4] Dynamic Early Exit in Reasoning Models
W2. The experiments do not establish that CAP offers a better accuracy–cost tradeoff than simpler alternatives. In the main comparison, CAP uses 6.5k tokens on average, while the conventional length penalty uses 4.8k. Its higher accuracy may therefore come from removing less reasoning rather than better identifying which reasoning to remove.
The authors also test a weaker length penalty halfway through training, where its average accuracy is slightly higher than CAP, but do not report its final results. I would like to see this comparison completed and Pareto curves showing accuracy against token cost under matched training and tuning budgets. This would help establish whether the commitment probe adds value beyond a less aggressive length penalty.
Questions for authors
Q1. Do you have full-scale results for the weaker length penalty or accuracy–token Pareto curves?
Q2. Have you checked whether the probe still detects commitment correctly after the full CAP training run? A lower penalty could mean the model produces less unnecessary reasoning, but it could also mean the probe detects commitment later or misses it. The current check seems limited to the smaller training experiment.
Q3. The stopping threshold was chosen using the MATH-500 evaluation traces, but the same setting causes substantial accuracy losses on other benchmarks. Could these losses come from stopping too early on harder tasks? Have the authors evaluated a threshold chosen on a separate validation set to distinguish a poorly chosen threshold from limitations of the probe itself?