- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper analyzes the early stopping for reasoning trace, aims at reducing the time costs for non-neccessary judgement of the follow-up steps. A prefix is decision-sufficient when every allowed completion of its unseen scores yields the same final decision. The proposed method defines this using reachable score intervals. Closed-form bounds are derived for different aggregation methods. Across multiple PRMs and benchmarks, the method saves verifier input and verification time.
Critical strengths
- The paper removes structural verification redundancy, giving an interesting and novel direction distinct from statistical calibration or predictive early-exit methods.
- The proposed method is simple, training-free, and easy to integrate with existing PRM verifiers.
Critical weaknesses
- The paper lacks a comparison with one-pass full verification, which may be more efficient than incremental verification in practical deployment. Moreover, the two execution modes can produce different scores and final decisions.
- The main results rely largely on min/max aggregation. For the sum, product, and mean settings, the paper does not report the corresponding full verifiers’ accuracy or decision distributions.
- Actual runtime gains are demonstrated only for min aggregation. It remains unclear whether the more general aggregation settings provide similar wall-clock benefits.
- In the minimum setting, early stopping appears to certify only INVALID decisions. The authors should clarify this limitation and discuss whether early VALID or ABSTAIN decisions are possible in practical settings.
Questions for authors
Please refer to the Weaknesses.