Does checking each step actually prevent repeated mistakes?
Yes—process supervision (rewarding each intermediate step) beats outcome-only supervision (rewarding only the final answer) for training models on multi-step math. In a 2023 study, a model trained with step-level feedback solved 78% of problems from a challenging MATH subset, significantly outperforming outcome-supervised models [2]. That means checking each step catches errors early, so the model learns to avoid them in future attempts.
The benefit extends beyond training to verification at inference time. Math-Shepherd, a process reward model that scores each step, improved Mistral-7B's accuracy on GSM8K from 77.9% to 84.1% when used for step-by-step reinforcement learning, and further to 89.1% when used to rerank multiple outputs [4]. In plain terms, adding step-level checks lifted accuracy by about 6–11 percentage points—a meaningful reduction in repeated mistakes.
Why doesn't verification fully eliminate repeated mistakes?
Even with verification, models still make logical errors. The same 2023 study that showed process supervision's superiority noted that state-of-the-art models 'regularly produce logical mistakes' [2]. And a separate 2023 study found that GPT-3/4 models exhibit poor self-consistency in multi-step reasoning—they fail to predict their own outputs in hypothetical contexts and produce inconsistent final answers when intermediate steps are replaced [6]. So verification reduces but doesn't guarantee error-free repetition.
Another limitation: step-level rewards can introduce systematic noise, and Monte Carlo sampling to estimate them is computationally prohibitive [1]. This means that in practice, verifying every step may be too costly or noisy, especially for long-horizon tasks. The solution proposed in 2026 is to focus verification only on 'critical steps'—decision points where a different action flips the outcome from failure to success—which improved performance by 37% and 26% over a baseline on two agent benchmarks while requiring supervision on only 16% of steps [1].
Under what conditions does verification work best?
Verification works best when it's targeted and combined with uncertainty awareness. The 2026 CSO method shows that focusing on critical steps—rather than all steps—yields large gains with minimal supervision [1]. This suggests that not all steps are equally error-prone; identifying the high-impact ones is key.
Also, models that know when they don't know can avoid repeating mistakes by asking for help. The KnowNo framework (2023) aligns LLM planners' uncertainty using conformal prediction, providing statistical guarantees on task completion while minimizing human help in multi-step robot planning [3]. This complements verification: instead of blindly proceeding, the model requests assistance when uncertain, preventing cascading errors.
Finally, verification can be applied iteratively to improve retrieval for verifiable generation. LLatrieval (2023) has the LLM update retrieval results until it verifies that the documents sufficiently support the answer, achieving state-of-the-art results [5]. This shows that verification isn't just for math—it also helps in knowledge-intensive tasks where repeated mistakes stem from missing or wrong information.
About These Sources
This answer is built on 6 studies (all preprints) — published from 2023 to 2026, 1 from 2024 or later, collectively cited 81 times — selected as the most relevant from 6 studies that passed quality screening, drawn from 31 papers retrieved from a database of over 500 million.
Sources used in this answer
Verified Critical Step Optimization for LLM Agents
Proposes Critical Step Optimization (CSO), which focuses preference learning on verified critical steps; achieves 37% and 26% relative improvement over SFT baseline on GAIA-Text-103 and XBench-DeepSearch, requiring supervision on only 16% of steps.
Let's Verify Step by Step
In a 2023 study, process supervision significantly outperformed outcome supervision for training models on the MATH dataset, with the process-supervised model solving 78% of a representative subset; also released PRM800K, a dataset of 800,000 step-level human feedback labels.
Robots That Ask For Help: Uncertainty Alignment for Large Language Model Planners
Presents KnowNo, a framework using conformal prediction to align LLM planners' uncertainty, enabling them to ask for help when needed; provides statistical guarantees on task completion while minimizing human help in multi-step robot planning.
Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations
Introduces Math-Shepherd, a process reward model trained with automatically constructed step-level supervision; step-by-step PPO improved Mistral-7B accuracy from 77.9% to 84.1% on GSM8K and from 28.6% to 33.0% on MATH, with further gains via verification reranking (89.1% and 43.5%).
LLatrieval: LLM-Verified Retrieval for Verifiable Generation
Proposes LLatrieval, where the LLM iteratively verifies and updates retrieval results until they sufficiently support answering the question, achieving state-of-the-art results in verifiable generation.
Two Failures of Self-Consistency in the Multi-Step Reasoning of LLMs
Demonstrates that GPT-3/4 models exhibit poor hypothetical and compositional self-consistency in multi-step reasoning, indicating that even advanced models fail to maintain consistency across contexts and sub-steps.
