A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zhuang, Shengyao, Zhuang, Honglei, Koopman, Bevan, Zuccon, Guido
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917678831108096
author Zhuang, Shengyao
Zhuang, Honglei
Koopman, Bevan
Zuccon, Guido
author_facet Zhuang, Shengyao
Zhuang, Honglei
Koopman, Bevan
Zuccon, Guido
contents We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Pointwise, Pairwise, and Listwise. Through the first-of-its-kind comparative evaluation within a consistent experimental framework and considering factors like model size, token consumption, latency, among others, we show that existing approaches are inherently characterised by trade-offs between effectiveness and efficiency. We find that while Pointwise approaches score high on efficiency, they suffer from poor effectiveness. Conversely, Pairwise approaches demonstrate superior effectiveness but incur high computational overhead. Our Setwise approach, instead, reduces the number of LLM inferences and the amount of prompt token consumption during the ranking procedure, compared to previous methods. This significantly improves the efficiency of LLM-based zero-shot ranking, while also retaining high zero-shot ranking effectiveness. We make our code and results publicly available at \url{https://github.com/ielab/llm-rankers}.
format Preprint
id arxiv_https___arxiv_org_abs_2310_09497
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models
Zhuang, Shengyao
Zhuang, Honglei
Koopman, Bevan
Zuccon, Guido
Information Retrieval
Artificial Intelligence
We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Pointwise, Pairwise, and Listwise. Through the first-of-its-kind comparative evaluation within a consistent experimental framework and considering factors like model size, token consumption, latency, among others, we show that existing approaches are inherently characterised by trade-offs between effectiveness and efficiency. We find that while Pointwise approaches score high on efficiency, they suffer from poor effectiveness. Conversely, Pairwise approaches demonstrate superior effectiveness but incur high computational overhead. Our Setwise approach, instead, reduces the number of LLM inferences and the amount of prompt token consumption during the ranking procedure, compared to previous methods. This significantly improves the efficiency of LLM-based zero-shot ranking, while also retaining high zero-shot ranking effectiveness. We make our code and results publicly available at \url{https://github.com/ielab/llm-rankers}.
title A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models
topic Information Retrieval
Artificial Intelligence
url https://arxiv.org/abs/2310.09497