arXiv:2602. 12424v2 Announce Type: replace-cross Abstract: Benchmarks establish a standardized evaluation framework to systematically assess the performance of large language models (LLMs), facilitating objective comparisons and driving advancements in the field.
By Ziqian Zhang, Xingjian Hu, Yue Huang, Kai Zhang, Ruoxi Chen, Yixin Liu, Qingsong Wen, Kaidi Xu, Xiangliang Zhang, Neil Zhenqiang Gong, Lichao Sun
arXiv:2607. 10555v1 Announce Type: cross Abstract: Generative Large Language Models (LLMs) have revolutionized information retrieval, yet their strictly parametric nature frequently leads to severe factual hallucinations when confronted with complex queries beyond their epistemic boundaries.
By Zichuan Liu, Ruijin Hua
arXiv:2608. 10528v1 Announce Type: cross Abstract: Anchor-based pointwise LLM reranking scores each candidate against a shared reference passage to recover cross-document context at pointwise cost.
By Utshab Kumar Ghosh, Shubham Chatterjee
Re$^3$Rank is a listwise reranker that uses reasoning-conditioned retrieval heads (RRHeads). It generates a reasoning trace for each candidate, then scores candidates by using the trace tokens as attention queries for selected RRHeads, producing continuous relevance scores. A straight‑through estimator allows joint training of the generator and scorer, and on nine benchmarks the 4B model outperforms 11 baseline rerankers by an average of 3.11 NDCG@10 points, while the 0.6B model beats rerankers with up to 32B parameters.
By Ruiyi Yan, Zhuoyuan Mao, Yugo Murawaki, Yiwen Guo
arXiv:2610.22797v1 Announce Type: cross
Abstract: Reasoning rerankers write a rationale before ranking a candidate slate, and existing systems read item metadata to do so, even though generative reco...
By Zhenwei Tang, Jintao Liu, Di Bai, Xidong Wu, Xinwu Cheng
arXiv:2606. 01070v1 Announce Type: cross Abstract: Dense retrievers excel at first-stage candidate generation but lack effective reranking in zero-resource settings.
By Shiyan Liu, Yichen Li