Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibration

πŸ“… 2026-04-11
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF

career value

177K/year
πŸ€– AI Summary
This work addresses the susceptibility of generative listwise reranking models to position bias, which causes their outputs to deviate from true relevance due to sensitivity to input order. Existing debiasing methods struggle to balance effectiveness and efficiency. To overcome this limitation, the authors propose CapCal, a training-free framework that decouples position bias for the first time without requiring model retraining. CapCal estimates the bias distribution using content-agnostic placeholders and corrects output logits via an entropy-adaptive contrastive mechanism. The method achieves significant performance gains across ten benchmarks, outperforming existing training-free approaches by substantial marginsβ€”e.g., yielding over 10 absolute points improvement in NDCG with lightweight models (e.g., 0.6B parameters)β€”while also surpassing strong baselines such as permutation ensembles and data augmentation, thereby maintaining both high inference efficiency and superior ranking quality.

Technology Category

Application Category

πŸ“ Abstract
Generative listwise reranking leverages global context for superior retrieval but is plagued by intrinsic position bias, where models exhibit structural sensitivity to input order independent of relevance. Existing mitigations present a dilemma: inference-time aggregation incurs prohibitive latency, while training-based methods often fail to eradicate ingrained priors, particularly in compact models. To resolve this dilemma, we propose CapCal (Content-Agnostic Probability Calibration), a training-free framework that mechanically decouples positional bias from ranking decisions. By estimating the bias distribution via content-free placeholders, CapCal rectifies output logits through an entropy-adaptive contrastive mechanism. Evaluations across 10 benchmarks confirm that CapCal achieves superior performance among training-free methods while preserving single-pass efficiency. Notably, it unlocks the latent potential of lightweight models (e.g., 0.6B), delivering absolute NDCG gains exceeding 10 points and outperforming both permutation-based aggregation and data-augmentation baselines.
Problem

Research questions and friction points this paper is trying to address.

position bias
listwise reranking
content-agnostic
probability calibration
generative retrieval
Innovation

Methods, ideas, or system contributions that make the work stand out.

position bias
listwise reranking
training-free debiasing
probability calibration
content-agnostic
πŸ”Ž Similar Papers
No similar papers found.
H
Hang Lv
University of Science and Technology of China
H
Hongchao Gu
University of Science and Technology of China
R
Ruiqing Yang
University of Science and Technology of China
Liangyue Li
Liangyue Li
Alibaba
Machine LearningData MiningGraph Mining
Zulong Chen
Zulong Chen
Director, Alibaba Group
Machine LearningLarge Language ModelSearch&RecommendationNLP
D
Defu Lian
University of Science and Technology of China
H
Hao Wang
University of Science and Technology of China
Enhong Chen
Enhong Chen
University of Science and Technology of China
data miningrecommender systemmachine learning