Pith. sign in

REVIEW 3 cited by

JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Reranking

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 2411.00142 v1 pith:2J7222LP submitted 2024-10-31 cs.CL cs.AI

classification cs.CLcs.AI
keywords documentjudgerankrelevanceanalysismodelsreasoning-intensivererankingaccurate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Accurate document retrieval is crucial for the success of retrieval-augmented generation (RAG) applications, including open-domain question answering and code completion. While large language models (LLMs) have been employed as dense encoders or listwise rerankers in RAG systems, they often struggle with reasoning-intensive tasks because they lack nuanced analysis when judging document relevance. To address this limitation, we introduce JudgeRank, a novel agentic reranker that emulates human cognitive processes when assessing document relevance. Our approach consists of three key steps: (1) query analysis to identify the core problem, (2) document analysis to extract a query-aware summary, and (3) relevance judgment to provide a concise assessment of document relevance. We evaluate JudgeRank on the reasoning-intensive BRIGHT benchmark, demonstrating substantial performance improvements over first-stage retrieval methods and outperforming other popular reranking approaches. In addition, JudgeRank performs on par with fine-tuned state-of-the-art rerankers on the popular BEIR benchmark, validating its zero-shot generalization capability. Through comprehensive ablation studies, we demonstrate that JudgeRank's performance generalizes well across LLMs of various sizes while ensembling them yields even more accurate reranking than individual models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking

    cs.IR 2025-08 conditional novelty 6.0 of 10

    ERank trains a pointwise reasoning-LLM reranker with fine-grained integer scoring and a listwise reinforcement-learning reward, reporting nDCG@10 of 40.2 on BRIGHT for its 32B variant with BM25 hybrid scoring.

  2. Shifting from Ranking to Set Selection for Retrieval Augmented Generation

    cs.CL 2025-07 conditional novelty 6.0 of 10

    SETR identifies a query's information requirements with chain-of-thought reasoning and selects a compact passage set, improving multi-hop RAG accuracy over fixed-top-k reranking baselines.

  3. TongSearch-QR: Reinforced Query Reasoning for Retrieval

    cs.IR 2025-06 conditional novelty 6.0 of 10

    TongSearch-QR trains 1.5B and 7B models with GRPO and a frozen-embedding reward to rewrite queries, reaching 27.9 nDCG@10 on BRIGHT with BM25, above GPT-4o's 26.5.

Pith tools