메뉴
BL
The Decoder 24일 전

AI 검색 에이전트의 실패 원인: 검색이 아닌 '질문'

IMP
8/10
핵심 요약

텐센트와 칭화대 연구팀의 새로운 벤치마크에 따르면, AI 검색 에이전트가 실패하는 주된 원인은 검색 능력이 부족해서가 아니라 사용자의 모호한 질문에 대해 명확히 해달라고 묻지 않고 임의로 추측하기 때문입니다. 최신 LLM 모델들조차 이 벤치마크에서 50% 미만의 낮은 성공률을 기록했지만, 모델이 명확화 질문을 할 경우 성공률은 93% 이상으로 급증했습니다. 이는 향후 AI 시스템이 스스로 불확실성을 인식하고 사용자와 생산적인 대화를 나누는 능력을 갖춰야 함을 시사합니다.

번역된 본문

AI 검색 에이전트가 다단계 연구 작업에서 실패하는 일은 검색 과정 자체의 문제 때문이 거의 없습니다. 진짜 문제는 사용자의 검색어가 모호할 때 명확한 설명을 요구하지 못하는 데 있습니다. 이는 텐센트 혼위(Tencent Hunyuan)와 칭화대학교 연구팀이 새로운 벤치마크를 통해 밝힌 결과입니다. 재차 검색하는 것은 그저 추측해서 넘어가는 것보다 오히려 더 성능이 떨어지는 경우가 많습니다.

연구팀은 'DiscoBench'라는 테스트 프레임워크를 구축하여, 언어 모델이 심층 검색 과정 중에 스스로 모호성을 발견하고 사용자에게 정확한 후속 질문을 던져 연구 방향을 올바르게 교정할 수 있는지를 평가했습니다. 기존의 GAIA나 BrowseComp 같은 벤치마크들은 사용자의 검색어가 완벽하고 명확하다고 가정합니다. 하지만 실제 환경에서의 검색어는 종종 모호하거나, 불완전하거나, 완전히 틀린 경우가 많습니다. 긴 추론 과정을 거치는 동안 해결되지 않은 모호성은 누적되어 에이전트를 잘못된 경로로 이끕니다. 모델이 초기 단계에서 잘못된 대상을 선택하면, 이후에는 문법에 맞게 계속 검색을 수행하더라도 실제 목표를 완전히 놓치게 됩니다.

네 가지 유형의 모호성 DiscoBench에는 비디오 게임, 스포츠, 음악, 영화, 과학, 정치 등 11개의 지식 영역에 걸쳐 총 463개의 모호한 지점을 포함한 211개의 과제가 포함되어 있습니다. 각 작업은 여러 체크포인트로 나뉩니다. 각 체크포인트에서 에이전트는 계속 검색하기, 사용자에게 명확화 질문하기, 정답 제출하기 등 세 가지 작업 중 하나를 선택할 수 있습니다.

연구진은 네 가지 유형의 모호성을 정의했습니다. 설명이 여러 대상에 일치할 수 있거나, 다른 시간대나 버전에 적용되거나, 여러 가지 타당한 순위나 평가 기준을 허용하거나, 또는 명백한 사실 오류를 포함하는 경우입니다. 이 데이터셋은 중국어 웹에서의 일반적인 검색 패턴을 반영하기 위해 주로 중국어로 작성되었습니다. 에이전트가 유용한 후속 질문을 하면, LLM 기반 사용자 시뮬레이터가 검색 범위를 좁히는 데 도움이 되는 미리 정의된 단서를 제공합니다. 모든 검색 쿼리는 Tavily라는 에이전트 검색 엔진을 통해 실행되며, 시뮬레이터로는 Gemini 3 Flash가 사용됩니다.

대형 모델조차 50% 미만의 성능 연구팀은 지난 6개월간 공개된 Claude Opus 4.7, GPT 5.4, Gemini 3.1 Pro Preview, Doubao Seed 2.0 Pro, DeepSeek V4 Pro, Kimi K2.6, GLM 5.1, Qwen3.6 Max, MiniMax M2.7, MiMo v2.5 Pro, Hunyuan 3.0 Preview 등 11개의 모델을 테스트했습니다. 잠재적인 모호성에 대한 명시적인 힌트 없이 진행한 결과, Doubao Seed 2.0 Pro가 43.1%로 가장 높은 종단 간(End-to-End) 정확도를 기록했습니다. Gemini 3.1 Pro(40.8%)와 Claude Opus 4.7(39.8%)이 그 뒤를 이었습니다. MiniMax M2.7 및 Qwen3.6 Max와 같은 상대적으로 성능이 낮은 모델은 각각 16.1%, 12.3%의 성능에 그쳤습니다.

개별 단계 점수와 전체 결과 사이에는 차이가 존재합니다. 예를 들어 Claude Opus 4.7은 체크포인트의 57%를 정확하게 해결하지만, 최종 종단 간 결과는 39.8%에 불과합니다. 개별 연구 단계는 자체적으로는 잘 작동하지만, 단 하나의 해결되지 않은 모호성만으로도 전체 작업 체인이 무너지기에 충분합니다.

경고 프롬프트만으로는 부족해 논문의 저자들은 시스템 프롬프트를 통해 에이전트에게 모호성을 주의하고 의심스러울 때 후속 질문을 던지라고 명시적으로 지시할 때 어떤 일이 일어나는지도 테스트했습니다. 이 '가이드(Guided)' 모드는 모델이 스스로 질문이 불확실하다는 사실을 깨닫지 못해도 될 때 도달할 수 있는 최대 성능의 한계를 보여주기 위해 고안되었습니다.

원문 보기
원문 보기 (영어)
AI search agents don't fail at searching, they fail at asking the right questions when queries get ambiguous Jonathan Kemper View the LinkedIn Profile of Jonathan Kemper Jul 5, 2026 Nano Banana Pro prompted by THE DECODER Key Points DiscoBench, a new benchmark from Tencent Hunyuan and Tsinghua University, tests whether AI search agents proactively ask users for clarification when facing ambiguous queries instead of just guessing. Leading models like Gemini 3.1 Pro and Claude Opus 4.7 score below 50 percent on the benchmark because they tend to assume instead of asking when they hit ambiguities. When models do ask targeted follow-up questions, success rates jump to over 93 percent. Future AI systems need to learn to recognize uncertainty and turn it into productive dialogue with users. Ask about this article… Search AI search agents rarely fail at multi-step research tasks because of the search itself. Their real problem is failing to ask the user for clarification when queries are ambiguous. That's the finding of a new benchmark from a team at Tencent Hunyuan and Tsinghua University. Repeated searching often performs worse than just guessing. With DiscoBench, the researchers built a test framework that checks whether language models can spot ambiguity on their own during deep search chains, ask targeted follow-up questions, and correct their research path. Previous benchmarks like GAIA or BrowseComp assume user queries are complete and unambiguous. But real-world queries are often vague, incomplete, or flat-out wrong. In long reasoning chains, every unresolved ambiguity compounds and steers the agent down the wrong path. If the model picks the wrong entity at an early node, it keeps searching with clean syntax but misses the actual target entirely. Ad Four types of ambiguity DiscoBench contains 211 tasks with a total of 463 ambiguous points across eleven knowledge domains, including video games, sports, music, film, science, and politics. Each task is split into multiple checkpoints. At each checkpoint, the agent can choose between three actions: keep searching, ask the user for clarification, or give an answer. Ad DEC_D_Incontent-1 The researchers define four types of ambiguity. A description might match multiple entities, apply to different time periods or versions, allow for multiple valid ranking or evaluation criteria, or contain an outright factual error. The dataset is mostly written in Chinese to reflect typical search patterns on the Chinese-language web. When the agent asks a useful follow-up question, an LLM-based user simulator releases a predefined clue that helps narrow the search. All search queries run through the agent search engine Tavily, and Gemini 3 Flash serves as the simulator. Ad Even large models stay below 50 percent The team tested eleven models released in the past six months, including Claude Opus 4.7 , GPT 5.4 , Gemini 3.1 Pro Preview , Doubao Seed 2.0 Pro, DeepSeek V4 Pro , Kimi K2.6 , GLM 5.1 , Qwen3.6 Max, MiniMax M2.7 , MiMo v2.5 Pro , and Hunyuan 3.0 Preview. Without an explicit hint about possible ambiguity, Doubao Seed 2.0 Pro hit the highest end-to-end accuracy at 43.1 percent. Gemini 3.1 Pro followed at 40.8 percent, Claude Opus 4.7 at 39.8 percent. Weaker models like MiniMax M2.7 and Qwen3.6 Max managed only 16.1 and 12.3 percent, respectively. Ad DEC_D_Incontent-2 There's a gap between individual step scores and overall results. Claude Opus 4.7, for example, solves 57 percent of checkpoints correctly but only reaches 39.8 percent end-to-end. The individual research steps work fine on their own, but a single unresolved ambiguity is enough to collapse the entire chain. Ad A warning prompt isn't enough The authors also tested what happens when the system prompt explicitly tells the agent to watch for ambiguity and ask a follow-up question when in doubt. This "Guided" mode was meant to show the ceiling that's reachable when models don't have to figure out on their own that a question is underspecified. Averaged across ten models, end-to-end accuracy rose from 28.6 to 33.7 percent. Detection F1 jumped much more sharply, from 45.3 to 64.9 percent. The hint mostly helped models spot ambiguity without actually helping them finish the research successfully. For Claude Opus 4.7, end-to-end accuracy even dipped slightly under the guided prompt, despite a higher checkpoint pass rate. Searching more is worse than guessing The behavioral profile analysis breaks down what agents actually do at ambiguous checkpoints. Models that search first and then ask a follow-up ("SearchThenAsk") average a 93.4 percent success rate. Guessing without asking ("DirectGuess") drops to 56.5 percent. Models that search repeatedly but still guess instead of asking ("SearchHeavyGuess") do even worse at 51.9 percent. According to the authors, the repeated searches suggest the model already spotted the ambiguity but never turned it into a user interaction. That pattern also explains why more tool calls don't lead to better results. Claude Opus 4.7 searches more often than most other models but still trails Gemini 3.1 Pro and Doubao Seed 2.0 Pro in accuracy. Searching harder doesn't help if the agent never asks the right question. Spotting ambiguity and asking good questions are two different skills Detection ability and question quality don't track together. Qwen3.6 Max only reaches a Detection F1 of 16 percent and asks an average of 0.07 follow-up questions per task in the neutral setting. When it does ask, though, 94.7 percent of its questions are factually correct and 89.5 percent lead to progress. MiniMax M2.7 asks far more often but only achieves a follow-through rate of 60.7 to 66.5 percent. A useful research agent needs both skills: recognizing when to ask a follow-up question and framing it so the answer actually moves the search forward. Broken down by ambiguity type, factual errors are easiest to detect because they create direct contradictions during research. Entity and criteria ambiguities are harder because multiple plausible candidates or unclear evaluation standards can coexist without any obvious contradiction. AI agents need better follow-up strategies Without access to search tools, the tested models collapse. Doubao Seed 2.0 Pro drops from 43.1 to 2.4 percent, Gemini 3.1 Pro from 40.8 to 19.9 percent. DiscoBench can't be solved from stored model knowledge alone. At the same time, models perform much better when ambiguity is removed from the questions, with accuracy jumping by 26.8 to 40.2 points depending on the model. The authors conclude that future search agents need mechanisms that turn search uncertainty into user interaction, on top of their retrieval and reasoning abilities. Other recent work confirms that current search agents have basic weaknesses in how they research. One study found that leading models on benchmarks like BrowseComp often just confirm what they already know. On the purpose-built LiveBrowseComp with facts beyond the knowledge cutoff, all systems dropped by 25 to 40 points. The Halluhard benchmark also showed that Claude Opus 4.5 with web search hallucinates in about 30 percent of cases, mainly when verifying the content of cited sources. Anthropic tackled this problem in its latest model update, Claude Opus 4.8 . The model is supposed to flag uncertainties more often and leaves bugs in its own code uncommented about four times less frequently than its predecessor. Perplexity is trying a different approach with Search as Code , letting models write their search workflows as Python programs instead of calling a prebuilt API. AI News Without the Hype – Curated by Humans Subscribe to THE DECODER for ad-free reading, a weekly AI newsletter, our exclusive "AI Radar" frontier report six times a year, full archive access, and access to our comment section. Subscribe now Source: Arxiv