Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking (2022.emnlp-main)
Copied to clipboard
| Challenge: | In information retrieval, candidate set pruning is used to speed up two-stage relevance ranking but lacks accurate error control and empirical guarantees. |
| Approach: | They propose a method that guarantees the test error after pruning is controlled under a user-specified threshold with high probability. |
| Outcome: | The proposed method reduces the average set size from 1000 to 27, increasing reranking speed by about 37 times while keeping MRR@10 greater than a pre-specified value of 0.38 with about 90% empirical coverage. |
Similar Papers
Threshold-driven Pruning with Segmented Maximum Term Weights for Approximate Cluster-based Sparse Retrieval (2024.emnlp-main)
Copied to clipboard
| Challenge: | Using rank score thresholding, sparse retrieval skips the index at cluster and document levels. |
| Approach: | They propose a pruning control scheme with a probabilistic guarantee on rank-safeness competitiveness. |
| Outcome: | The proposed pruning control scheme improves accuracy and safeness while delivering low latency on single-threaded CPU. |
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. |
Two-Stage Regularization-Based Structured Pruning for LLMs (2026.acl-long)
Copied to clipboard
Mingkuan Feng, Jinyang Wu, Siyuan Liu, Shuai Zhang, Hongjian Fang, Ruihan Jin, Feihu Che, Pengpeng Shao, Zhengqi Wen, Jianhua Tao
| Challenge: | Structural pruning is a promising solution for large language models . prior structured pruning methods remove unimportant parameters based on certain metrics . |
| Approach: | They propose a structural pruning method that iteratively learns the weights of transformer layers by adding their l1-norm to the loss function. |
| Outcome: | The proposed pruning method outperforms strong layer-wise pruning methods without requiring retraining. |
Optimizing RAG Rerankers with LLM Feedback via Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Current reranking models are optimized on static human annotations in isolation, decoupled from the downstream generation process. |
| Approach: | They propose a reinforcement learning framework that directly aligns reranking with LLM's generation quality. |
| Outcome: | Experiments on knowledge-intensive benchmarks show that RRPO outperforms strong baselines. |
Contextual Relevance and Adaptive Sampling for LLM-Based Document Reranking (2026.acl-long)
Copied to clipboard
| Challenge: | identifying relevant documents for Reasoning-intensive queries remains a challenge . large language models have shown strong performance in zero-shot document reranking . |
| Approach: | They propose a reranking algorithm that estimates contextual relevance by aggregating LLMs' relevance judgments across batches. |
| Outcome: | The proposed algorithm improves nDCG@10 over retrieval and reranking baselines by 15% and 6–21% respectively. |
LimRank: Less is More for Reasoning-Intensive Information Reranking (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to rerank information require large-scale fine-tuning, which is computationally expensive. |
| Approach: | They propose an open-source pipeline for generating diverse, challenging, and realistic reranking examples. |
| Outcome: | The proposed model performs competitively on two benchmarks, while being trained on less than 5% of the data typically used in prior work. |
PDTrim: Targeted Pruning for Prefill-Decode Disaggregation in Inference (2026.acl-long)
Copied to clipboard
| Challenge: | Existing pruning methods ignore prefill-decode (PD) disaggregation in practice. |
| Approach: | They propose a pruning method that is highly integrated with prefill-decode (PD) disaggregation, enabling more precise pruning of blocks. |
| Outcome: | The proposed method achieves strong performance in both PD disaggregation and PD unified settings, and can be extended to other non-block pruning methods. |
TOME: A Two-stage Approach for Model-based Retrieval (2023.acl-long)
Copied to clipboard
| Challenge: | Recent research has focused on model-based retrieval, which discards the index in the traditional retrieval model and memorizes the candidate corpora using model parameters. |
| Approach: | They propose a model-based retrieval approach that discards the index in the traditional retrieval model and memorizes the candidate corpora using model parameters. |
| Outcome: | The proposed approach eliminates the index in the traditional retrieval model and memorizes the candidate corpora using model parameters. |
Towards Robust Pruning: An Adaptive Knowledge-Retention Pruning Strategy for Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing pruning strategies struggle to enhance robustness against adversarial attacks when continually increasing model sparsity and require a retraining process. |
| Approach: | They propose a pruning strategy that replicates embedding space and feature space of dense language models and aims to conserve more pre-trained knowledge during the pruning process. |
| Outcome: | The proposed pruning strategy replicates embedding space and feature space of dense language models, aiming to conserve more pre-trained knowledge during the pruning process. |
RankAdaptor: Hierarchical Rank Allocation for Efficient Fine-Tuning Pruned LLMs via Performance Model (2025.findings-naacl)
Copied to clipboard
| Challenge: | Current compression techniques entail structural pruning and a recovery phase that leverages the Low-Rank Adaptation algorithm. |
| Approach: | They propose a hierarchical rank allocation method that enables efficient fine-tuning of pruned LLMs according to layerwise specific recovery requirements. |
| Outcome: | The proposed algorithm outperforms state-of-the-art methods across pruning settings and LLM architectures with improvements ranging from 0.7% to 5.5%. |