Multi-view-guided Passage Reranking with Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing models rely on autoregressive generation and sliding window strategies to rank passages, which incur heavy computational overhead as the number of passages increases. |
| Approach: | They propose a non-generative LLM-based reranking method that encodes query-passage information into diverse view embeddings without being influenced by external biases. |
| Outcome: | The proposed model matches the performance of much larger 7B-scale fine-tuned models while achieving a 100x reduction in inference latency. |
Similar Papers
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)
Copied to clipboard
Meixiu Long, Duolin Sun, Dan Yang, Yihan Jiao, Lei Liu, Jiahai Wang, Binbin Hu, Yue Shen, Jie Feng, Zhehao Tan, Junjie Wang, Lianzhen Zhong, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
EcoRank: Budget-Constrained Text Re-ranking Using Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated dominant performance in text re-ranking. |
| Approach: | They propose a suite of budget-constrained methods to perform text re-ranking using LLMs. |
| Outcome: | The proposed method outperforms other budget-aware methods on four datasets. |
How Good are LLM-based Rerankers? An Empirical Analysis of State-of-the-Art Reranking Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a systematic and comprehensive empirical evaluation of state-of-the-art reranking methods is presented. |
| Approach: | They evaluate 22 reranking methods including 40 variants across established benchmarks . primary goal is to determine whether performance disparity exists between LLM-based reranters and lightweight counterparts based on novel queries . |
| Outcome: | The proposed methods perform better on familiar queries than lightweight models, the authors show . |
Enhancing Reranking for Recommendation with LLMs through User Preference Retrieval (2025.coling-main)
Copied to clipboard
| Challenge: | Existing large language models (LLMs) generate redundant output, which generates irrelevant information about the user’s preferences on candidate items from user behavior sequences. |
| Approach: | They propose a framework that enhances reranking for recommendation with large language models through user preference retrieval. |
| Outcome: | The proposed framework improves reranking for recommendation with large language models through user preference retrieval on three real-world public datasets. |
Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing ensemble methods for Large Language Models focus on reward model ranking of outputs, leading to significant computation overhead. |
| Approach: | They propose a reward-guided routing method distilling rewards on training queries to train a routing function. |
| Outcome: | The proposed method outperforms the best single model and ranks first on 44% of tasks. |
ReasonRank: Empowering Passage Ranking with Strong Reasoning Ability (2026.acl-long)
Copied to clipboard
| Challenge: | Existing rerankers perform poorly in complex ranking scenarios due to the scarcity of reasoning-intensive training data. |
| Approach: | They propose an automated reasoning-intensive training framework which generates high-quality training labels from training queries and passages. |
| Outcome: | The proposed model outperforms baselines significantly and achieves much lower latency than the pointwise reranker. |
Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)
Copied to clipboard
| Challenge: | Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers. |
| Approach: | They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT. |
| Outcome: | The proposed model has been successfully integrated into a commercial web search engine as of February 2024. |
Large Language Models for Generative Recommendation: A Survey and Visionary Discussions (2024.lrec-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have revolutionized the field of natural language processing but are not fully able to leverage the generative power of LLM. |
| Approach: | They examine the progress, methods, and future directions of large language models . they examine what generative recommendation is, why RS should advance to generative recommendations . |
| Outcome: | The proposed approach can be simplified to generate recommendations from the entire pool of items. |
CoRanking: Collaborative Ranking with Small and Large Ranking Agents (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Listwise ranking based on Large Language Models (LLMs) has achieved state-of-the-art performance in Information Retrieval (IR) however, their effectiveness often depends on LLMs with massive parameter scales and computationally expensive sliding window processing, leading to substantial efficiency bottlenecks. |
| Approach: | They propose a Collaborative Ranking framework (CoRanking) for LLM-based listwise ranking based on large language models with massive parameter scales and computationally expensive sliding window processing. |
| Outcome: | The proposed framework reduces ranking latency by approximately 70% while improving effectiveness compared to the standalone large reranker. |
Sliding Windows Are Not the End: Exploring Full Ranking with Long-Context Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for listwise passage ranking use sliding window approach, which is inefficient as it requires repetitive and serialized processing. |
| Approach: | They propose a listwise label construction approach and importance-aware learning objective for full ranking. |
| Outcome: | The proposed method outperforms existing methods in listwise ranking tasks. |