mlsanityData to 7 Oct 2026

Tevatron-Elastic: A Unified Abstraction for Training Elastic Retrievers and Rerankers

arXiv 2608.08809 ↗First posted 9 Aug 2026cs.CLcited by 0

On the map: Efficient LLM inference and serving → Prompt and context compression

Abstract (arXiv)

A single model scale challenges the flexibility of a production retrieval system: some settings need it faster, others need a smaller index, and the right trade-off changes with the workload. In the context of information retrieval (IR), a transformer-based model can be made smaller in three ways---using fewer layers, passing fewer tokens through the upper layers, or producing a shorter embedding---and each way saves a different compute resource. These options have been studied one at a time, each as its own method with its own code and training setup, which makes them hard to combine or adapt to a new model. We present~ours to bring all three under one simple abstraction: a single object names any size the model can run at, and a short schedule lists the sizes to train. Training then produces one checkpoint that serves all of those sizes, and at deployment the user picks any of them. The same abstraction covers both retrievers and rerankers and both encoder and decoder models, as it works through interfaces that Hugging Face transformers already expose; a new backbone is a configuration change, not new modeling code. Prior methods---Matryoshka embeddings, early exit, 2D~Matryoshka (e.g., Starbucks), and layerwise token compression---become special cases of our unified abstraction. The same interface also enables Matryoshka~LTC (MLTC), which jointly trains several token-compression ratios in one retriever checkpoint. To validate our framework, we train 20 checkpoints across three backbones and two tasks: the quality curves are smooth, one checkpoint costs little over a model trained for a single size, and a controlled study confirms the wallclock speedups. We release the framework and all checkpoints as a resource for building elastic retrieval systems.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 30 of its 37 references that are in the map. First posted on arXiv 9 Aug 2026.

Builds on

30 of 37 references.

References · 30

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2024The Llama 3 Herd of Modelscited by 14,192
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  5. 2017Billion-scale similarity search with GPUscited by 2,477
  6. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  7. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  8. 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 527
  9. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
  10. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
  11. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
  12. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
18 more
  1. 2022Matryoshka Representation Learningcited by 268
  2. 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
  3. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  4. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
  5. 2024SPLADE-v3: New baselines for SPLADEcited by 69
  6. 2025Tevatron 2.0: Unified Document Retrieval Toolkit across Scale, Language, and Modalitycited by 30
  7. 2025A Survey of Model Architectures in Information Retrievalcited by 20
  8. 2025Hard Negatives, Hard Lessons: Revisiting Training Data Quality for Robust Information Retrieval with LLMscited by 17
  9. 2024State Space Models are Strong Text Rerankerscited by 10
  10. 2025CSPLADE: Learned Sparse Retrieval with Causal Language Modelscited by 10
  11. 2025Distillation versus Contrastive Learning: How to Train Your Rerankerscited by 6
  12. 2025Beyond Correctness: Rewarding Faithful Reasoning in Retrieval-Augmented Generationcited by 6
  13. 2025Jasper-Token-Compression-600M Technical Reportcited by 5
  14. 2026LACONIC: Dense-Level Effectiveness for Scalable Sparse Retrieval via a Two-Phase Training Curriculumcited by 5
  15. 2025RECON: Reasoning with Condensation for Efficient Retrieval-Augmented Generationcited by 3
  16. 2025Rethinking On-policy Optimization for Query Augmentationcited by 3
  17. 2026Layer-wise Token Compression for Efficient Document Rerankingcited by 2
  18. 2026Tevatron Meets Megatron: Expert-Parallel LLM Reranker Training on an Academic Budgetcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2023Retrieval-Pretrained Transformer: Long-range Language Modeling with Self-retrieval
  2. 2026Mixture-of-Experts Language Models Can Be Strong and Efficient Retrievers
  3. 2026HAKARI-Bench: A Lightweight Benchmark for Comparing Retrieval Architectures and Efficiency Settings under Unified Conditions
  4. 2026ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression
  5. 2026Retrievit: In-context Retrieval Capabilities of Transformers, State Space Models, and Hybrid Architectures
  6. 2024Beyond Benchmarks: Evaluating Embedding Model Similarity for Retrieval Augmented Generation Systems
  7. 2026EmbeddingRWKV: State-Centric Retrieval with Reusable States
  8. 2026Revisiting RAG Retrievers: An Information Theoretic Benchmark