mlsanityData to 7 Oct 2026

Blending Learning to Rank and Dense Representations for Efficient and Effective Cascades

arXiv 2510.16393 ↗First posted 18 Oct 2025cs.IR cs.LG cs.PFcited by 0

Not on the map. Why?

Abstract (arXiv)

We investigate the exploitation of both lexical and neural relevance signals for ad-hoc passage retrieval. Our exploration involves a large-scale training dataset in which dense neural representations of MS-MARCO queries and passages are complemented and integrated with 253 hand-crafted lexical features extracted from the same corpus. Blending of the relevance signals from the two different groups of features is learned by a classical Learning-to-Rank (LTR) model based on a forest of decision trees. To evaluate our solution, we employ a pipelined architecture where a dense neural retriever serves as the first stage and performs a nearest-neighbor search over the neural representations of the documents. Our LTR model acts instead as the second stage that re-ranks the set of candidates retrieved by the first stage to enhance effectiveness. The results of reproducible experiments conducted with state-of-the-art dense retrievers on publicly available resources show that the proposed solution significantly enhances the end-to-end ranking performance while relatively minimally impacting efficiency. Specifically, we achieve a boost in nDCG@10 of up to 11% with an increase in average query latency of only 4.3%. This confirms the advantage of seamlessly combining two distinct families of signals that mutually contribute to retrieval effectiveness.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 30 references that are in the map. First posted on arXiv 18 Oct 2025.

Builds on

18 of 30 references.

References · 18

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2017Billion-scale similarity search with GPUscited by 2,477
  3. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  4. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  5. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
  6. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  7. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  8. 2020Overview of the TREC 2019 deep learning trackcited by 282
  9. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  10. 2019Multi-Stage Document Ranking with BERTcited by 200
  11. 2021Overview of the TREC 2020 deep learning trackcited by 193
  12. 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
6 more
  1. 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
  2. 2021Pseudo-Relevance Feedback for Multiple Representation Dense Retrievalcited by 31
  3. 2024A Thorough Comparison of Cross-Encoders and LLMs for Reranking SPLADEcited by 18
  4. 2025Overview of the TREC 2021 deep learning trackcited by 18
  5. 2021Match Your Words! A Study of Lexical Matching in Neural Information Retrievalcited by 10
  6. 2023Efficient and Effective Tree-based and Neural Learning to Rankcited by 6

Built on by

Not cited yet.