Passage-specific Prompt Tuning for Passage Reranking in Question Answering with Large Language Models
Not on the map. Why?
Abstract (arXiv)
Effective passage retrieval and reranking methods have been widely utilized to identify suitable candidates in open-domain question answering tasks, recent studies have resorted to LLMs for reranking the retrieved passages by the log-likelihood of the question conditioned on each passage. Although these methods have demonstrated promising results, the performance is notably sensitive to the human-written prompt (or hard prompt), and fine-tuning LLMs can be computationally intensive and time-consuming. Furthermore, this approach limits the leverage of question-passage relevance pairs and passage-specific knowledge to enhance the ranking capabilities of LLMs. In this paper, we propose passage-specific prompt tuning for reranking in open-domain question answering (PSPT): a parameter-efficient method that fine-tunes learnable passage-specific soft prompts, incorporating passage-specific knowledge from a limited set of question-passage relevance pairs. The method involves ranking retrieved passages based on the log-likelihood of the model generating the question conditioned on each passage and the learned soft prompt. We conducted extensive experiments utilizing the Llama-2-chat-7B model across three publicly available open-domain question answering datasets and the results demonstrate the effectiveness of the proposed approach.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 29 of its 45 references that are in the map. First posted on arXiv 31 May 2024.
Builds on
29 of 45 references.
References · 29
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
17 more
- 2023Learning to Compress Prompts with Gist Tokenscited by 390
- 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 376
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 307
- 2020Overview of the TREC 2019 deep learning trackcited by 286
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
- 2021Overview of the TREC 2020 deep learning trackcited by 196
- 2020Break It Down: A Question Understanding Benchmarkcited by 131
- 2022RankT5: Fine-Tuning T5 for Text Ranking with Ranking Lossescited by 115
- 2023Multitask Prompt Tuning Enables Parameter-Efficient Transfer Learningcited by 115
- 2023Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labelscited by 86
- 2021End-to-End Training of Neural Retrievers for Open-Domain Question Answeringcited by 75
- 2019Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answeringcited by 48
- 2023Open-source Large Language Models are Strong Zero-shot Query Likelihood Models for Document Rankingcited by 44
- 2023Discrete Prompt Optimization via Constrained Generation for Zero-shot Re-rankercited by 20
- 2022Parameter-Efficient Prompt Tuning Makes Generalized and Calibrated Neural Text Retrieverscited by 18
- 2024Do Large Language Models Rank Fairly? An Empirical Study on the Fairness of LLMs as Rankerscited by 17
- 2022DPTDR: Deep Prompt Tuning for Dense Passage Retrievalcited by 10
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.