FineVerify: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search
Summary
FineVerify is a self-verification framework for agentic search that decomposes questions into sub-questions, verifies sampled candidates, and selects the best one, achieving substantial accuracy improvements over baselines on multiple benchmarks, including enabling GPT-5-mini to surpass GPT-5 on BrowseComp-Plus.
View Cached Full Text
Cached at: 06/02/26, 03:36 PM
Paper page - FineVerify: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search
Source: https://huggingface.co/papers/2606.00660
Abstract
FineVerify is a self-verification framework for agentic search that improves accuracy through decomposed sub-question checking and trajectory selection.
Agentic searchrequireslanguage model agentsto explore many sources and answer complex information-seeking questions. Scalingtest-time computeis a promising way to improve these agents, but current approaches can fail, because correct answers are often sparse andscore-based selectiondepends on model calibration. We propose FineVerify, afine-grained self-verificationframework that decomposes each question intocheckable sub-questions, verifiessampled candidatesagainst each sub-question, and selects the candidate with the highestaggregated score. This per-check structure turns selection into simpler local judgments and produces scores under the same explicit criteria. Across fouragentic searchbenchmarks and two models, FineVerify consistently outperforms standard scaling baselines. With only four sampled trajectories, it improves GPT-5-mini by 8.2 accuracy points and Gemini-3-flash by 5.6% on average. With 12 samples, FineVerify enables GPT-5-mini to surpass frontier GPT-5 onBrowseComp-Plus. Beyond accuracy, FineVerify produces interpretable verification traces that help audit benchmark errors, suggesting broader applications for inspectingagentic searchsystems. Code and data are available at https://github.com/XuZhao0/fineverify
View arXiv pageView PDFGitHub2Add to collection
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2606.00660 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2606.00660 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2606.00660 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
The verifier based vs verifier free test time scaling result is older than people act, and it keeps getting confirmed [D]
The post discusses the confirmed research finding that verifier-based test-time compute scaling dominates verifier-free methods, with practical examples like Apodex showing gains from separate verification processes. It argues that building independent verifiers is a key path for future AI capability improvements.
Scaling self-verification with DeepSeek V4 Flash beats Claude Fable 5 on Terminal-Bench 2.1, while being 11x cheaper
LLM-as-a-verifier is a framework providing fine-grained feedback for AI agents, achieving state-of-the-art performance on benchmarks like Terminal-Bench 2.1 with DeepSeek V4 Flash, outperforming Claude Fable 5 at lower cost.
VeriHarness: Scaling Agentic Verification for Long-Horizon Tasks
VeriHarness turns an LLM generator into an agentic verifier—using a workspace, evidence tools, reusable verification skills, a disagreement resolver, and a consensus challenger—to select reliable outputs for long-horizon tasks without reference answers. It achieves top selection scores across five benchmarks, gains of 6.2–6.4 points over single rollouts with Gemini 3.5 Flash and Claude Opus 4.8, and releases ~26,000 rollouts costing over $100,000.
False Frontiers: Diagnosing and Mitigating Co-Cheating in Self-Evolving Search Agents
This paper identifies "co-cheating" in self-evolving search agents, where a proposer and solver converge on shared errors that inflate internal reward without improving true correctness. It proposes CrossFit, a cross-fitted verification scheme that substantially reduces false agreement and boosts performance on seven search benchmarks with Qwen3.5-4B/9B models.
Verification and Self-Improvement in Agentic AI: Foundations and Limits
该论文提出一个理论框架，通过带隐藏终端随机性的有界验证来分析搜索、支持与检查器变化如何影响 Agentic AI 系统可接受的任务集合，并证明了独立多数放大、随机化验证器类的复杂度包含关系，以及在统一有界自修改下递归自我改进仍停留在同一验证类内的结论。