Challenge: Recent studies show that large language models (LLMs) rank documents based on the probability of generating the query given the content of a document.
Approach: They propose a ranking system that integrates LLMs with a hybrid zero-shot retriever.
Outcome: The proposed system shows exceptional ranking in both zero-shot and few-shot scenarios.

Similar Papers

Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)

Copied to clipboard

Challenge: Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers.
Approach: They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT.
Outcome: The proposed model has been successfully integrated into a commercial web search engine as of February 2024.
Improving Zero-shot LLM Re-Ranker with Risk Minimization (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) are effective Query Likelihood Models, but their estimation is biased and the model's accuracy is poor.
Approach: They propose a framework which leverages Bayesian decision theory to quantify and mitigate this bias.
Outcome: The proposed framework improves re-ranking, especially in improving the Top-1 accuracy.
Zero-Shot Cross-Lingual Reranking with Large Language Models for Low-Resource Languages (2024.acl-short)

Copied to clipboard

Challenge: Large language models (LLMs) have shown impressive zero-shot capabilities in various passage ranking tasks.
Approach: They analyze and compare the effectiveness of monolingual reranking using query or document translations and evaluate the effectiveness when leveraging their own generated translations.
Outcome: The proposed models perform better when using their own translations than when using query or document translations.
How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models (2025.findings-emnlp)

Copied to clipboard

Challenge: a systematic and comprehensive empirical evaluation of state-of-the-art reranking methods is presented.
Approach: They evaluate 22 reranking methods including 40 variants across established benchmarks . primary goal is to determine whether performance disparity exists between LLM-based reranters and lightweight counterparts based on novel queries .
Outcome: The proposed methods perform better on familiar queries than lightweight models, the authors show .
Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents (2023.emnlp-main)

Copied to clipboard

Challenge: Existing work utilizes generative LLMs for Information Retrieval (IR) rather than direct passage ranking.
Approach: They investigate generative LLMs such as ChatGPT and GPT-4 for relevance ranking in IR and use a test set to verify the model’s ability to rank unknown knowledge.
Outcome: The proposed model outperforms a 3B supervised model on the BEIR benchmark.
Predicting Language Models’ Success at Zero-Shot Probabilistic Prediction (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent work has investigated the capabilities of large language models (LLMs) as zero-shot models for generating individual-level characteristics.
Approach: They conduct a large-scale empirical study of large language models’ zero-shot predictive capabilities across a wide range of tabular prediction tasks.
Outcome: The results show that LLMs perform well on the base prediction task, and when they perform well, they are more likely to provide high-quality predictions.
Aligning Instruction Tasks Unlocks Large Language Models as Zero-Shot Relation Extractors (2023.findings-acl)

Copied to clipboard

Challenge: Recent work has shown that fine-tuning large language models on large instruction-following datasets improves their performance on a wide range of NLP tasks, but they fail to outperform small LMs on relation extraction (RE), a fundamental information extraction task.
Approach: They propose a framework that aligns RE with question answering (QA), a predominant task in instruction-tuning datasets.
Outcome: The proposed framework outperforms small LLMs on relation extraction (RE), a fundamental information extraction task, by a large margin.
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.
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.
Large Language Models are Built-in Autoregressive Search Engines (2023.findings-acl)

Copied to clipboard

Challenge: Existing dual-encoder dense retrievers obtain representations for questions and documents independently, allowing only shallow interactions between them.
Approach: They propose to use large language models to generate URLs for document retrieval by following human instructions.
Outcome: The proposed method achieves better retrieval performance than existing retrieval approaches on open-domain question answering benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations