atlas

Research map / Multi-agent systems and games / LLM agents

InteractComp: Evaluating Search Agents With Ambiguous Queries

ICML 2026 · Multi-agent systems and games › LLM agents · approach: Agentic benchmarks and orchestration

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Introduces InteractComp, a 210-question benchmark where search agents must interact (yes/no clarification to a simulated user) to resolve target-distractor ambiguity, finding models overconfident and rarely interacting.

Problem

Search-agent benchmarks assume complete, unambiguous queries, so agents' ability to recognize ambiguity and interact to resolve it during search is untested.

Approach

Target-distractor construction creates questions whose shared attributes admit a popular distractor, with distinctive attributes hidden in context that a simulated responder reveals only through yes/no/IDK interaction; evaluates search+interact ReAct agents and shows interaction is latent (forced interaction roughly doubles accuracy).

Key results

Surprising findings

Limitations

Experimental setup

Benchmarks: InteractComp

Metrics: accuracy calibration error (ECE) interaction rate average rounds cost

Baselines: BrowseComp GAIA IN3 Tau-Bench Doubao Deep Search OpenAI Deep Research

Builds on: ReAct BrowseComp

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy