mlsanityData to 7 Oct 2026

Contrastive Fine-tuning Improves Robustness for Neural Rankers

arXiv 2105.12932 ↗First posted 27 May 2021cs.IR cs.CLcited by 12

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 39 of its 54 references that are in the map. First posted on arXiv 27 May 2021.

Builds on

39 of 54 references.

References · 39

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  5. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  6. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  7. 2020Supervised Contrastive Learningcited by 2,803
  8. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  9. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 979
  10. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  11. 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
  12. 2017In Defense of the Triplet Loss for Person Re-Identificationcited by 784
27 more
  1. 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
  2. 2019Using Self-Supervised Learning Can Improve Model Robustness and Uncertaintycited by 511
  3. 2019Learning the Difference that Makes a Difference with Counterfactually-Augmented Datacited by 428
  4. 2020Keystroke Dynamics as Part of Lifeloggingcited by 334
  5. 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
  6. 2020CLEAR: Contrastive Learning for Sentence Representationcited by 186
  7. 2019Learning Dense Representations for Entity Retrievalcited by 122
  8. 2017Deep Metric Learning with Angular Losscited by 107
  9. 2019Cycle-Consistency for Robust Visual Question Answeringcited by 105
  10. 2019Robust Neural Machine Translation with Doubly Adversarial Inputscited by 105
  11. 2019Multi-passage BERT: A Globally Normalized BERT Model for Open-domain Question Answeringcited by 96
  12. 2020Syntactic Data Augmentation Increases Robustness to Inference Heuristicscited by 85
  13. 2020Adv-BERT: BERT is not robust on misspellings! Generating nature adversarial samples on BERTcited by 69
  14. 2020PyTorch Metric Learningcited by 57
  15. 2018Robust Machine Comprehension Models via Adversarial Trainingcited by 44
  16. 2016Attentive Pooling Networkscited by 28
  17. 2015Applying Deep Learning to Answer Selection: A Study and An Open Taskcited by 24
  18. 2020Beyond [CLS] through Ranking by Generationcited by 20
  19. 2018WikiPassageQA: A Benchmark Collection for Research on Non-factoid Answer Passage Retrievalcited by 19
  20. 2020Benchmarking Robustness of Machine Reading Comprehension Modelscited by 18
  21. 2020On the Robustness of Language Encoders against Grammatical Errorscited by 18
  22. 2017Learning to Rank Question Answer Pairs with Holographic Dual LSTM Architecturecited by 14
  23. 2020Neural Passage Retrieval with Improved Negative Contrastcited by 11
  24. 2019Robust Reading Comprehension with Linguistic Constraints via Posterior Regularizationcited by 8
  25. 2019Passage Ranking with Weak Supervisioncited by 5
  26. 2019BERTSel: Answer Selection with Pre-trained Modelscited by 5
  27. 2020More Bang for Your Buck: Natural Perturbation for Robust Question Answeringcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 3; 2024: 3; 2025: 2; 2026: 1.

12 papers.