Back to Devoured - October 09, 2026
DEVOURED
ATLAS: Evaluating Agents on Search-Intensive Tasks

ATLAS: Evaluating Agents on Search-Intensive Tasks

AI Exa
Exa released ATLAS, a new benchmark designed to evaluate search-intensive agents on unmemorized, real-world research tasks.
What: ATLAS consists of 547 multi-hop research tasks that require exhaustive search, revealing that no current agent can complete them reliably under a $1 cost threshold.
Why it matters: Existing search benchmarks are often saturated or heavily memorized by models; ATLAS provides a more accurate representation of how search agents actually perform in the wild.
Deep dive
  • Dataset Scope: Features 547 deep research tasks requiring 2–10 multi-hop attributes per entity.
  • Evaluation Metric: Uses three F1 metrics: Discovery (finding rows), Row (all cells correct), and Item (cell accuracy).
  • Cost Efficiency: Grading an entire suite costs ~$0.24, significantly cheaper than LLM-judge benchmarks like WANDR.
  • Reliability: Audit of the golden key shows less than 1% error rate, verified by manual human intervention.
  • Search Bottleneck: The benchmark demonstrates that model intelligence is currently less of a bottleneck than search retrieval quality.
Decoder
  • Row F1: A scoring metric that counts a result as correct only if all attributes in a row are perfectly matched.
  • Multi-hop: A search pattern where an agent must follow links or perform subsequent searches to gather linked information across multiple domains.
Original article

Today we’re previewing ATLAS, a new benchmark designed to grade the accuracy and completeness of agent responses to challenging real-world workflows that heavily utilize web search. ATLAS pairs queries grounded in real search demand with verified golden answers, using an automated pipeline that lets us refresh both as the web and models evolve.

Some of our takeaways from our runs of ATLAS to date:

  • Comprehensive search at a reasonable cost is far from solved. Max-effort search agents consistently outperformed their lower-compute counterparts, but no agent run costing less than $1 per task achieved a row F1 over 0.5.
  • Even the most expensive search agents miss about 1/3 of the golden results, indicating substantial room for web search to improve performance in use cases where completeness is critical.
  • When holding the model harness fixed, Exa defines the cost-performance Pareto frontier, with scores ranging 16% across different search backends.

What does a good benchmark look like?

When language models first started using web search, they would often get stuck managing long contexts or reasoning across multiple documents. Even the order of search results could throw them off. In short, agentic search was bottlenecked by intelligence. Now, frontier models handle these tasks much more reliably and at a fraction of the cost, so the bottleneck to completing deep and wide research tasks is whether your search backend can actually find relevant information in the world.

Recent bake-offs between agentic search configurations reflect the increasingly urgent need to rigorously evaluate web search efficacy. These evaluations seek to elucidate which combinations of harness, model, and search provider work best on challenging and economically valuable research tasks.

To support rigorous comparisons, we think an agentic search benchmark should:

  1. Require search. Answers must depend upon retrieving information from sources beyond what models already have memorized.
  2. Reward search quality and effort. High-quality search results and additional search volume should meaningfully improve scores.
  3. Represent real-world search tasks. Tasks must reflect what humans and agents actually search for.

These requirements may sound obvious, but today’s popular agentic-search benchmarks each fail one or more of them. Newer benchmarks stay fresh by grading with an LLM judge, which makes runs expensive to grade and highly sensitive to grader design.

These benchmarks tend to lose value over time as search providers optimize for them and the knowledge they require gets added to the latest frontier models. These issues are all downstream of the fundamental challenge that building new, high-quality search evals is slow and expensive. Therefore, agentic search benchmarks often go stale faster than they are replaced with fresh, up-to-date ones.

Designing ATLAS

We address these shortcomings with a new benchmark, ATLAS (Agentic Tasks for Large Aggregation + Search), consisting of 547 deep and wide research tasks. Tasks are generated from seed topics drawn from clustering of anonymized search demand. Each task asks a system to discover every entity (e.g. a person, place or company) that meets precise conditions, and then to enrich each entity with 2–10 multi-hop attributes.

Following a growing trend of synthetically generated benchmark data, we expend extensive inference-time compute within a structured pipeline to generate tasks and golden answers. Our pipeline includes a committee of frontier models and search providers which spend a median of 8 agent-hours and 1,200 searches per task to find answers, independently verify them against sources, and resolve disagreements or ambiguities until confident in their correctness. Because the pipeline is automated, we can regenerate the ATLAS dataset using topics based on recent search trends, keeping the benchmark aligned with what agents actually search for as the web updates.

Given the large amount of inference-time compute deployed at eval generation time, the challenge we pose for this benchmark is efficient search: solve each task in under a minute and for under $1, a budget at which no current system reaches even 0.5 row F1.

Results

Based on a suite of ablations and experiments, we believe that ATLAS rectifies the multitude of flaws present in current popular agentic search evals, providing a benchmark that truly measures search and distinguishes various systems by search quality and effort.

ATLAS strongly differentiates search providers.

ATLAS rewards search quality

ATLAS depends on search quality far more than existing benchmarks: when we severely degrade the quality of search by hiding the top 7 of every 10 search results, the same searcher loses roughly half of its ATLAS score. In contrast, on other benchmarks, the searcher retains 81–89% of its original score, indicating that these benchmarks do not actually measure search quality.

ATLAS is unmemorized

We measure memorization of evals by checking the percent of tasks whose full answer set is recalled by at least one of the major frontier models. Nearly 50% or more of other popular benchmarks are memorized.

In contrast, ATLAS’s older rows are less memorized, and it includes fresh information past current frontier model knowledge cutoffs, where frontier models almost never answer correctly without search. As a result, adding search to frontier models gives a much bigger lift in performance over a no-search baseline than current popular evals.

ATLAS requires wide and deep search

74% of ATLAS’s tasks ask for 10 or more entities, and each entity needs 2–10 attributes. Moreover, these wide and deep tables actually require multi-hop searches as opposed to retrieval from a single URL or domain. We estimate, based on our dataset construction logs, that discovery of entities requires a median of 4 different domains per task and full discovery + enrichment requires a median of 18 different domains per task.

Construction and validation

Two agents from different model families do the construction: Codex with GPT-6 Astra and Claude Code with Opus 5.5. To ensure the gold is not biased towards any one search index, every agent searches through a provider-neutral tool we built.

1. Topic seeding

Each task starts from a topic in Exa’s aggregate, anonymized search demand. Seeding from real demand spreads ATLAS across more than 300 topics and increases the likelihood that proposed tasks are unmemorized.

2. Entity discovery

The two construction agents search independently over several passes to construct a golden list of entities. A verifier agent then point-wise checks every row, including its cited pages, with additional searches on a separate index. Any unsettled rows go to targeted repair.

3. Row enrichment

After the discovery entity list is established, an agent proposes enrichment columns. The two construction agents fill every cell independently, saving each value with a page citation and a verbatim quote. Verification, repair and a final checker then settle any disagreements.

Grading

We grade returned tables against golden answers using three F1 metrics, computed per task and averaged over tasks. Each F1 is the harmonic mean of precision and recall.

  • Discovery F1 counts just row discovery.
  • Item F1 counts cells, including both discovery and enrichment.
  • Row F1 counts rows, where a row is correct only when every cell in the row is. This is our headline metric.

The grader aligns returned rows to the key by entity name and a set of aliases, falling back to an LLM aligner on misses. Grading is both cheap and consistent.

Driving future innovation

We believe that ATLAS provides a much more faithful signal than existing benchmarks of which agentic search configurations actually work on hard, economically valuable research. As reflected in initial runs on ATLAS, efficient agentic search remains far from solved.

Exa will continue to push the frontier of efficient search toward solving wide and deep research at low latency and cost. We view ATLAS as a first step toward a new generation of continuously refreshed search evals, and we hope it helps measure progress on the workflows for which people actually rely on agentic web search.

Citation

@online{exa2026atlas,  author = {Alexander Goldberg and Joshua Ahn and Scott Langille},  title = {{ATLAS: Evaluating Agents on Search-Intensive Tasks}},  date = {2026-10-08},  url = {https://exa.ai/blog/atlas-benchmark}}
Explore all 55 articles in today's digest

Fresh dev news, AI-digested daily. Never miss a trend at devoured.fyi