mlsanityData to 7 Oct 2026

Exploring the Effectiveness of Multi-stage Fine-tuning for Cross-encoder Re-rankers

arXiv 2503.22672 ↗First posted 28 Mar 2025cs.IR cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

State-of-the-art cross-encoders can be fine-tuned to be highly effective in passage re-ranking. The typical fine-tuning process of cross-encoders as re-rankers requires large amounts of manually labelled data, a contrastive learning objective, and a set of heuristically sampled negatives. An alternative recent approach for fine-tuning instead involves teaching the model to mimic the rankings of a highly effective large language model using a distillation objective. These fine-tuning strategies can be applied either individually, or in sequence. In this work, we systematically investigate the effectiveness of point-wise cross-encoders when fine-tuned independently in a single stage, or sequentially in two stages. Our experiments show that the effectiveness of point-wise cross-encoders fine-tuned using contrastive learning is indeed on par with that of models fine-tuned with multi-stage approaches. Code is available for reproduction at https://github.com/fpezzuti/multistage-finetuning.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 28 Mar 2025.

Builds on

22 of 33 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  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. 2019Passage Re-ranking with BERTcited by 629
  9. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
  10. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  11. 2023Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agentscited by 356
  12. 2020Overview of the TREC 2019 deep learning trackcited by 282
10 more
  1. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  2. 2019Multi-Stage Document Ranking with BERTcited by 200
  3. 2021Overview of the TREC 2020 deep learning trackcited by 193
  4. 2022Autoregressive Search Engines: Generating Substrings as Document Identifierscited by 112
  5. 2021Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipelinecited by 65
  6. 2021Simplified Data Wrangling with ir_datasetscited by 27
  7. 2021How Deep is your Learning: the DL-HARD Annotated Deep Learning Datasetcited by 18
  8. 2021Streamlining Evaluation with ir-measurescited by 10
  9. 2023RRAML: Reinforced Retrieval Augmented Machine Learningcited by 6
  10. 2024Set-Encoder: Permutation-Invariant Inter-Passage Attention for Listwise Passage Re-Ranking with Cross-Encoderscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.