pith. sign in

arxiv: 2305.11841 · v1 · pith:6LBZ5FDZnew · submitted 2023-05-19 · 💻 cs.IR · cs.CL

How Does Generative Retrieval Scale to Millions of Passages?

classification 💻 cs.IR cs.CL
keywords retrievalgenerativepassagesscalingcorpusdocumentmillionsbeen
0
0 comments X
read the original abstract

Popularized by the Differentiable Search Index, the emerging paradigm of generative retrieval re-frames the classic information retrieval problem into a sequence-to-sequence modeling task, forgoing external indices and encoding an entire document corpus within a single Transformer. Although many different approaches have been proposed to improve the effectiveness of generative retrieval, they have only been evaluated on document corpora on the order of 100k in size. We conduct the first empirical study of generative retrieval techniques across various corpus scales, ultimately scaling up to the entire MS MARCO passage ranking task with a corpus of 8.8M passages and evaluating model sizes up to 11B parameters. We uncover several findings about scaling generative retrieval to millions of passages; notably, the central importance of using synthetic queries as document representations during indexing, the ineffectiveness of existing proposed architecture modifications when accounting for compute cost, and the limits of naively scaling model parameters with respect to retrieval performance. While we find that generative retrieval is competitive with state-of-the-art dual encoders on small corpora, scaling to millions of passages remains an important and unsolved challenge. We believe these findings will be valuable for the community to clarify the current state of generative retrieval, highlight the unique challenges, and inspire new research directions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!

    cs.IR 2023-12 conditional novelty 6.0

    RankZephyr is a new open-source LLM that closes the effectiveness gap with GPT-4 for zero-shot listwise reranking while showing robustness to input ordering and document count.

  2. Understanding and Debugging Failures in N-Gram-Based Generative Retrieval

    cs.IR 2026-06 unverdicted novelty 5.0

    Presents a taxonomy of generative retrieval failures, empirically identifies issues such as ambiguous docids and low diversity in n-gram methods, and introduces a web-based debugging tool.

  3. Mitigating Collaborative Semantic ID Staleness in Generative Retrieval

    cs.IR 2026-04 unverdicted novelty 5.0

    A model-agnostic SID alignment update mitigates staleness from temporal drift in user-item interactions for generative retrievers, improving Recall@K and nDCG@K while reducing compute by 8-9x versus full retraining.