Cartridges at Scale: Training Modular KV Caches over Large Document Collections
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Large Language Models can reason over long contexts, yet prefilling millions of tokens is wasteful as much of the content remains static across queries. Cartridges address this by distilling document collections into reusable key-value (KV) caches that eliminate prefilling while preserving accuracy. A critical limitation of this approach is that cartridges are monolithic and non-compositional: encoding an entire collection into a single KV block does not scale, and naively mixing cartridges trained in isolation collapses performance to near chance. We introduce Cartridges at Scale (CAS), a training framework for scalable multi-cartridge learning with dynamic distractor mixing and a memory-efficient budget manager that rotates hundreds of per-document cartridges between GPU and persistent storage. Our approach scales to collections exceeding a million tokens, improving over a monolithic cartridge by 10-31 points at comparable token budgets. Oracle cartridge accuracy falls within 2-6 points of full in-context learning even at high compression. When paired with retrieval for cartridge selection, CAS matches or exceeds conventional RAG accuracy while consuming 3-4x fewer prompt tokens.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 26 of its 42 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
26 of 42 references.
Closest ancestors · 10
Same direction, newest first
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution1 Oct
- 2025Inference-Time Hyper-Scaling with KV Cache Compression5 Jun
- 2025KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction29 May
- 2025ZSMerge: Zero-Shot KV Cache Compression for Memory-Efficient Long-Context LLMs13 Mar
- 2024Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks11 Jul
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference16 Jun
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling4 Jun
- 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
- 2024GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM8 Mar
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs3 Oct
Other references · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
- 2021FinQA: A Dataset of Numerical Reasoning over Financial Datacited by 552
- 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 475
- 2023Learning to Compress Prompts with Gist Tokenscited by 379
- 2023Adapting Language Models to Compress Contextscited by 350
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
- 2024xRAG: Extreme Context Compression for Retrieval-augmented Generation with One Tokencited by 123
- 2025Cartridges: Lightweight and general-purpose long context representations via self-studycited by 74
4 more
- 2024LongHealth: A Question Answering Benchmark with Long Clinical Documentscited by 33
- 2019The TechQA Datasetcited by 29
- 2026Fast KV Compaction via Attention Matchingcited by 28
- 2025Understanding and Improving Information Preservation in Prompt Compression for LLMscited by 13
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026CoMem: Reusing Transformer Depth across Queries with Persistent Intermediate Residualscited by 1
- 2026What It Costs to Compose, Rebuild, and Correct Precomputed Memorycited by 1
- 2026Cartridges++: KV Cache Compression without Off-Context Derailmentcited by 1
- 2026Self-Study Reconsidered: The Hidden Fragility of Learning from Self-Generated QAcited by 0
- 2026Data Quality over Capacity: Internalizing Documents into LoRA Adapters for Closed-Book QAcited by 0
- 2026Where Should a Document Live: Context, Representations, or Parameters?cited by 0
- 2026Cartridges++: KV Cache Compression without Off-Context Derailment28 Sep 2026
- 2026Where Should a Document Live: Context, Representations, or Parameters?15 Sep 2026
- 2026What It Costs to Compose, Rebuild, and Correct Precomputed Memory31 Aug 2026
- 2026CoMem: Reusing Transformer Depth across Queries with Persistent Intermediate Residuals30 Jul 2026
- 2026Data Quality over Capacity: Internalizing Documents into LoRA Adapters for Closed-Book QA23 Jul 2026
- 2026Self-Study Reconsidered: The Hidden Fragility of Learning from Self-Generated QA30 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2025Learned Structure in Cartridges: Keys as Shareable Routers in Self-Studied Representations
- 2026KV Packet: Recomputation-Free Context-Independent KV Caching for LLMs
- 2024EPIC: Efficient Position-Independent Caching for Serving Large Language Models
- 2026Fine-Tuning a KV Cache Concatenation-Aware Model or Recomputing KV Caches? Why Not Both?
- 2025Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scores
- 2026PCR: A Prefetch-Enhanced Cache Reuse System for Low-Latency RAG Serving
- 2026SemPIC: Learning Semantic Position-Independent KV Caches
- 2026CacheRepair: Learning to Repair Cross-Chunk Context in RAG for KV Cache Fusion