Fitting Into Any Shape: A Flexible LLM-Based Re-Ranker With Configurable Depth and Width
Zheng Liu, Chaofan Li, Shitao Xiao, Chaozhuo Li, Chen Jason Zhang, Hao Liao, Defu Lian, Yingxia Shao
Abstract
Large language models (LLMs) provide powerful foundations to perform fine-grained text re-ranking. However, they are often prohibitive in reality due to constraints on computation bandwidth. In this work, we propose a flexible architecture called Matroyshka Re-Ranker, which is designed to facilitate runtime customization of model layers and sequence lengths at each layer based on users' configurations. Consequently, the LLM-based re-rankers can be made applicable across various real-world situations. The increased flexibility may come at the cost of precision loss. To address this problem, we introduce a suite of techniques to optimize the performance. First, we propose cascaded self-distillation, where each sub-architecture learns to preserve a precise re-ranking performance from its super components, whose predictions can be exploited as smooth and informative teacher signals. Second, we design a factorized compensation mechanism, where two collaborative LoRA modules, vertical and horizontal, are jointly employed to compensate for the precision loss resulted from arbitrary combinations of layer and sequence compression. We perform comprehensive experiments using passage and document retrieval datasets from MSMARCO, along with all public datasets from BEIR. In our experiments, Matryoshka Re-Ranker substantially outperforms existing methods, while effectively preserving its superior performance across various compression forms and application scenarios. We have publicly released our method at this https://github.com/FlagOpen/FlagEmbedding repo.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 23f9b62f-2afb-495e-a1e2-b0153b7fd2b3Cited by top-tier papers1
Ask how each one uses itRelated papers
- MatryoshkaKV: Adaptive KV Compression via Trainable Orthogonal ProjectionBokai Lin, Zihao Zeng, Zipeng Xiao, Siqi Kou et al.ICLR 2025
- Matryoshka-Adaptor: Unsupervised and Supervised Tuning for Smaller Embedding DimensionsJinsung Yoon, Rajarishi Sinha, Sercan Ömer Arik, Tomas PfisterEMNLP 2024 · 1 citation
- SMEC:Rethinking Matryoshka Representation Learning for Retrieval Embedding CompressionBiao Zhang, Lixin Chen, Tong Liu, Bo ZhengEMNLP 2025
- 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
- Flexora: Flexible Low-Rank Adaptation for Large Language ModelsChenxing Wei, Yao Shu, Ying Tiffany He, Fei YuACL 2025 · 12 citations
