Large Language Models are Built-in Autoregressive Search Engines

Authors: Noah Ziems, Wenhao Yu, Zhihan Zhang, Meng Jiang

Accepted to ACL 2023 Findings
License: CC BY 4.0

Results of the summarizing process for the arXiv paper: 2305.09612v1

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
This paper investigates the use of large language models (LLMs) for document retrieval by generating URLs prompted by human instructions. The authors find that by providing a few (query, URL) pairs as in-context demonstrations, LLMs can generate Web URLs where nearly 90% of the corresponding documents contain correct answers to open-domain questions. This suggests that LLMs can act as built-in search engines without explicit training for mapping questions to document identifiers. Experimental results demonstrate that this method consistently outperforms existing retrieval approaches on three open-domain question answering benchmarks, both in zero-shot and few-shot settings. The authors also explore future directions for research. They discuss the potential for further tuning the few-shot demonstrations for specific retrieval tasks and improving retrieval performance by fine-tuning prompts for individual questions. They mention prior work on using clustering to select diverse demonstrations which has shown improvements in retrieval and downstream QA performance. However, there are limitations to their approach. The current method is limited in its ability to update knowledge state and adapt to new domains; adding new knowledge would likely require retraining the large language model. Additionally, large generation models may suffer from hallucination errors leading to incorrect predictions. The approach also involves slow web requests and document processing making it cumbersome to use in practice. To illustrate the advantages of their LLM-URL approach over existing methods a case study is presented comparing it with Contriever and BM25 retrievers in a closed-book setting; LLM-URL performs significantly better by retrieving documents containing the answer while Contriever and BM25 fail to do so. In conclusion, this paper demonstrates that LLMs can effectively generate URLs for document retrieval when provided with query-URL pairs as demonstrations; showing superior retrieval performance compared to existing approaches on various benchmarks. However, there are still challenges regarding knowledge updating, hallucination errors and practical usability that need further exploration.
AI-generated keywords: Large Language Models Document Retrieval Query-URL Pairs Contriever BM25

AI-generated Key Points

  • Large language models (LLMs) can generate Web URLs for document retrieval based on query-URL pairs as demonstrations.
  • LLMs can act as built-in search engines without explicit training for mapping questions to document identifiers.
  • LLMs achieve nearly 90% accuracy in generating URLs that lead to documents with correct answers to open-domain questions.
  • The method consistently outperforms existing retrieval approaches on three open-domain question answering benchmarks, in both zero-shot and few-shot settings.
  • Future research directions include fine-tuning prompts for individual questions and using clustering to select diverse demonstrations for improved retrieval performance.
  • Limitations include the need for retraining when updating knowledge, potential hallucination errors, and slow web requests and document processing.
  • A case study comparing LLM-URL approach with Contriever and BM25 retrievers shows superior performance in retrieving answer-containing documents.
  • LLMs offer effective URL generation for document retrieval but face challenges related to knowledge updating, hallucination errors, and practical usability.
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

Abstract: Document retrieval is a key stage of standard Web search engines. Existing dual-encoder dense retrievers obtain representations for questions and documents independently, allowing for only shallow interactions between them. To overcome this limitation, recent autoregressive search engines replace the dual-encoder architecture by directly generating identifiers for relevant documents in the candidate pool. However, the training cost of such autoregressive search engines rises sharply as the number of candidate documents increases. In this paper, we find that large language models (LLMs) can follow human instructions to directly generate URLs for document retrieval. Surprisingly, when providing a few {Query-URL} pairs as in-context demonstrations, LLMs can generate Web URLs where nearly 90\% of the corresponding documents contain correct answers to open-domain questions. In this way, LLMs can be thought of as built-in search engines, since they have not been explicitly trained to map questions to document identifiers. Experiments demonstrate that our method can consistently achieve better retrieval performance than existing retrieval approaches by a significant margin on three open-domain question answering benchmarks, under both zero and few-shot settings. The code for this work can be found at \url{https://github.com/Ziems/llm-url}.

Submitted to arXiv on 16 May. 2023

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.