REVIEW 2 cited by
Re-Ranking Step by Step: Investigating Pre-Filtering for Re-Ranking with Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large Language Models (LLMs) have been revolutionizing a myriad of natural language processing tasks with their diverse zero-shot capabilities. Indeed, existing work has shown that LLMs can be used to great effect for many tasks, such as information retrieval (IR), and passage ranking. However, current state-of-the-art results heavily lean on the capabilities of the LLM being used. Currently, proprietary, and very large LLMs such as GPT-4 are the highest performing passage re-rankers. Hence, users without the resources to leverage top of the line LLMs, or ones that are closed source, are at a disadvantage. In this paper, we investigate the use of a pre-filtering step before passage re-ranking in IR. Our experiments show that by using a small number of human generated relevance scores, coupled with LLM relevance scoring, it is effectively possible to filter out irrelevant passages before re-ranking. Our experiments also show that this pre-filtering then allows the LLM to perform significantly better at the re-ranking task. Indeed, our results show that smaller models such as Mixtral can become competitive with much larger proprietary models (e.g., ChatGPT and GPT-4).
Forward citations
Cited by 2 Pith papers
-
Likert or Not: LLM Absolute Relevance Judgments on Fine-Grained Ordinal Scales
Pointwise LLM scoring with an 11-point ordinal scale is statistically competitive with listwise ranking for 31 of 40 model-dataset combinations on NDCG@10.
-
Approximating the universal thermal climate index using sparse regression with orthogonal polynomials
The paper reports that sparse regression with Legendre polynomials yields UTCI approximations with lower mean error, lower root-mean-square error, and fewer large errors than the standard sixth-degree polynomial.
Discussion (0). Sign in to comment.