A Two-Stage Adaptation of Large Language Models for Text Ranking (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in pre-trained language models (PLMs) have significantly improved ranking performance in text ranking tasks. |
| Approach: | They propose a two-stage progressive paradigm to better adapt LLMs to text ranking by conducting continual pre-training on a large weakly-supervised corpus and performing SFT on high-quality data. |
| Outcome: | The proposed approach outperforms previous methods on in- and out-domain scenarios. |
Similar Papers
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. |
A Survey of Post-Training Scaling in Large Language Models (2025.acl-long)
Copied to clipboard
Hanyu Lai, Xiao Liu, Junjie Gao, Jiale Cheng, Zehan Qi, Yifan Xu, Shuntian Yao, Dan Zhang, Jinhua Du, Zhenyu Hou, Xin Lv, Minlie Huang, Yuxiao Dong, Jie Tang
| Challenge: | Large language models (LLMs) have demonstrated proficiency in understanding and generating human natural languages. |
| Approach: | They propose a framework for scaling large language models using supervised fine-tuning, RLxF and test-time compute methodologies. |
| Outcome: | The proposed model can be used to understand and generate human natural languages. |
A Novel Paradigm Boosting Translation Capabilities of Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing studies on LLMs focused on supervised fine-tuning but their effectiveness has been limited. |
| Approach: | They propose a paradigm consisting of three stages: Secondary Pre-training using extensive monolingual data, Continual Pre- training with interlinear text format documents, and Leveraging source-language consistent instruction for supervised fine-tuning. |
| Outcome: | The proposed approach surpasses previous work and achieves superior performance compared to models such as NLLB-54B(CITATION) and GPT3.5-text-davinci-003. |
ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent Large Language Models (LLMs) have demonstrated remarkable performance in document reranking tasks. |
| Approach: | They propose a two-stage training approach for document reranking using reinforcement learning and fine-grained score learning. |
| Outcome: | The proposed approach outperforms open-source and proprietary reranking models on BEIR benchmark. |
Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting (2024.findings-naacl)
Copied to clipboard
Zhen Qin, Rolf Jagerman, Kai Hui, Honglei Zhuang, Junru Wu, Le Yan, Jiaming Shen, Tianqi Liu, Jialu Liu, Donald Metzler, Xuanhui Wang, Michael Bendersky
| Challenge: | Existing methods to rank documents using large language models do not understand these challenging ranking formulations. |
| Approach: | They propose to use Pairwise Ranking Prompting to improve ranking performance . they propose to outperform fine-tuned baseline rankers on benchmark datasets . |
| Outcome: | The proposed technique outperforms supervised baselines on benchmark datasets and outperformed other LLM-based solutions by over 10% on average. |
Parameter-Efficient Neural Reranking for Cross-Lingual and Multilingual Retrieval (2022.coling-1)
Copied to clipboard
| Challenge: | State-of-the-art neural rankers are notoriously data-hungry and rarely used in multilingual and cross-lingual retrieval settings. |
| Approach: | They propose to use Sparse Fine-Tuning Masks and Adapters to transfer rankers trained on English data to other languages and cross-lingual setups by means of multilingual encoders. |
| Outcome: | The proposed methods outperform standard zero-shot transfer with full MMT fine-tuning while being more modular and reducing training times. |
Are LLMs Reliable Rankers? Rank Manipulation via Two-Stage Token Optimization (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used as rerankers, but their ranking behavior can be steered by small, natural-sounding prompts. |
| Approach: | They propose a token optimization method that crafts concise textual perturbations to consistently promote a target item in LLM-generated rankings. |
| Outcome: | The proposed method outperforms state-of-the-art base-lines and is hard to detect. |
FIRST: Faster Improved Listwise Reranking with Single Token Decoding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing listwise LLMs lack efficiency as they provide ranking output in the form of a generated ordered sequence of candidate passage identifiers. |
| Approach: | They propose a listwise LLM reranking approach that leverages the first generated identifier to obtain a ranked ordering of the candidates. |
| Outcome: | The proposed approach accelerates inference by 50% while maintaining robust ranking performance with gains across BEIR benchmark. |
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. |
ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inference (2022.findings-acl)
Copied to clipboard
Kai Hui, Honglei Zhuang, Tao Chen, Zhen Qin, Jing Lu, Dara Bahri, Ji Ma, Jai Gupta, Cicero Nogueira dos Santos, Yi Tay, Donald Metzler
| Challenge: | State-of-the-art neural models typically encode document-query pairs using cross-attention for re-ranking. |
| Approach: | They propose to fine tune a pretrained encoder-decoder model using document to query generation. |
| Outcome: | The proposed model achieves comparable results to more expensive approaches while being 6.8X faster. |