DRAMA: Diverse Augmentation from Large Language Models to Smaller Dense Retrievers
Authors: Xueguang Ma, Xi Victoria Lin, Barlas Oguz, Jimmy Lin, Wen-tau Yih, Xilun Chen Affiliations: Meta, University of Waterloo Date: February 2025 Paper: https://arxiv.org/abs/2502.18460
Overview
DRAMA explores how large language models can be used to augment the training of significantly smaller dense retrieval models. The core motivation is a familiar one in modern information retrieval: LLMs carry strong semantic and generative capabilities, but running them at inference time is expensive, while small bi-encoder retrievers are fast and cheap but historically weaker in zero-shot and domain-generalization settings. DRAMA's approach, as its name suggests, transfers knowledge from LLMs to small retrievers through diverse augmentation of training data — enriching both queries and documents with LLM-generated variations — so that compact dense retrievers trained this way approach LLM-level capability at a fraction of the serving cost.
> Note: This post is a structured digest based on the paper's metadata and the poster's framing. Specific benchmark numbers should be verified against the original PDF at arXiv:2502.18460.
Why this matters
- Dense retrieval with tiny models (e.g., ~0.1B–1B parameters) enables millisecond-level ANN recall and cheap indexing.
- LLM-based data augmentation can close the generalization gap without LLM inference at query time.
- The retrieval stack (retriever → reranker → generator) remains the dominant architecture; making the first stage stronger with small models directly reduces latency and cost for RAG systems.
- IR — Information Retrieval
- RAG — Retrieval-Augmented Generation
- LTR — Learning to Rank
- nDCG — Normalized Discounted Cumulative Gain
- Agentic Search — Modeling search as sequential decisions and tool calls
- CAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
- CoEvo: Coevolution of LLM and Retrieval Model for Domain-Specific Information Retrieval
- ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance
- Fine-Tuning LLaMA for Multi-Stage Text Retrieval (arXiv:2310.08319)
- How Does Generative Retrieval Scale to Millions of Passages? (Google Research)
Typical evaluation context
Work in this area is generally evaluated on standard IR benchmarks such as MS MARCO and BEIR, with metrics like nDCG@10 and Recall@k, against baselines including BM25, off-the-shelf dense retrievers, and cross-encoder rerankers.
Engineering checklist (from the poster's appendix)
| Concern | Recommendation | |---|---| | Data hygiene | PII scrubbing, versioned and rollback-capable embedding indexes | | Latency | Cascade retrieval with early stopping, cache hot queries, async reranking | | Quality | Validate offline gains with interleaving experiments and human audits | | Safety | Source whitelisting, poisoning detection, output filtering | | Cost | Route to smaller models, distillation, hybrid sparse+dense retrieval |