After going through ~15 agentic-loop papers (the wins and the failures), the thing that predicts success is the verifier, not the model
Summary
A multi-tweet analysis of ~15 agentic-loop papers concludes that the verifier, not the model, is the key predictor of success, with examples showing that robust, non-gamable checks (e.g., compilers, tests, verifiable rewards) dramatically improve performance, while failures stem from lack of such verifiers or gaming vulnerabilities.
Similar Articles
The Verification Horizon: No Silver Bullet for Coding Agent Rewards
This paper explores the challenges of verifying AI coding agents' outputs, arguing that verification is becoming harder than generation as models improve. It analyzes four reward constructions and shows that no fixed reward function remains effective as model capability grows.
@omarsar0: Verifiers are a big deal. Without good verifiers, /goal & /loop breaks a lot. Anything out of distribution for an LLM, …
Emphasizes the importance of verifiers for LLM-based agents, noting that out-of-distribution tasks cause failures, and suggests tuning custom verifiers.
The agent failures that cost me the most all reported success
The author analyzed 155 AI agent jobs and discovered that most failures stemmed from infrastructure issues like timeouts and false success signals, not model errors, leading to practices such as asserting on effects and using multiple verification paths.
Agentic Proving for Program Verification
This paper evaluates Claude Code in an agentic proving framework on the Clever benchmark for program verification, achieving over 98% success in specification generation and end-to-end verification, revealing that existing benchmarks may be insufficient for evaluating modern agentic provers.
AgentV-RL: Scaling Reward Modeling with Agentic Verifier
AgentV-RL introduces an Agentic Verifier framework that enhances reward modeling through bidirectional verification with forward and backward agents augmented with tools, achieving 25.2% improvement over state-of-the-art ORMs. The approach addresses error propagation and grounding issues in verifiers for complex reasoning tasks through multi-turn deliberative processes combined with reinforcement learning.