Shallow Cross-Encoders for Low-Latency Retrieval
Not on the map. Why?
Abstract (arXiv)
Transformer-based Cross-Encoders achieve state-of-the-art effectiveness in text retrieval. However, Cross-Encoders based on large transformer models (such as BERT or T5) are computationally expensive and allow for scoring only a small number of documents within a reasonably small latency window. However, keeping search latencies low is important for user satisfaction and energy usage. In this paper, we show that weaker shallow transformer models (i.e., transformers with a limited number of layers) actually perform better than full-scale models when constrained to these practical low-latency settings since they can estimate the relevance of more documents in the same time budget. We further show that shallow transformers may benefit from the generalized Binary Cross-Entropy (gBCE) training scheme, which has recently demonstrated success for recommendation tasks. Our experiments with TREC Deep Learning passage ranking query sets demonstrate significant improvements in shallow and full-scale models in low-latency scenarios. For example, when the latency limit is 25ms per query, MonoBERT-Large (a cross-encoder based on a full-scale BERT model) is only able to achieve NDCG@10 of 0.431 on TREC DL 2019, while TinyBERT-gBCE (a cross-encoder based on TinyBERT trained with gBCE) reaches NDCG@10 of 0.652, a +51% gain over MonoBERT-Large. We also show that shallow Cross-Encoders are effective even when used without a GPU (e.g., with CPU inference, NDCG@10 decreases only by 3% compared to GPU inference with 50ms latency), which makes Cross-Encoders practical to run even without specialized hardware acceleration.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 29 Mar 2024.
Builds on
25 of 42 references.
References · 25
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 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
- 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
- 2019Passage Re-ranking with BERTcited by 629
- 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
- 2020Overview of the TREC 2019 deep learning trackcited by 282
13 more
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2021Overview of the TREC 2020 deep learning trackcited by 193
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
- 2022RankT5: Fine-Tuning T5 for Text Ranking with Ranking Lossescited by 114
- 2019CEDR: Contextualized Embeddings for Document Rankingcited by 77
- 2021Generalization in NLI: Ways (Not) To Go Beyond Simple Heuristicscited by 67
- 2023gSASRec: Reducing Overconfidence in Sequential Recommendation Trained with Negative Samplingcited by 29
- 2020Expansion via Prediction of Importance with Contextualizationcited by 26
- 2022Adaptive Re-Ranking with a Corpus Graphcited by 23
- 2020Interpretable & Time-Budget-Constrained Contextualization for Re-Rankingcited by 21
- 2021Streamlining Evaluation with ir-measurescited by 10
- 2023Lexically-Accelerated Dense Retrievalcited by 7
- 2023Efficient and Effective Tree-based and Neural Learning to Rankcited by 6
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025RAGSmith: A Framework for Finding the Optimal Composition of Retrieval-Augmented Generation Methods Across Datasetscited by 4
- 2025Can Cross Encoders Produce Useful Sentence Embeddings?cited by 2
- 2025TartuNLP at SemEval-2025 Task 5: Subject Tagging as Two-Stage Information Retrievalcited by 1
- 2026GeoRisk-RAG: A Hierarchy-Aware Risk Framework for Improving RAG Reliability through Selective Answeringcited by 0
- 2026GeoRisk-RAG: A Hierarchy-Aware Risk Framework for Improving RAG Reliability through Selective Answering23 Aug 2026
- 2025RAGSmith: A Framework for Finding the Optimal Composition of Retrieval-Augmented Generation Methods Across Datasets3 Nov 2025
- 2025TartuNLP at SemEval-2025 Task 5: Subject Tagging as Two-Stage Information Retrieval30 Apr 2025
- 2025Can Cross Encoders Produce Useful Sentence Embeddings?5 Feb 2025