Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model

Abstract

A supervised ranking model, despite its advantage of being effective, usually involves complex processing - typically multiple stages of task-specific pre-training and fine-tuning. This has motivated researchers to explore simpler pipelines leveraging large language models (LLMs) that are capable of working in a zero-shot manner. However, since zero-shot inference does not make use of a training set of pairs of queries and their relevant documents, its performance is mostly worse than that of supervised models, which are trained on such example pairs. Motivated by the existing findings that training examples generally improve zero-shot performance, in our work, we explore if this also applies to ranking models. More specifically, given a query and a pair of documents, the preference prediction task is improved by augmenting examples of preferences for similar queries from a training set. Our proposed pairwise few-shot ranker demonstrates consistent improvements over the zero-shot basel

Stats

• citations5
• S2 citations—
• github stars0
• HF likes0
• heat score5.84
• arxiv keysinhababu2024few

Related papers

• Promptreps: Prompting Large Language Models To Generate Dense And Sparse Representations For Zero-shot Document Retrieval (2024)10.61
• Enhancing The Ranking Context Of Dense Retrieval Methods Through Reciprocal Nearest Neighbors (2023)4.52
• Neural Ranking Models With Weak Supervision (2017)17.02
• Setrank: Learning A Permutation-invariant Ranking Model For Information Retrieval (2019)0.00
• Rankdnn: Learning To Rank For Few-shot Learning (2022)12.58
• Few-shot Learning Through An Information Retrieval Lens (2017)0.00
• Optimizing Compound Retrieval Systems (2025)0.00
• Rank-k: Test-time Reasoning For Listwise Reranking (2025)0.00