REVIEW 4 cited by
Self-Calibrated Listwise Reranking 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
Signed reviews
read the original abstract
Large language models (LLMs), with advanced linguistic capabilities, have been employed in reranking tasks through a sequence-to-sequence approach. In this paradigm, multiple passages are reranked in a listwise manner and a textual reranked permutation is generated. However, due to the limited context window of LLMs, this reranking paradigm requires a sliding window strategy to iteratively handle larger candidate sets. This not only increases computational costs but also restricts the LLM from fully capturing all the comparison information for all candidates. To address these challenges, we propose a novel self-calibrated listwise reranking method, which aims to leverage LLMs to produce global relevance scores for ranking. To achieve it, we first propose the relevance-aware listwise reranking framework, which incorporates explicit list-view relevance scores to improve reranking efficiency and enable global comparison across the entire candidate set. Second, to ensure the comparability of the computed scores, we propose self-calibrated training that uses point-view relevance assessments generated internally by the LLM itself to calibrate the list-view relevance assessments. Extensive experiments and comprehensive analysis on the BEIR benchmark and TREC Deep Learning Tracks demonstrate the effectiveness and efficiency of our proposed method.
Forward citations
Cited by 4 Pith papers
-
Position Bias Undermines Preference Consistency in Listwise LLM-Based Reranking
LLM rerankers exhibit position bias at the pairwise, global, and output levels, and these consistency failures can worsen even when accuracy and exposure metrics improve.
-
JointRank: Rank Large Set with Single Pass
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.
-
Full-Stack Optimized Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation
ReLLaX combines semantic behavior retrieval, collaborative soft prompts, and a new fully interactive LoRA variant to improve LLM-based CTR prediction on long user histories.
-
CoRank: LLM-Based Compact Reranking with Document Features for Scientific Retrieval
CoRank reranks scientific documents by first scoring 200 candidates from compact LLM-extracted features and then refining the top 20 with full text, improving average nDCG@10 from 50.6 to 55.5.
Discussion (0). Continue with ORCID to comment.