Confident Fools or Careful Searchers? A Behavioural Study of When LLMs Search Beyond Their Static Internal Memory
Authors: Nipun D. Pathirage, Kwan Srijomkwan
Organizations: Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, USA · Department of Cognitive Science, Rensselaer Polytechnic Institute, Troy, NY, USA
Agentic LLM assistants must repeatedly decide whether to answer from memory or to call a tool such as web search. Unnecessary searches cost latency and money; missing ones yield confident but unsupported answers. Prior work mostly measures verbalised confidence or trains new adaptive-retrieval methods, and rarely audits the search decisions that deployed products actually make. We introduce a benchmark of 400 multiple-choice questions that combines widely known inside-knowledge (IK) questions, which should be answered directly, with outside-knowledge (OK) questions about facts from news published after the models' training cut-offs (to our knowledge), which should trigger search or, without tools, abstention. Each item offers an abstain option, and two action-level scores, NAS and KIS, reward searching on OK questions and restraint on IK questions. Across five commercial LLMs with and without their vendors' web search, GPT-5 mini and Grok 4 Fast search on over 90% of OK but only 1% of IK questions, whereas Mistral Small searches on just 20% of OK questions, often abstaining instead of using its tool; one product's search indicator proved unusable. Searching is partly triggered by explicit temporal cues: on uncued OK questions, the NAS of the two selective models falls from about 0.72 to 0.57--0.58. The scores thus measure the search triggering of specific products, not metacognition in a strict sense.
Figures & tables
Figure 1: Dataset generation and validation pipeline.
Items
400 (200 ik , 200 ok ; 50 per domain and type)
Source articles
17–18 Nov 2025; 104–156 per domain after deduplication
170 ( ik ), 165 ( ok ); 103 shared; 5 duplicated question texts
Explicit temporal cue in stem ∗
ok 117/200 (58%); ik 1/200
Table 1: Dataset summary. Score distributions are shown in Appendix Figure 3 . ∗ Post-hoc regular-expression match for a year 2024–2029, “November”, “recent”, “latest”, “current”, “this week” or “today”.
Condition
Label
Response pattern
with search
aware
searched ∧ correct
with search
unaware
not searched ∧ (incorrect/abstained ∨ correct with misaligned reasoning)
with search
neutral
searched ∧ incorrect/abstained; not searched ∧ correct ∧ aligned
without search
aware
abstained ∨ (correct ∧ aligned)
without search
unaware
answered ∧ incorrect
without search
neutral
answered ∧ correct ∧ misaligned
Table 2: Per-item labels for NAS on ok questions.
Model (API id)
Search tool
Search indicator
Indicator
GPT-5 mini ( gpt-5-mini-2025-08-07 )
OpenAI web search
web-search call in output
plausible
Grok 4 Fast ( grok-4-fast-reasoning )
xAI Live Search, auto
citations returned
plausible
Claude 3.5 Haiku ( claude-3-5-haiku-latest )
Anthropic web search (max 2 uses)
more than one content block in output
unverified
Mistral Small ( mistral-small-2506 )
Mistral Agents web search
extra output entries
plausible
Gemini 2.5 Flash ( gemini-2.5-flash )
Grounding with Google Search
any response candidate
defective
Table 3: Evaluated models, their search tools, and how a search is detected. “Plausible” means judged plausible by code inspection only; no indicator was validated against raw API responses, which were not stored. The Gemini indicator is defective (see Section 6 ).
ik , no search
ok , with search
ok , no search
Model
acc.
acc.
abstain
acc.
acc. if answered
GPT-5 mini
0.990
0.83
0.14
0.37
0.72 ( n =101)
Grok 4 Fast
0.995
0.83
0.16
0.24
0.78 ( n =60)
Gemini 2.5 Flash †
0.995
0.59
0.33
0.32
0.77 ( n =82)
Mistral Small
0.990
0.42
0.47
0.39
0.69 ( n =113)
Claude 3.5 Haiku
0.985
0.26
0.70
0.19
0.79 ( n =47)
Table 4: Accuracy (abstentions count as incorrect). n is the number of answered ok items without search. 95% bootstrap intervals are about ± 0.01–0.07 for the first column and ± 0.05–0.07 for the others (with 191–200 items per cell). † Search indicator unreliable.
ik
ok : searched (%)
ok : not searched (%)
Model
search %
correct
abst.
wrong
correct
abst.
wrong
n
GPT-5 mini
1.0
77.0
12.0
2.5
5.5
2.0
1.0
200
Grok 4 Fast
1.0
77.5
12.0
0.5
5.5
3.5
1.0
200
Mistral Small
0.0
19.9
0.0
0.5
22.0
47.1
10.5
191
Claude 3.5 Haiku
11.0
19.1
40.7
4.1
6.7
29.4
0.0
194
Gemini 2.5 Flash †
100 †
59.0
33.0
8.0
–
–
–
200
Table 5: Outcomes on ok questions with search (percentage of valid items), and the share of ik questions on which the model searched. † Gemini’s search indicator is constant (see the Gemini paragraph below).
Model
search rate, uncued ok stems
search rate, cued ok stems
GPT-5 mini
0.82 ( n =83)
0.98 ( n =117)
Grok 4 Fast
0.77 ( n =83)
0.99 ( n =117)
Mistral Small
0.02 ( n =83)
0.34 ( n =108)
Claude 3.5 Haiku ‡
0.66 ( n =80)
0.62 ( n =114)
Table 6: Search rate on ok questions with search, by presence of an explicit temporal cue in the stem. Gemini is omitted (constant indicator). ‡ Indicator unverified.
Full definition
No reasoning judge
Model
NAS [95% CI]
KIS [95% CI]
NAS
KIS
With search (primary)
GPT-5 mini
0.72 [0.65, 0.80]
0.79 [0.73, 0.85]
0.74
0.98
Grok 4 Fast
0.73 [0.66, 0.80]
0.76 [0.69, 0.82]
0.73
0.97
Mistral Small
− 0.51 [ − 0.62, − 0.39]
0.80 [0.74, 0.85]
− 0.38
0.99
Claude 3.5 Haiku
− 0.15 [ − 0.25, − 0.05]
0.42 [0.33, 0.52]
− 0.10
0.76
Table 7: NAS ( ok items) and KIS ( ik items). The last two columns drop the reasoning-alignment criterion (every correct answer is treated as aligned). Intervals bootstrap questions only. † Search indicator unreliable; not interpretable.
Figure 2: NAS vs. KIS in the with-search condition. Bars are 95% bootstrap intervals over questions (horizontal and vertical half-widths). Gemini’s hollow marker is not interpretable because its search flag is constant. Quadrant names are informal.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Figure 3: Distributions of validation scores for the final dataset.
Conversational LLM agents increasingly rely on Web search, yet the end-to-end lifecycle of agentic search remains poorly understood. We present the first study of Web search across four major conversational platforms (ChatGPT, Claude, Grok, and DeepSeek), combining real-world user interactions (invivo) with controlled experiments using the same platform's models by their APIs (invitro). We investigate the quality of agentic decisions to invoke Web search, their strategies to formulate queries, the potential domain preferences in the search results they receive, and the choices they make when transforming search results into grounded responses. We find that Web-search decisions vary substantially across platforms and models, while more frequent Web-search invocation does not necessarily yield better response quality. We further show that conversational agents employ different complex querying strategies and that platform specific search engines return search results from their preferred domains. Finally, although responses are largely grounded in search results, some claims rely on uncited search results, raising concerns about attribution and reliability. Our findings have important implications for the design of future AI agents and Web search tools optimized for conversational retrieval.
Mahsa Amani, Seungeon Lee, Abhisek Dash +9
Max Planck Institute for Software Systems · Saarland University · Laboratoire d’Informatique de l’École Polytechnique +3
Are LLM-based search agents genuinely searching, or using the web to verify what they already know? We study this question on BrowseComp with three diagnostics. Our analysis reveals Intrinsic Knowledge Dependence (IKD): even with tool access, agents often rely on intrinsic knowledge -- information encoded in the model before retrieval -- rather than on external evidence. Agents answer up to 44.5% of BrowseComp questions without tools, generate more than half of their search queries from internally produced hypotheses rather than retrieved leads, and perform worse than closed-book baselines when answer-supporting evidence is removed. These results suggest that static search benchmarks can reward memory-backed verification rather than evidence-driven discovery, conflating what agents already know with what they can find. We then introduce LiveBrowseComp, a deep-search benchmark designed to evaluate agents beyond intrinsic coverage. It contains 335 human-authored questions whose answers depend on facts published within the 90 days preceding benchmark construction, drawn from six updated sources and filtered to exclude globally salient events. On LiveBrowseComp, all evaluated agents fall below 2% closed-book accuracy, search-augmented scores drop by 25-40 points relative to BrowseComp, and prior model rankings no longer reliably predict performance. LiveBrowseComp is available at https://huggingface.co/datasets/Forival/LiveBrowseComp.
Search-augmented language models can use external evidence to compensate for limitations in parametric knowledge, but search is not uniformly beneficial: models may call search for questions they can already answer, or rely on noisy evidence when correction, clarification, or abstention would be more appropriate. We formulate this as an instance-level search-routing problem: deciding whether search is needed to improve task success relative to a no-search execution. To derive supervision, we compare no-search and forced-search outcomes for the same question and construct an oracle over NO SEARCH, SEARCH, and UNSOLVED based on task-specific success. Using this oracle as both an evaluation criterion and a learning signal, we train search-routing policies with supervised fine-tuning and preference optimization, improving routing macro-F1 on oracle-eligible examples from 0.7082 to 0.8235 for Gemma E2B and from 0.7053 to 0.8365 for Qwen3.5-4B. Further analysis shows that the learned policies reduce model-specific routing failures: Gemma primarily learns no-search restraint, while Qwen further reduces missed search; residual UNSOLVED cases reveal heterogeneous bottlenecks involving model capacity, retrieval budget, evidence use, and policy behavior.