Discrete Prompt Optimization via Constrained Generation for Zero-shot Re-ranker (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies suggest re-rankers by fine-tuning pre-trained language models . however, manual search for discrete prompts is expensive and sub-optimal in transferability . |
| Approach: | They propose a discrete prompt optimization method that guides the generated texts toward optimal prompts . they propose to use large-scale language models as a zero-shot re-ranker . |
| Outcome: | The proposed method improves the performance of the re-ranker against baselines and human prompts. |
Similar Papers
Zero-shot Approach to Overcome Perturbation Sensitivity of Prompts (2023.acl-long)
Copied to clipboard
| Challenge: | Recent studies have demonstrated that natural-language prompts can help to leverage the knowledge learned by pre-trained language models for the binary sentence-level sentiment classification task. |
| Approach: | They propose to use few-shot learning settings to fine-tune the sentiment classification model using manual or automatically generated prompts. |
| Outcome: | The proposed method outperforms the base prompt and the prompts generated using few-shot learning for the binary sentence-level sentiment classification task. |
Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels (2024.naacl-short)
Copied to clipboard
| Challenge: | Existing pointwise LLMs provide noisy or biased answers for documents that are partially relevant to the query. |
| Approach: | They propose to incorporate fine-grained relevance labels into the LLM prompt . they propose to better differentiate between documents with different levels of relevance . |
| Outcome: | The proposed model can differentiate between documents with different levels of relevance to the query and derive a more accurate ranking. |
PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrieval (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) excel in zero-shot document ranking tasks. |
| Approach: | They propose a prompt-based re-ranking method that requires no further training but is only feasible for reranking a handful of candidates due to computational costs. |
| Outcome: | The proposed method can retrieve documents from the entire corpus without training and with a large amount of paired text data. |
Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that training examples improve zero-shot performance of supervised ranking models. |
| Approach: | They propose to augment supervised ranking models with pairs of queries and documents to improve their performance. |
| Outcome: | The proposed model outperforms the unsupervised models on in-domain and out-domain retrieval benchmarks. |
Few-shot Reranking for Multi-hop QA via Language Model Prompting (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for multi-hop QA with open-domain questions require a large number of labeled question-document pairs for retrieval. |
| Approach: | They propose a language-based prompt for multi-hop path reranking that relies on language model prompting to generate a relevance score between a question and the path. |
| Outcome: | The proposed method yields strong retrieval performance on HotpotQA with only 128 training examples compared to state-of-the-art methods trained on thousands of examples. |
Improving Passage Retrieval with Zero-Shot Question Generation (2022.emnlp-main)
Copied to clipboard
Devendra Sachan, Mike Lewis, Mandar Joshi, Armen Aghajanyan, Wen-tau Yih, Joelle Pineau, Luke Zettlemoyer
| Challenge: | Existing re-ranking methods for open-domain question answering are not domain- or task-specific. |
| Approach: | They propose a simple and effective re-ranking method for improving passage retrieval in open-domain question answering. |
| Outcome: | The proposed method outperforms strong supervised models on open-domain questions and triviaQA datasets on top-1000 passages. |
GENRA: Enhancing Zero-shot Retrieval with Rank Aggregation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been shown to perform zero-shot document retrieval, a process that typically consists of two steps: retrieving relevant documents, and re-ranking them based on their relevance to the query. |
| Approach: | They propose a new approach to zero-shot document retrieval that incorporates rank aggregation to improve retrieval effectiveness. |
| Outcome: | The proposed approach improves existing methods on benchmark datasets and shows that it can perform zero-shot retrieval. |
ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent Large Language Models (LLMs) have demonstrated remarkable performance in document reranking tasks. |
| Approach: | They propose a two-stage training approach for document reranking using reinforcement learning and fine-grained score learning. |
| Outcome: | The proposed approach outperforms open-source and proprietary reranking models on BEIR benchmark. |
Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting (2024.findings-naacl)
Copied to clipboard
Zhen Qin, Rolf Jagerman, Kai Hui, Honglei Zhuang, Junru Wu, Le Yan, Jiaming Shen, Tianqi Liu, Jialu Liu, Donald Metzler, Xuanhui Wang, Michael Bendersky
| Challenge: | Existing methods to rank documents using large language models do not understand these challenging ranking formulations. |
| Approach: | They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets . |
| Outcome: | The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average. |
Prompt Consistency for Zero-Shot Task Generalization (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent work has shown that pre-trained language models can perform zero-shot generalization to new tasks without annotated examples. |
| Approach: | They propose to regularize prompt consistency to encourage consistent predictions over a diverse set of prompts. |
| Outcome: | The proposed approach outperforms the state-of-the-art zero-shot learner, T0, on 9 out of 11 datasets across 4 NLP tasks by 10.6 absolute points in terms of accuracy. |