mlsanityData to 14 Oct 2026

Matryoshka Re-Ranker: A Flexible Re-Ranking Architecture With Configurable Depth and Width

arXiv 2501.16302 ↗First posted 27 Jan 2025cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

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 Low-Rank Adaptation 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 based on the passage and document retrieval datasets from MSMARCO, along with all public datasets from BEIR benchmark. In our experiments, Matryoshka Re-Ranker substantially outperforms the existing methods, while effectively preserving its superior performance across various forms of compression and different application scenarios.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Jan 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankers
  2. 2023Instruction Distillation Makes Large Language Models Efficient Zero-shot Rankers
  3. 2025Language Model Re-rankers are Fooled by Lexical Similarities
  4. 2023Lightweight reranking for language model generations
  5. 2024RE-Adapt: Reverse Engineered Adaptation of Large Language Models
  6. 2025ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking
  7. 2026ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression
  8. 2026CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring