Skip to content

EvoBrowseComp: Benchmarking Search Agents on Evolving Knowledge

Jun 2026 · arXiv.org · Vol abs/2606.13120 · 2 citations · 24 references
Computer Science

TL;DR

EvoBrowseComp is introduced, an evolving benchmark of 400 English and 400 Chinese contamination-free complex questions synthesized via live-web traversal that establishes a scalable paradigm for auto-updatable, high-difficulty benchmarking that keeps pace with both evolving world knowledge and advancing agent capabilities.

Abstract

Search Agents -- large language models augmented with search tools -- have intensified the need for future-proof evaluation benchmarks. Existing benchmarks such as BrowseComp rely on static knowledge, making them vulnerable to test-set contamination and parametric memorization. Consequently, models can achieve high scores through fact recall rather than genuine retrieval, obscuring true browsing competence via reasoning shortcuts. In this paper, we introduce EvoBrowseComp, an evolving benchmark of 400 English and 400 Chinese contamination-free complex questions synthesized via live-web traversal. To collect these questions, we design a three-agent collaborative framework: (1) a QA synthesis agent that retrieves fresh knowledge from the live web to synthesize QA pairs; (2) an information filtering agent that filters retrieved knowledge in terms of credibility and popularity to block parametric shortcuts; and (3) a high-level guidance agent that formalizes questions into reasoning graphs to reduce logical redundancy and shortcuts in synthesized QA pairs. Because the framework supports fully automated synthesis, EvoBrowseComp can be regularly updated to prevent data contamination and maintain temporal freshness. Extensive experiments confirm its great difficulty, requiring broad horizontal search. It establishes a scalable paradigm for auto-updatable, high-difficulty benchmarking that keeps pace with both evolving world knowledge and advancing agent capabilities.

View source

Similar papers

Preprint Aug 2026

EviGraph: Towards Verifiable Evidence Construction for Information-Seeking Agents

EviGraph is presented, a deep-search framework that separates search execution from evidence recording while using a shared policy for the trainable roles, enabling reinforcement learning to directly supervise evidence construction rather than only the final answer.

Jia-Shun Chen, Yirong Mao, Wen-Hui Que · 1 citation
#natural language process... Preprint Sep 2026

EvoDuet: Bilevel Co-Evolution of Web Searching and Task Solving for Scientific Discovery

Evolutionary search with large language models (LLMs) can stall when progress requires external knowledge the model lacks. Supplying relevant documents helps, but simply adding web search tool can keep returning the same pages as solutions change. We introduce EvoDuet, a bi-level optimization method that co-evolves sol...

Young-Jun Lee, Jinheon Baek, Soyeong Jeong et al. · 0 citations
Preprint Sep 2026

AlgoEvo: Self-Evolving Agentic Search for Automated Algorithm Discovery

AlgoEvo is introduced, a unified agentic architecture that transforms automated algorithm discovery into an interactive, knowledge-accumulating process, demonstrating strong intra-task accumulation, cross-task transfer, and the ability to reproduce or exceed the strongest existing methods through flexible skill activat...

Jun-Hao Qiu, Qing-Long Hu, Ji Cheng et al. · 1 citation
#artificial intelligence Preprint Sep 2026

AgentHop: A Diagnostic Benchmark for Agentic Multi-Hop Scientific Question Answering

AgentHop, a diagnostic benchmark of 1,011 multiple-choice questions paired with a controlled seven-tool sandbox under fixed token, turn, and tool-call constraints, and the full benchmark set and the harness are released to support diagnostic agent benchmarking.

Chanhee Park, Jeongho Yoon, Sun Han et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.