arXiv Machine Learning

Better Policies, Worse Verifier Audits

The paper investigates how verifier components used in post‑training and test‑time loops can collapse when they are refreshed based on aggregate success scores. It shows that as a policy improves on one conjunctive target, the verifier’s on‑policy AUC can shift to favor a worse component, leading to a preference for a full‑outcome predictor over the intended component oracle. The authors provide theoretical thresholds, empirical demonstrations on text control and ECG data, and propose a repair that audits the component on its own failures to prevent damage.

arXiv AI
Oct 9

Who Verifies the Verifier? Co-Evolving Inspectable Graders with Self-Improving Agents

The paper introduces a method for co-evolving inspectable verifiers alongside self-improving agents. By synthesizing verifiers from clustered failures and selecting them based on agreement with a reference set, the authors demonstrate improved held‑out agreement on MBPP+ and outperform a bare LLM judge. They also show that removing anchor guards collapses the verifier into a vacuous grader, yet the collapsed verifier still trains skills effectively, indicating that downstream task scores cannot certify a self‑evolved verifier.

By Xing Zhang, Guanghui Wang, Yanwei Cui, Ziyuan Li, Wei Qiu, Bing Zhu, Peiyang He
arXiv AI
Oct 2

Verify Claims, Not Scores: Evidence-Based Verification of Modular Agents

The paper proposes a claim‑specific verification audit for modular agents that replaces aggregate task scores with evidence‑based evaluations. Each agent conclusion is recorded with supporting evidence and classified as supported, unsupported, unresolved, or not evaluated, along with the boundary of validity. The audit employs three tools—oracle policies, perfect component replacements, and verifier‑score tests—to trace value changes, locate lost value, and assess verifier effectiveness, demonstrated on a portfolio‑allocation agent in a synthetic market.

By Ali Atiah Alzahrani