Pith. sign in

REVIEW 7 cited by

Beyond Yes and No: Improving Zero-Shot LLM Rankers via Scoring Fine-Grained Relevance Labels

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

arxiv 2310.14122 v3 pith:IB5JMR6F submitted 2023-10-21 cs.IR

classification cs.IR
keywords relevancerankerslabelsfine-graineddifferentdocumentslevelsperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Zero-shot text rankers powered by recent LLMs achieve remarkable ranking performance by simply prompting. Existing prompts for pointwise LLM rankers mostly ask the model to choose from binary relevance labels like "Yes" and "No". However, the lack of intermediate relevance label options may cause the LLM to provide noisy or biased answers for documents that are partially relevant to the query. We propose to incorporate fine-grained relevance labels into the prompt for LLM rankers, enabling them to better differentiate among documents with different levels of relevance to the query and thus derive a more accurate ranking. We study two variants of the prompt template, coupled with different numbers of relevance levels. Our experiments on 8 BEIR data sets show that adding fine-grained relevance labels significantly improves the performance of LLM rankers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models

    cs.CL 2025-08 conditional novelty 7.0 of 10

    On a new benchmark of post-April 2025 queries, LLM rerankers show a 5-15% performance drop compared with familiar benchmarks, and lightweight models match them on efficiency and sometimes accuracy.

  2. Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization

    cs.CL 2025-10 conditional novelty 6.0 of 10

    RAF, a two-stage token-optimization attack, creates brief natural-sounding text injections that reliably boost a target item's rank in LLM reranking outputs, beating state-of-the-art baselines in effectiveness, stealt...

  3. Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillation

    cs.IR 2025-07 conditional novelty 6.0 of 10

    Pairwise Ranking Distillation trains a pointwise ranker from pairwise LLM teacher labels and matches full-pair distillation using just 2% of pairs on TREC-DL.

  4. JointRank: Rank Large Set with Single Pass

    cs.IR 2025-06 conditional novelty 6.0 of 10

    JointRank partitions candidates into overlapping blocks, ranks each block in parallel with an LLM, and reconstructs a global ranking by aggregating the resulting pairwise comparisons.

  5. MM-R5: MultiModal Reasoning-Enhanced ReRanker via Reinforcement Learning for Document Retrieval

    cs.AI 2025-06 conditional novelty 6.0 of 10

    MM-R5, a 7B multimodal re-ranker trained with SFT and GRPO, achieves state-of-the-art page-level recall on MMDocIR by generating per-page reasoning chains.

  6. Scaling Search Relevance: Augmenting App Store Ranking with LLM-Generated Judgments

    cs.IR 2026-02 conditional novelty 5.0 of 10

    Using a fine-tuned 3B LLM to generate millions of textual relevance labels for App Store search improves the ranker's behavioral/textual Pareto frontier and lifts conversion by 0.24%.

  7. Leveraging LLMs to Evaluate Usefulness of Document

    cs.IR 2025-06 conditional novelty 5.0 of 10

    A cascade of LLM judges, fed with search context and behavior, produces multilevel usefulness labels for clicked documents and improves search satisfaction prediction.

Pith tools