mlsanityData to 7 Oct 2026

P^3 Ranker: Mitigating the Gaps between Pre-training and Ranking Fine-tuning with Prompt-based Learning and Pre-finetuning

arXiv 2205.01886 ↗First posted 4 May 2022cs.IR cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Compared to other language tasks, applying pre-trained language models (PLMs) for search ranking often requires more nuances and training signals. In this paper, we identify and study the two mismatches between pre-training and ranking fine-tuning: the training schema gap regarding the differences in training objectives and model architectures, and the task knowledge gap considering the discrepancy between the knowledge needed in ranking and that learned during pre-training. To mitigate these gaps, we propose Pre-trained, Prompt-learned and Pre-finetuned Neural Ranker (P^3 Ranker). P^3 Ranker leverages prompt-based learning to convert the ranking task into a pre-training like schema and uses pre-finetuning to initialize the model on intermediate supervised tasks. Experiments on MS MARCO and Robust04 show the superior performances of P^3 Ranker in few-shot ranking. Analyses reveal that P^3 Ranker is able to better accustom to the ranking task through prompt-based learning and retrieve necessary ranking-oriented knowledge gleaned in pre-finetuning, resulting in data-efficient PLM adaptation. Our code is available at https://github.com/NEUIR/P3Ranker.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 28 of its 35 references that are in the map. First posted on arXiv 4 May 2022.

Builds on

28 of 35 references.

References · 28

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  4. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  5. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  6. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  7. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  8. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  9. 2017Reading Wikipedia to Answer Open-Domain Questionscited by 777
  10. 2021GPT Understands, Toocited by 715
  11. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
  12. 2019Passage Re-ranking with BERTcited by 629
16 more
  1. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  2. 2020AutoPrompt: Eliciting Knowledge from Language Models with Automatically Generated Promptscited by 246
  3. 2019Multi-Stage Document Ranking with BERTcited by 200
  4. 2021Muppet: Massive Multi-task Representations with Pre-Finetuningcited by 192
  5. 2020Intermediate-Task Transfer Learning with Pretrained Models for Natural Language Understanding: When and Why Does It Work?cited by 127
  6. 2020Exploring and Predicting Transferability across NLP Taskscited by 126
  7. 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 111
  8. 2019Fine-grained Fact Verification with Kernel Graph Attention Networkcited by 105
  9. 2020Open-Retrieval Conversational Question Answeringcited by 99
  10. 2017End-to-End Neural Ad-hoc Ranking with Kernel Poolingcited by 85
  11. 2019MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehensioncited by 60
  12. 2019Understanding the Behaviors of BERT in Rankingcited by 49
  13. 2020PROP: Pre-training with Representative Words Prediction for Ad-hoc Retrievalcited by 40
  14. 2021B-PROP: Bootstrapped Pre-training with Representative Words Prediction for Ad-hoc Retrievalcited by 25
  15. 2020Selective Weak Supervision for Neural Information Retrievalcited by 10
  16. 2020Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervisioncited by 8

Built on by

Cited by year

Citing papers per year: 2023: 6; 2024: 1.

7 papers.