Source-linked AI summary
Ultron: An Ultimate Retriever on Corpus with a Model-based Indexer
Yujia Zhou, Jing Yao, Zhicheng Dou, Ledell Wu, Peitian Zhang, Ji-Rong Wen
TL;DR
Pipelined retrieval separates indexing and retrieval, limiting joint end-to-end optimization. Ultron encodes document knowledge in a model, generating docids with semantic identifiers and three-stage training; on MS MARCO and NQ, it outperforms advanced sparse and dense baselines and existing end-to-end retrievers.
Problem
Pipelined retrieval separates indexing and retrieval, limiting their end-to-end joint optimization.
Source: Introduction · p. 1Method
Ultron is a sequence-to-sequence model-based indexer that generates docids using semantic identifiers and a three-stage training workflow.
Source: Introduction · p. 2Results
On MS MARCO and NQ, Ultron outperforms advanced sparse and dense retrieval baselines and significantly improves over existing end-to-end retrievers.
Source: Introduction · p. 2Takeaways & Limitations
The authors report that Ultron demonstrates the feasibility of a model-based indexer for document retrieval.
Source: Introduction · p. 2Extending Ultron to web scale requires a higher-capacity model-based indexer, and adding new documents remains unexplored.
Source: Limitation and Future Work · p. 7
Abstract
from arXiv · showhide
Document retrieval has been extensively studied within the index-retrieve framework for decades, which has withstood the test of time. Unfortunately, such a pipelined framework limits the optimization of the final retrieval quality, because indexing and retrieving are separated stages that can not be jointly optimized in an end-to-end manner. In order to unify these two stages, we explore a model-based indexer for document retrieval. Concretely, we propose Ultron, which encodes the knowledge of all documents into the model and aims to directly retrieve relevant documents end-to-end. For the model-based indexer, how to represent docids and how to train the model are two main issues to be explored. Existing solutions suffer from semantically deficient docids and limited supervised data. To tackle these two problems, first, we devise two types of docids that are richer in semantics and easier for model inference. In addition, we propose a three-stage training workflow to capture more knowledge contained in the corpus and associations between queries and docids. Experiments on two public datasets demonstrate the superiority of Ultron over advanced baselines for document retrieval.
Introduction
Traditional retrieval separates indexing from retrieval, limiting end-to-end optimization; model-based retrieval instead encodes document knowledge in a model. Ultron addresses docid semantics and limited training data with semantic identifiers and a three-stage workflow.
Introduction
- Pipelined retrieval separates indexing and retrieval, preventing their end-to-end joint optimization and requiring a large precomputed corpus index.The index also creates substantial memory overhead.Source: Introduction · p. 1
- Model-based retrieval must represent docids so models learn document semantics and decode them reliably, while training must teach docid knowledge and query-to-docid mappings.Earlier heuristic identifiers lacked sufficient document semantics, and limited supervised data could restrict docid learning and encourage overfitting.Source: Introduction · p. 1
- Ultron uses keyword-based identifiers from webpage URLs and titles, alongside semantic-based identifiers built from document product-quantization codes.The identifiers are token sequences intended to summarize document semantics.Source: Introduction · pp. 1–2
- A three-stage workflow combines document-focused general pre-training, pseudo-query search-oriented pre-training, and supervised relevance-data fine-tuning.The stages target corpus knowledge, short query-like text mapping, and associations between queries and relevant docids.Source: Introduction · p. 2
- Ultron directly generates docids for queries and outperforms sparse and dense baselines as well as existing end-to-end retrievers on MS MARCO and NQ.The model uses a generative encoder-decoder and constrained beam search to produce a docid ranking list.Source: Introduction · p. 2
- The paper frames Ultron as a sequence-to-sequence model that directly generates query docids, with richer identifiers and staged training intended to encode more docid knowledge.The authors describe this as demonstrating the feasibility of a model-based indexer for document retrieval.Source: Introduction · p. 2
Related Work
Related work spans sparse inverted-index retrieval, dense vectorized retrieval, and end-to-end generation approaches. Ultron replaces traditional indexes with a model-based indexer optimized end-to-end.
Sparse Retrieval with Inverted Indexes.
- Sparse inverted-index methods include BM25's tf-idf weighting, graph-based term weighting, and learned term weights from word embeddings; vocabulary mismatch remains a challenge.DeepCT and HDCT predict term importance from contextualized representations, while other approaches expand terms or use word-vector soft similarity.Source: Sparse Retrieval with Inverted Indexes · p. 2
Dense Retrieval with Vectorized Indexes.
- Dense retrieval embeds queries and documents as vectors, retrieves by vector similarity, and uses ANNS and PQ for efficiency.Multi-vector models and ColBERT add lightweight interaction layers to capture finer-grained matching.Source: Dense Retrieval with Vectorized Indexes · p. 2
End-to-End Retrieval.
- Ultron replaces traditional indexes with a model-based indexer that can be optimized end-to-end during training.Prior end-to-end work includes generating entity names, docids, passage n-grams, or sentence identifiers; the paper identifies deficient docid semantics and limited supervised data as challenges.Source: Dense Retrieval with Vectorized Indexes · p. 2, End-to-End Retrieval · p. 2
Methodology
Ultron treats document retrieval as a text-to-docid generation task, using semantic identifiers and three-stage training to build a model-based indexer. Its design covers both docid representation and learning query-to-docid associations.
Methodology
- Ultron is an end-to-end retriever designed to address docid representation and training challenges with elaborate identifiers and a three-stage strategy.The methodology frames retrieval as learning document semantics and mapping queries to relevant docids.Source: Methodology · p. 2
Backbone of the Model
- A T5 encoder-decoder maps input text to docids, while constrained beam search follows a prefix tree to return valid corpus docids ranked by autoregressive scores.The model generates docids from queries rather than retrieving through a traditional index.Source: Backbone of the Model · p. 3
Design of Document Identifiers
- Keyword-based identifiers use URLs, arranged in reverse order so the semantic-rich parts are predicted first, and incorporate document titles when URLs lack sufficient semantics.The approach aims to make identifiers both meaningful and unique to documents.Source: Design of Document Identifiers · pp. 3–4
- Semantic-based identifiers apply Product Quantization to document vectors, representing each vector as a set of cluster IDs.The method uses a pre-trained T5 encoder and adds cluster IDs as new vocabulary tokens.Source: Design of Document Identifiers · p. 4
Training Workflow
- General pre-training builds text-to-docid examples from document passages and tf-idf-selected terms to encode document semantics.Passages are segmented into fixed-size windows; selected terms are intended to reflect key document semantics.Source: Training Workflow · p. 4
- Search-oriented pre-training uses corpus-generated pseudo-queries to learn query-to-docid mappings, followed by supervised fine-tuning on query-relevant docid pairs.The three stages share a text-to-docid objective that maximizes target-sequence likelihood with teacher forcing.Source: Training Workflow · pp. 4–5
Experimental Settings
The experiments use MS MARCO Document Ranking and Natural Question 320K, compare sparse, dense, and end-to-end retrieval baselines, and report Recall and MRR@10.
Datasets
- The evaluation uses about 320k MS MARCO documents with 360k query-document pairs, and 231k Natural Question articles with 307k training pairs and 7.8k test queries.Natural Question documents are deduplicated by URL.Source: Datasets · p. 5
Baselines
- Baselines cover sparse retrieval, dense dual encoders, and end-to-end retrieval; performance is measured with Recall (R@1/5/10) and MRR@10.End-to-end comparisons include DSI and DynamicRetriver alongside Ultron variants.Source: Baselines · p. 5
Implementation Details
- Ultron uses URL docids up to 100 tokens, PQ settings m = 24 and k = 256, batch size 128, and beam size 10 at inference.Training uses 10 passages, one key-term sequence, 10 pseudo queries, and one annotated finetune query per document.Source: Implementation Details · p. 5
Experimental Results
Ultron leads the reported retrieval comparisons, and its training stages, memory use, inference latency, and docid similarity patterns are examined. The results also identify web-scale capacity and document updates as open challenges.
Overall Performance (RQ1)
- Ultron-Atomic achieves the best performance on MS MARCO and NQ; on MS MARCO, Ultron-PQ exceeds DPR by 8.5% on R@1 and 4.5% on MRR@10.In most scenarios, end-to-end retrieval models outperform static index-based methods, with paired t-test significance at p<0.05.Source: Table 1 · p. 6, Overall Performance (RQ1) · p. 6
- Ultron-URL and Ultron-PQ outperform DSI-Semantic; URL improves NQ R@10 by 38.9%, while atomic docids perform better than semantic docids on most metrics.Ultron-URL is inferior to Ultron-PQ on MS MARCO; atomic docids can bring growing parameter and memory burdens, which shareable semantic tokens may alleviate.Source: Overall Performance (RQ1) · p. 6
Study of Training Workflow (RQ2)
- Removing any training stage damages all evaluation metrics, and removing search-oriented pre-training causes the biggest overall drop.General pre-training also contributes; removing supervised fine-tuning substantially lowers retrieval performance.Source: Study of Training Workflow (RQ2) · pp. 6–7, Table 2 · p. 6
- Across training epochs, Ultron gradually gains retrieval knowledge, with general pre-training contributing more to Ultron-PQ.The authors suggest general pre-training helps Ultron-PQ understand its newly added vocabulary tokens.Source: Figure 4 · p. 7, Study of Training Workflow (RQ2) · p. 7
Study of Memory and Efficiency (RQ3)
- Ultron uses 90% less memory than DPR and reduces latency from 18.87ms to 8.90ms on a 320K corpus while achieving better results.Ultron stores a prefix tree and generates docids with constrained beam search; its speed depends on prefix-tree layer and width.Source: Table 3 · p. 7, Study of Memory and Efficiency (RQ3) · p. 7
Comparison of Different Docids (RQ4)
- Ultron-PQ assigns the same prefix more consistently to similar documents than DSI-Semantic, which the authors consider more conducive to model convergence.The comparison counts embedding-pair similarities among 100 documents sharing two-character prefixes.Source: Figure 5 · p. 7, Comparison of Different Docids (RQ4) · p. 7
Limitation and Future Work
- Ultron’s web-scale capacity requirements remain unresolved, and adding new documents to its model-based indexer is unexplored.The authors suggest better docids, a revised model-based index structure, or combining traditional and model-based indexes as future directions.Source: Limitation and Future Work · p. 7
Conclusion
Ultron encodes docid knowledge in an end-to-end model, using semantic document identifiers and three-stage training adapted to search. Experiments on two public datasets indicate better retrieval performance and efficiency than existing baselines.
- Experiments on two public datasets indicate Ultron's superiority over existing baselines in retrieval performance and efficiency.Source: Conclusion · p. 7
- Under a T5 backbone, Ultron uses two types of semantic document identifiers and a three-stage training strategy adapted to search scenarios.Source: Conclusion · p. 7