arXiv AI By Sahil Kale

Look It Up: Analysing Internal Web Search Capabilities of Modern LLMs

Read the original on arXiv AI →

The paper evaluates how modern large language models use internal web search to answer factual questions. Using 783 static queries and 288 dynamic queries, the authors find that enabling retrieval improves accuracy on static questions but hurts confidence calibration. On dynamic queries, models often retrieve but still achieve less than 70% accuracy, mainly due to poor query formulation and source selection, indicating that internal web search works better as a quick verification tool than a full information‑retrieval system.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
4d ago

Retrieved but Not Read: Understanding Why Search-Augmented LLMs Fail to Use Available Evidence

The paper investigates why large language models (LLMs) sometimes give outdated answers even when recent evidence is available through web search. By creating temporal facts that changed after the models’ training cutoffs, the authors evaluate a proprietary model with deployed search and six open-weight models with controlled retrieval. They find that models often rely on search snippets without opening source pages, leading to more outdated answers and unfaithful citations, and that even when retrieved evidence influences internal predictions, the final answer may still favor outdated information.

By Owen Walters, Lihu Chen, Francesca Toni
Hugging Face Trending Papers
Jun 27

AB-RAG: Adaptive Budgeted Retrieval-Augmented Generation for Reliable Question Answering

Retrieval-Augmented Generation (RAG) has become the standard way to ground large language models in external knowledge, yet most systems retrieve a fixed number of passages for every question regardless of its difficulty. This wastes computation on easy questions, starves hard ones, and gives no signal for when a generated answer can be trusted.

arXiv AI
Aug 24

Clarify-Then-Search: A Clarification Benchmark for Deep Search with End-to-End Nugget Restoration

Clarify-Then-Search is a benchmark that tests whether large language models can ask clarification questions to improve the usefulness of deep search results. It uses 518 real-world query pairs from Baidu, where each intent query is paired with an underspecified version. The evaluation involves a clarifier asking up to three questions, a user answerer providing only explicit information, and a rewriter generating a new query that is then searched; performance is measured by a weighted nugget-recall score.

By Deqiang Huang, Jingbo Zhou, Xinjiang Lu, Tong Xu, Hua Wu, Enhong Chen