ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inference
Not on the map. Why?
Abstract (arXiv)
State-of-the-art neural models typically encode document-query pairs using cross-attention for re-ranking. To this end, models generally utilize an encoder-only (like BERT) paradigm or an encoder-decoder (like T5) approach. These paradigms, however, are not without flaws, i.e., running the model on all query-document pairs at inference-time incurs a significant computational cost. This paper proposes a new training and inference paradigm for re-ranking. We propose to finetune a pretrained encoder-decoder model using in the form of document to query generation. Subsequently, we show that this encoder-decoder architecture can be decomposed into a decoder-only language model during inference. This results in significant inference time speedups since the decoder-only architecture only needs to learn to interpret static encoder embeddings during inference. Our experiments show that this new paradigm achieves results that are comparable to the more expensive cross-attention ranking approaches while being up to 6.8X faster. We believe this work paves the way for more efficient neural rankers that leverage large pretrained models.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 37 of its 60 references that are in the map. First posted on arXiv 25 Apr 2022.
Builds on
37 of 60 references.
References · 37
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2018Hierarchical Neural Story Generationcited by 1,182
- 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
- 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
25 more
- 2020Overview of the TREC 2019 deep learning trackcited by 282
- 2022Transformer Memory as a Differentiable Search Indexcited by 242
- 2019Document Expansion by Query Predictioncited by 225
- 2021Overview of the TREC 2020 deep learning trackcited by 193
- 2019MRQA 2019 Shared Task: Evaluating Generalization in Reading Comprehensioncited by 183
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
- 2018Mesh-TensorFlow: Deep Learning for Supercomputerscited by 168
- 2020Funnel-Transformer: Filtering out Sequential Redundancy for Efficient Language Processingcited by 161
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
- 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
- 2021The Efficiency Misnomercited by 98
- 2020Training Question Answering Models From Synthetic Datacited by 95
- 2020End-to-End Synthetic Data Generation for Domain Adaptation of Question Answering Systemscited by 65
- 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
- 2020Learning-to-Rank with BERT in TF-Rankingcited by 36
- 2018TF-Ranking: Scalable TensorFlow Library for Learning-to-Rankcited by 32
- 2020Interpretable & Time-Budget-Constrained Contextualization for Re-Rankingcited by 21
- 2020The Cascade Transformer: an Application for Efficient Answer Sentence Selectioncited by 20
- 2020Beyond [CLS] through Ranking by Generationcited by 20
- 2021Text-to-Text Multi-view Learning for Passage Re-rankingcited by 14
- 2021A Modern Perspective on Query Likelihood with Deep Generative Retrieval Modelscited by 12
- 2019Select and Attend: Towards Controllable Content Selection in Text Generationcited by 10
- 2020Simplified TinyBERT: Knowledge Distillation for Document Retrievalcited by 10
- 2021SDR: Efficient Neural Re-ranking using Succinct Document Representationcited by 7
- 2021Co-BERT: A Context-Aware BERT Retrieval Model Incorporating Local and Query-specific Contextcited by 6
Built on by
Citing papers per year: 2022: 2; 2023: 6; 2024: 0; 2025: 1.
9 papers.
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
- 2022RankT5: Fine-Tuning T5 for Text Ranking with Ranking Lossescited by 114
- 2023How Does Generative Retrieval Scale to Millions of Passages?cited by 47
- 2023LAIT: Efficient Multi-Segment Encoding in Transformers with Layer-Adjustable Interactioncited by 7
- 2023Plug-and-Play Document Modules for Pre-trained Modelscited by 6
- 2022Learning List-Level Domain-Invariant Representations for Rankingcited by 4
- 2023NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoderscited by 2
- 2023Empowering Language Model with Guided Knowledge Fusion for Biomedical Document Re-rankingcited by 0
- 2025Automatic Fact-checking in English and Telugucited by 0
- 2025Automatic Fact-checking in English and Telugu30 Sep 2025
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting30 Jun 2023
- 2023LAIT: Efficient Multi-Segment Encoding in Transformers with Layer-Adjustable Interaction31 May 2023
- 2023Plug-and-Play Document Modules for Pre-trained Models28 May 2023
- 2023NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoders23 May 2023
- 2023How Does Generative Retrieval Scale to Millions of Passages?19 May 2023
- 2023Empowering Language Model with Guided Knowledge Fusion for Biomedical Document Re-ranking7 May 2023
- 2022Learning List-Level Domain-Invariant Representations for Ranking21 Dec 2022
- 2022RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses12 Oct 2022