mlsanityData to 7 Oct 2026

AutoVerifier: Residual-Guided Non-Parametric Optimization for Reference-Based Answer Verification

arXiv 2608.25637 ↗First posted 26 Aug 2026cs.CLcited by 0

On the map: LLM reasoning → Reinforcement learning for reasoning

Abstract (arXiv)

Reference-based verifiers are important for evaluating reasoning models and providing accurate outcome rewards in reinforcement learning with verifiable rewards. To improve verification accuracy, prior work has explored rule-based, model-based, and tool-augmented verifiers for checking answer equivalence across diverse answer forms. However, the equivalence of answer forms such as 1+3.14 and 1+π may depend on the question and scoring criterion. We frame such implicit assumptions as verifier inductive biases. To address this challenge, we propose AutoVerifier, a residual-guided non-parametric optimization method that learns these biases from recurring verifier errors. Specifically, AutoVerifier records these biases in rule cards and promotes them to code modules or prompt guidance only after replay validation detects no direct regressions, keeping accepted updates auditable, editable, and reusable. Experiments on four verifier benchmarks demonstrate that AutoVerifier outperforms state-of-the-art verifiers by a large margin.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Reinforcement learning for reasoning, one of 17 directions in LLM reasoning. Builds on 16 of its 22 references that are in the map. First posted on arXiv 26 Aug 2026.

Builds on

16 of 22 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025From Accuracy to Robustness: A Study of Rule- and Model-based Verifiers in Mathematical Reasoning28 May
  2. 2025VerifyBench: Benchmarking Reference-based Reward Systems for Large Language Models21 May
  3. 2025Inference-Time Scaling for Generalist Reward Modeling3 Apr
  4. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scale18 Mar

Other references · 12

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  2. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 763
  3. 2025SkillWeaver: Web Agents can Self-Improve by Discovering and Honing Skillscited by 174
  4. 2024MAmmoTH2: Scaling Instructions from the Webcited by 143
  5. 2025JudgeLRM: Large Reasoning Models as a Judgecited by 76
  6. 2025xVerify: Efficient Answer Verifier for Reasoning Model Evaluationscited by 53
  7. 2026Skill-Pro: Learning Reusable Skills from Experience via Non-Parametric PPO for LLM Agentscited by 44
  8. 2025CompassVerifier: A Unified and Robust Verifier for LLMs Evaluation and Outcome Rewardcited by 39
  9. 2025AgentRM: Enhancing Agent Generalization with Reward Modelingcited by 25
  10. 2026ReCreate: Reasoning and Creating Domain Agents Driven by Experiencecited by 22
  11. 2025CoSineVerifier: Tool-Augmented Answer Verification for Computation-Oriented Scientific Questionscited by 4
  12. 2026DataMaster: Data-Centric Autonomous AI Researchcited by 3

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025VerifyBench: A Systematic Benchmark for Evaluating Reasoning Verifiers Across Domains
  2. 2025Reinforcing General Reasoning without Verifiers
  3. 2025Reinforced Informativeness Optimization for Long-Form Retrieval-Augmented Generation
  4. 2026Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning
  5. 2025RLPR: Extrapolating RLVR to General Domains without Verifiers
  6. 2025RAVR: Reference-Answer-guided Variational Reasoning for Large Language Models
  7. 2026ReSolve: Reusing Candidate Reasoning through Selective Generative Moderation
  8. 2026When Many Answers Are Valid, Voting Fails: Symbolic Verification for Best-of-K Causal Reasoning in LLMs