paper-with-me

Papers

InteractComp: Evaluating Search Agents With Ambiguous Queries

2025-10-28 · Mingyi Deng, Lijun Huang, Yani Fan, Jiayi Zhang, Fashen Ren, Jinyi Bai, Fuzhen Yang, Dayi Miao, Zhaoyang Yu, Yifan Wu, Yanfei Zhang, Fengwei Teng, Yingjia Wan, Song Hu, Yude Li, Xin Jin, Conghao Hu, Haoyu Li, Qirui Fu, Tai Zhong, Xinyu Wang, Xiangru Tang, Nan Tang, Chenglin Wu, Yuyu Luo arxiv

Language agents have demonstrated remarkable potential in web search and information retrieval. However, these search agents assume user queries are complete and unambiguous, an assumption that diverges from reality where users begin with incomplete queries requiring clarification through interaction. Yet most agents lack interactive mechanisms during the search process, and existing benchmarks cannot assess this capability. To address this gap, we introduce InteractComp, a benchmark designed to evaluate whether search agents can recognize query ambiguity and actively interact to resolve it during search. Following the principle of easy to verify, interact to disambiguate, we construct 210 expert-curated questions across 9 domains through a target-distractor methodology that creates genuine ambiguity resolvable only through interaction. Evaluation of 17 models reveals striking failure: the best model achieves only 13.73% accuracy despite 71.50% with complete context, exposing systematic overconfidence rather than reasoning deficits. Forced interaction produces dramatic gains, demonstrating latent capability current strategies fail to engage. Longitudinal analysis shows interaction capabilities stagnated over 15 months while search performance improved seven-fold, revealing a critical blind spot. This stagnation, coupled with the immediate feedback inherent to search tasks, makes InteractComp a valuable resource for both evaluating and training interaction capabilities in search agents. The code is available at https://github.com/FoundationAgents/InteractComp.

📄 PDF Abstract BibTeX arXiv:2510.24668

Code (0)

등록된 구현이 없습니다.

Tasks

Information Retrieval

Similar Papers 제목 키워드 기반

Persona2Web: Benchmarking Personalized Web Agents for Contextual Reasoning with User History

2026-02-19 · Serin Kim, Sangam Lee, Dongha Lee arxiv

Large language models have advanced web agents, yet current agents lack personalization capabilities. Since users rarely specify every detail of their intent, practical web agents must be able to interpret ambiguous quer…

Are We Asking the Right Questions? On Ambiguity in Natural Language Queries for Tabular Data Analysis

2025-11-06 · Daniel Gomm, Cornelius Wolff, Madelon Hulsebos arxiv

Natural language interfaces to tabular data must handle ambiguities inherent to queries. Instead of treating ambiguity as a deficiency, we reframe it as a feature of cooperative interaction where users are intentional ab…

Natural Language QueriesQuestion Answering

AmbiGraph-Eval: Can LLMs Effectively Handle Ambiguous Graph Queries?

2025-08-13 · Yuchen Tian, Kaixin Li, Hao Chen, Ziyang Luo 외 arxiv

Large Language Models (LLMs) have recently demonstrated strong capabilities in translating natural language into database queries, especially when dealing with complex graph-structured data. However, real-world queries o…

User Intent Inference for Web Search and Conversational Agents

2020-05-28 · Ali Ahmadvand

User intent understanding is a crucial step in designing both conversational agents and search engines. Detecting or inferring user intent is challenging, since the user utterances or queries can be short, ambiguous, and…

General Classificationintent-classificationIntent ClassificationNatural Language Understanding

Toward Conversational Agents with Context and Time Sensitive Long-term Memory

2024-05-29 · Nick Alonso, Tomás Figliolia, Anthony Ndirango, Beren Millidge

There has recently been growing interest in conversational agents with long-term memory which has led to the rapid development of language models that use retrieval-augmented generation (RAG). Until recently, most work o…

FormInformation RetrievalRAGRetrieval+2