Original title: Where the Verifier Fails: A Category-Level Audit of Reward Signals in RLVR
Esther Xin · September 2026
Computers learning math use automated verifiers to check whether answers are correct. These grading programs turn text answers into a simple pass or fail reward. However, grading code often marks correct answers wrong. To see why, researchers tested four popular verifiers across 307,420 verdicts. They did this by rewriting correct answers into equivalent forms that mean the exact same mathematical thing. Because the meaning never changes, any rejection proves the checker made a mistake without needing human review. The researchers found huge problems. First, verifier accuracy on identical inputs swings wildly, from 53.8% to 95.2%. Second, most mistakes are surprisingly silly: for the default LaTeX setup, whitespace and punctuation cause 93.0% of valid failures, dominated by a simple trailing period or newline. Finally, verifiers fail for opposite reasons, and one setup accepts totally wrong, off by one numbers once values reach 10^4 or higher.
Imagine submitting a math homework where your teacher only accepts answers written in a specific format. Even if your math is right, a missing space or extra period gets it marked wrong. In this paper, AI verifiers act like that teacher, rejecting correct answers due to trivial formatting issues.
This matters for researchers training AI, as small formatting errors can invalidate correct answers, skewing results and wasting resources.
The abstract doesn't say, but the study focuses on specific verifiers and answer categories, not all possible error sources.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
Where the Verifier Fails: A Category-Level Audit of Reward Signals in RLVR — Esther Xin
Abstract licence: CC0
Explanation generated by Synthesis from the abstract — it is not the original paper. This is a preprint, so it hasn't necessarily been peer reviewed.