Scaling Laws for Reranking in Information Retrieval
This paper presents the first systematic study of scaling laws for reranking in information retrieval, demonstrating that performance across pointwise, pairwise, and listwise paradigms follows predictable power laws for metrics like NDCG and MAP, thereby enabling accurate forecasting of large-model performance from smaller-scale experiments to significantly reduce computational costs.