NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoders
Not on the map. Why?
Abstract (arXiv)
Neural document rerankers are extremely effective in terms of accuracy. However, the best models require dedicated hardware for serving, which is costly and often not feasible. To avoid this serving-time requirement, we present a method of capturing up to 86% of the gains of a Transformer cross-attention model with a lexicalized scoring function that only requires 10-6% of the Transformer's FLOPs per document and can be served using commodity CPUs. When combined with a BM25 retriever, this approach matches the quality of a state-of-the art dual encoder retriever, that still requires an accelerator for query encoding. We introduce NAIL (Non-Autoregressive Indexing with Language models) as a model architecture that is compatible with recent encoder-decoder and decoder-only large language models, such as T5, GPT-3 and PaLM. This model architecture can leverage existing pre-trained checkpoints and can be fine-tuned for efficiently constructing document representations that do not require neural processing of queries.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 47 references that are in the map. First posted on arXiv 23 May 2023.
Builds on
35 of 47 references.
References · 35
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
- 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
23 more
- 2017Non-Autoregressive Neural Machine Translationcited by 457
- 2021Large Dual Encoders Are Generalizable Retrieverscited by 454
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
- 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 233
- 2019Document Expansion by Query Predictioncited by 225
- 2017Parallel WaveNet: Fast High-Fidelity Speech Synthesiscited by 214
- 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
- 2021PAQ: 65 Million Probably-Asked Questions and What You Can Do With Themcited by 198
- 2018Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinementcited by 194
- 2022Scaling Up Models and Data with textttt5x and textttseqiocited by 187
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
- 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
- 2022From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effectivecited by 98
- 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
- 2021Learning Passage Impacts for Inverted Indexescited by 68
- 2020SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrievalcited by 50
- 2023Information Retrieval: Recent Advances and Beyondcited by 49
- 2022An Efficiency Study for SPLADE Modelscited by 26
- 2020Beyond [CLS] through Ranking by Generationcited by 20
- 2021Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansioncited by 20
- 2022ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inferencecited by 9
Built on by
Citing papers per year: 2026: 2.
2 papers.