Finding the Cracks: Improving LLMs Reasoning with Paraphrastic Probing and Consistency Verification
Weili Shi, Dongliang Guo, Lehan Yang, Tianlong Wang, Hanzhang Yuan, Sheng Li

TL;DR
This paper introduces PPCV, a framework that improves large language models' reasoning by identifying critical tokens through paraphrastic probing and verifying answer consistency across multiple reasoning paths.
Contribution
The paper presents a novel two-stage method for detecting and leveraging critical tokens to enhance reasoning accuracy in LLMs, addressing challenges in error accumulation.
Findings
PPCV significantly improves reasoning performance on multiple benchmarks.
The method effectively identifies influential tokens in reasoning processes.
Enhanced reasoning accuracy compared to baseline models.
Abstract
Large language models have demonstrated impressive performance across a variety of reasoning tasks. However, their problem-solving ability often declines on more complex tasks due to hallucinations and the accumulation of errors within these intermediate steps. Recent work has introduced the notion of critical tokens--tokens in the reasoning process that exert significant influence on subsequent steps. Prior studies suggest that replacing critical tokens can refine reasoning trajectories. Nonetheless, reliably identifying and exploiting critical tokens remains challenging. To address this, we propose the Paraphrastic Probing and Consistency Verification~(PPCV) framework. PPCV operates in two stages. In the first stage, we roll out an initial reasoning path from the original question and then concatenate paraphrased versions of the question with this reasoning path. And we identify…
Peer Reviews
Decision·Submitted to ICLR 2026
* Novel approaches. The method of identifying critical tokens is sound and interesting. The method does not require heavy token-level annotation to get token-level classification. * Results are promising. Improvements are observed consistently across 5 different datasets and 2 models.
My main concern is that the methods do not seem generalizable. * First, it is hard to control the quality of the paraphrased questions. Although authors design careful instructions to ensure numbers are not changed, we do not have an evaluation metric to control. * Second, the methods can only be applied to greedy decoding; otherwise, the current method will tend to select non-top-1 tokens as the critical token. * Third, the current methods work well for one critical token but is hard to gene
- Interesting idea. - Good ablation analysis.
- No analysis with larger reasoning models. - No use of pass@k. - Computational cost analysis is insufficient.
- The paper is overall well-written and easy to follow. - The idea of locating the critical tokens makes sense, and does not rely on external models. - Experimental results show that PPCV outperforms the other counterparts by a clear margin.
- My main concern is the efficiency of the proposed framework. If I understand correctly, PPCV requires multiple passes of LLMs, e.g., paraphrasing the question, obtaining the initial reasoning paths, obtaining the critical tokens by feeding into multiple paraphrased questions, and generating a group of new trajectories. The total framework is complex and would lead to much inference latency. The comparison of the inference time in Figure 7 is also confusing. For example, in the case of the SVAM
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Text Readability and Simplification
