mlsanityData to 7 Oct 2026

Generative Retrieval with Few-shot Indexing

arXiv 2408.02152 ↗First posted 4 Aug 2024cs.IR cs.AI cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Existing generative retrieval (GR) methods rely on training-based indexing, which fine-tunes a model to memorise associations between queries and the document identifiers (docids) of relevant documents. Training-based indexing suffers from high training costs, under-utilisation of pre-trained knowledge in large language models (LLMs), and limited adaptability to dynamic document corpora. To address the issues, we propose a few-shot indexing-based GR framework (Few-Shot GR). It has a few-shot indexing process without any training, where we prompt an LLM to generate docids for all documents in a corpus, ultimately creating a docid bank for the entire corpus. During retrieval, we feed a query to the same LLM and constrain it to generate a docid within the docid bank created during indexing, and then map the generated docid back to its corresponding document. Moreover, we devise few-shot indexing with one-to-many mapping to further enhance Few-Shot GR. Experiments show that Few-Shot GR achieves superior performance to state-of-the-art GR methods requiring heavy training.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 4 Aug 2024.

Builds on

29 of 42 references.

References · 29

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  3. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  4. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  6. 2023Zephyr: Direct Distillation of LM Alignmentcited by 498
  7. 2021Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Modelscited by 462
  8. 2021Large Dual Encoders Are Generalizable Retrieverscited by 454
  9. 2020Autoregressive Entity Retrievalcited by 333
  10. 2022Transformer Memory as a Differentiable Search Indexcited by 242
  11. 2022Autoregressive Search Engines: Generating Substrings as Document Identifierscited by 112
  12. 2022A Neural Corpus Indexer for Document Retrievalcited by 107
17 more
  1. 2024From Matching to Generation: A Survey on Generative Information Retrievalcited by 89
  2. 2023Learning to Tokenize for Generative Retrievalcited by 66
  3. 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 47
  4. 2023How Does Generative Retrieval Scale to Millions of Passages?cited by 47
  5. 2023Scalable and Effective Generative Information Retrievalcited by 38
  6. 2022DSI++: Updating Transformer Memory with New Documentscited by 35
  7. 2023Continual Learning for Generative Retrieval over Dynamic Corporacited by 25
  8. 2023TOME: A Two-stage Approach for Model-based Retrievalcited by 21
  9. 2024Planning Ahead in Generative Retrieval: Guiding Autoregressive Generation through Simultaneous Decodingcited by 19
  10. 2024CorpusLM: Towards a Unified Language Model on Corpus for Knowledge-Intensive Taskscited by 18
  11. 2024Query Performance Prediction using Relevance Judgments Generated by Large Language Modelscited by 18
  12. 2023GLEN: Generative Retrieval via Lexical Index Learningcited by 17
  13. 2023Query Performance Prediction: From Ad-hoc to Conversational Searchcited by 16
  14. 2024A Survey of Generative Search and Recommendation in the Era of Large Language Modelscited by 14
  15. 2023IncDSI: Incrementally Updatable Document Retrievalcited by 12
  16. 2024CorpusBrain++: A Continual Generative Pre-Training Framework for Knowledge-Intensive Language Taskscited by 9
  17. 2024A Survey of Generative Information Retrievalcited by 4

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.