paper-with-me

홈 › Papers

Contrastive Fine-tuning Improves Robustness for Neural Rankers

2021-05-27 · Findings (ACL) 2021 8 · Xiaofei Ma, Cicero Nogueira dos santos, Andrew O. Arnold

The performance of state-of-the-art neural rankers can deteriorate substantially when exposed to noisy inputs or applied to a new domain. In this paper, we present a novel method for fine-tuning neural rankers that can significantly improve their robustness to out-of-domain data and query perturbations. Specifically, a contrastive loss that compares data points in the representation space is combined with the standard ranking loss during fine-tuning. We use relevance labels to denote similar/dissimilar pairs, which allows the model to learn the underlying matching semantics across different query-document pairs and leads to improved robustness. In experiments with four passage ranking datasets, the proposed contrastive fine-tuning method obtains improvements on robustness to query reformulations, noise perturbations, and zero-shot transfer for both BERT and BART based rankers. Additionally, our experiments show that contrastive fine-tuning outperforms data augmentation for robustifying neural rankers.

📄 PDF Abstract BibTeX arXiv:2105.12932

Code (0)

등록된 구현이 없습니다.

Tasks

Data AugmentationPassage Ranking

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
WordPiece 설명 없음
Weight Decay 설명 없음
Adam 설명 없음
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…

Similar Papers 제목 키워드 기반

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

2025-03-28 · Francesca Pezzuti, Sean MacAvaney, Nicola Tonellotto

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 contrast…

Contrastive LearningLanguage ModelingLanguage ModellingLarge Language Model+2

Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipeline

2021-01-21 · Luyu Gao, Zhuyun Dai, Jamie Callan

Pre-trained deep language models~(LM) have advanced the state-of-the-art of text retrieval. Rerankers fine-tuned from deep LM estimates candidate relevance based on rich contextualized matching signals. Meanwhile, deep L…

RetrievalText Retrieval

Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning

2025-03-08 · Shengyao Zhuang, Xueguang Ma, Bevan Koopman, Jimmy Lin 외

In this paper, we introduce Rank-R1, a novel LLM-based reranker that performs reasoning over both the user query and candidate documents before performing the ranking task. Existing document reranking methods based on la…

Reranking

An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking

2024-11-08 · Zijian Chen, Ronak Pradeep, Jimmy Lin

Recent advances have demonstrated that large language models (LLMs) excel as listwise rerankers, but their high computational demands remain a barrier to widespread adoption. Further, the traditional language modeling (L…

Language ModelingLanguage ModellingLearning-To-RankReranking

Annotating Data for Fine-Tuning a Neural Ranker? Current Active Learning Strategies are not Better than Random Selection

2023-09-12 · Sophia Althammer, Guido Zuccon, Sebastian Hofstätter, Suzan Verberne 외

Search methods based on Pretrained Language Models (PLM) have demonstrated great effectiveness gains compared to statistical and early neural ranking models. However, fine-tuning PLM-based rankers requires a great amount…

Active LearningDomain Adaptation