ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval
Soyoung Yoon, Eunbi Choi, Jiyeon Kim, Hyeongu Yun, Yireun Kim, Seung-won Hwang
Abstract
We propose LISTT5, a novel reranking approach based on Fusion-in-Decoder (FiD) that handles multiple candidate passages at both train and inference time. We also introduce an efficient inference framework for listwise ranking based on m-ary tournament sort with output caching. We evaluate and compare our model on the BEIR benchmark for zero-shot retrieval task, demonstrating that LISTT5 (1) outperforms the state-of-the-art RankT5 baseline with a notable +1.3 gain in the average NDCG@10 score, (2) has an efficiency comparable to pointwise ranking models and surpasses the efficiency of previous listwise ranking models, and (3) overcomes the lost-in-the-middle problem of previous listwise rerankers. Our code, model checkpoints, and the evaluation framework are fully open-sourced at https: //github.com/soyoung97/ListT5 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2437d154-a5c1-4cea-a9d1-d36f6e35fd01Cited by top-tier papers9
- TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired StrategyYiqun Chen, Qi Liu, Yi Zhang, Weiwei Sun et al.WWW 2025 · 52 citations
- Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language ModelsQi Liu, Bo Wang, Nan Wang, Jiaxin MaoWWW 2025 · 26 citations
- Self-Calibrated Listwise Reranking with Large Language ModelsRuiyang Ren, Yuhao Wang, Kun Zhou, Wayne Xin Zhao et al.WWW 2025 · 12 citations
- Optimizing User Profiles via Contextual Bandits for Retrieval-Augmented LLM PersonalizationLinfeng Du, Ye Yuan, Zichen Zhao, Fuyuan Lyu et al.ACL 2026 · 3 citations
- Compress-then-Rank: Faster and Better Listwise Reranking with Large Language Models via Ranking-Aware Passage CompressionZhewei Zhi, Yingyi Zhang, Yizhen Jing, Xianneng Li et al.AAAI 2026 · 1 citation
Builds on5
- Large Dual Encoders Are Generalizable RetrieversJianmo Ni, Chen Qu, Jing Lu, Zhuyun Dai et al.EMNLP 2022 · 145 citations
- Dense Passage Retrieval for Open-Domain Question AnsweringVladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis et al.EMNLP 2020 · 142 citations
- FiD-Light: Efficient and Effective Retrieval-Augmented Text GenerationSebastian Hofstätter, Jiecao Chen, Karthik Raman, Hamed ZamaniSIGIR 2023 · 47 citations
- FiD-Ex: Improving Sequence-to-Sequence Models for Extractive Rationale GenerationKushal Lakhotia, Bhargavi Paranjape, Asish Ghoshal, Scott Yih et al.EMNLP 2021 · 15 citations
- Learning List-Level Domain-Invariant Representations for RankingRuicheng Xian, Honglei Zhuang, Zhen Qin, Hamed Zamani et al.NeurIPS 2023 · 11 citations
Related papers
- FIRST: Faster Improved Listwise Reranking with Single Token DecodingRevanth Gangi Reddy, JaeHyeok Doo, Yifei Xu, Md. Arafat Sultan et al.EMNLP 2024 · 14 citations
- Improving Passage Retrieval with Zero-Shot Question GenerationDevendra Singh Sachan, Mike Lewis, Mandar Joshi, Armen Aghajanyan et al.EMNLP 2022 · 69 citations
- PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document RetrievalShengyao Zhuang, Xueguang Ma, Bevan Koopman, Jimmy Lin et al.EMNLP 2024 · 26 citations
- Augmenting Zero-Shot Dense Retrievers with Plug-in Mixture-of-MemoriesSuyu Ge, Chenyan Xiong, Corby Rosset, Arnold Overwijk et al.EMNLP 2023 · 4 citations
- PRP-Graph: Pairwise Ranking Prompting to LLMs with Graph Aggregation for Effective Text Re-rankingJian Luo, Xuanang Chen, Ben He, Le SunACL 2024 · 7 citations
