- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how to calibrate an LLM's verbalized confidence at any point during generation, not just before or after the answer. The target at each position is the probability that the final answer will be correct, given the partial solution so far. The authors first show that asking for confidence before answering can change the answer itself. Motivated by this, they propose PACE. PACE fixes a set of graded solutions and trains the model to report its confidence at random cut points using a Brier reward. They also show that GRPO's standard-deviation normalization hurts calibration. Across five models and seven benchmarks, PACE is comparable to or better than existing methods at both ends. A routing experiment shows that deciding before the answer saves more cost.
Critical strengths
-
A simple, well-motivated design. The paper shows that asking for confidence before answering can change the answer itself, so a confidence trained this way may not reflect what the model would actually do. Training confidence on fixed, already-graded solutions avoids this problem cleanly, and one trained model can then report confidence at any position.
-
Careful and honest evaluation. The method is tested across several models and benchmarks, and the ablations line up with the main design choices, especially the effect of GRPO's normalization. The authors are also clear about what their theory does and does not cover.
Critical weaknesses
None
Questions for authors
How does PACE perform at fixed token positions? Intermediate positions are chosen as a fraction of the final solution length, but during real generation that length is unknown. How will the author solve this problem?
3 comments
Thank you for the detail rebuttal. I would keep my positive score.
Thank you for taking the time to read our rebuttal and for confirming your positive assessment. We sincerely appreciate your thoughtful review and consideration.
response
Thank you for the positive assessment and for a question that matters for deployment.
Q: The final length is unknown during generation. How does PACE perform at fixed token positions? PACE never needs the final length. The probe state st=(x,R,y≤t,P) contains only the prefix; the model never sees u or T. The relative position u is only a sampling rule for choosing training prefixes, and at inference one probes at any absolute index: every k tokens, at a step boundary, or on demand. The revision states this in a Deployment paragraph (Section 5).
To test it directly, we probed at fixed token indices, each model on its own DeepMath-500 solutions. At index t only solutions longer than t remain, and their accuracy falls with t because long solutions are more often wrong, so a correct readout must track a moving base rate. As in Table 45, surv./acc. is the fraction of solutions longer than t and their accuracy:
This table is Table 45 (Appendix J.3) in the revision, and the Limitations section states the degradation.