DRBENCHER: Can Your Agent Identify the Entity, Retrieve Its Properties and Do the Math?

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Lee, Young-Suk, Astudillo, Ramon Fernandez, Florian, Radu
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911618182414336
author Lee, Young-Suk
Astudillo, Ramon Fernandez
Florian, Radu
author_facet Lee, Young-Suk
Astudillo, Ramon Fernandez
Florian, Radu
contents Deep research agents increasingly interleave web browsing with multi-step computation, yet existing benchmarks evaluate these capabilities in isolation, creating a blind spot in assessing real-world performance. We introduce DRBENCHER, a synthetic benchmark generator for questions that require both browsing and computation. It enforces four criteria: verifiability (gold answers are computed by executing parameterized code over knowledge-graph values), complexity (multi-hop entity identification, property retrieval, and domain-specific computation), difficulty (a two-stage verification cascade filters out questions solvable by the generating model), and diversity (a greedy max-min embedding filter maximizes coverage). These criteria are realized via a unified answer-first pipeline spanning five domains: biochemistry, financial, geophysical, security, and history. Human evaluation shows 76% validity (84% excluding stale data), with 35% of errors due to outdated knowledge-graph entries, highlighting an inherent limitation of systems that reason over evolving data. Automatic evaluation shows that the strongest frontier model achieves only 20% answer accuracy. Compared to manually constructed benchmarks (BrowseComp+, MATH-500, GPQA), DRBENCHER achieves the highest semantic diversity.
format Preprint
id arxiv_https___arxiv_org_abs_2604_09251
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle DRBENCHER: Can Your Agent Identify the Entity, Retrieve Its Properties and Do the Math?
Lee, Young-Suk
Astudillo, Ramon Fernandez
Florian, Radu
Artificial Intelligence
Deep research agents increasingly interleave web browsing with multi-step computation, yet existing benchmarks evaluate these capabilities in isolation, creating a blind spot in assessing real-world performance. We introduce DRBENCHER, a synthetic benchmark generator for questions that require both browsing and computation. It enforces four criteria: verifiability (gold answers are computed by executing parameterized code over knowledge-graph values), complexity (multi-hop entity identification, property retrieval, and domain-specific computation), difficulty (a two-stage verification cascade filters out questions solvable by the generating model), and diversity (a greedy max-min embedding filter maximizes coverage). These criteria are realized via a unified answer-first pipeline spanning five domains: biochemistry, financial, geophysical, security, and history. Human evaluation shows 76% validity (84% excluding stale data), with 35% of errors due to outdated knowledge-graph entries, highlighting an inherent limitation of systems that reason over evolving data. Automatic evaluation shows that the strongest frontier model achieves only 20% answer accuracy. Compared to manually constructed benchmarks (BrowseComp+, MATH-500, GPQA), DRBENCHER achieves the highest semantic diversity.
title DRBENCHER: Can Your Agent Identify the Entity, Retrieve Its Properties and Do the Math?
topic Artificial Intelligence
url https://arxiv.org/abs/2604.09251