LLMs Struggle with Robust Step-Level Math Verification, Study Finds

Fateme Mazdarani, Carlos Toxtli· September 1, 2026 View original

Key takeaways

  • LLMs exhibit a significant robustness gap in step-level mathematical verification, struggling with non-canonical but valid solutions.
  • Current models are highly sensitive to the form of a solution, often falsely rejecting correct perturbed traces.
  • Evaluating LLMs as verifiers requires separate metrics for robustness beyond just solver accuracy.
  • Improving LLM robustness for process-level verification remains a challenging area for research and development.

Who benefits

Software DevelopmentFinancial ServicesEducationLegalEngineering

Summary

A new benchmark reveals that large language models (LLMs) often fail to robustly verify non-canonical but logically valid mathematical solutions, showing significant sensitivity to solution format. Models struggle particularly with identifying the first incorrect step in perturbed traces, even when performing well on standard solutions.

Researchers have developed a new benchmark to assess the robustness of large language models (LLMs) when acting as verifiers for mathematical solutions. Unlike traditional evaluations that focus solely on final answer accuracy, this benchmark specifically tests an LLM's ability to judge step-level correctness, even when solutions deviate from canonical forms. The study uses a controlled linear-equation task where LLMs must determine final answer correctness, step-level trace correctness, and pinpoint the first error. The evaluation of state-of-the-art open LLMs, including GPT-OSS 20B, Qwen3-14B, and Phi-4-Reasoning, uncovered a significant robustness gap. While these models perform well on canonical solution traces, their accuracy degrades substantially when presented with perturbed but logically equivalent variants. For instance, false-rejection rates for valid perturbed traces reached 75.6-85.3%, highlighting a strong sensitivity to the exact form of the solution. Even with supervised fine-tuning or distillation, improvements were inconsistent and sometimes came at the cost of canonical performance, indicating that reliable process-level verification remains a significant challenge.

Why it matters

Professionals relying on LLMs for automated code review, logical verification, or process auditing need to understand these models' limitations in handling non-standard but correct inputs. This research highlights that current LLMs may not be robust enough for critical verification tasks where flexibility in solution paths is common.

How to implement this in your domain

  1. 1Develop custom evaluation benchmarks that include diverse, non-canonical valid solutions for any LLM-based verification system.
  2. 2Implement adversarial testing strategies to intentionally perturb valid inputs and assess LLM robustness before deployment.
  3. 3Consider hybrid verification approaches that combine LLM capabilities with symbolic reasoning or rule-based systems for critical steps.
  4. 4Train LLMs with a broader dataset of valid but varied solution paths to improve their generalization beyond canonical examples.

Original post by Fateme Mazdarani, Carlos Toxtli

"arXiv:2608.28725v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used as graders, verifiers, and process auditors, but most mathematical evaluations still emphasize final-answer accuracy. This can obscure whether a model can verify a non-canonical but…"

View on X

Originally posted by Fateme Mazdarani, Carlos Toxtli on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses