Cartridges++: KV Cache Compression without Off-Context Derailment
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Serving long documents to a Large Language Model (LLM) repeatedly is expensive: computations grow with context length, and the memory footprint of the key-value (KV) cache balloons. Compressed KV (CKV) representations aim to mimic the cache of a document and are typically computed once and for all, ahead of inference time. Methods to obtain CKVs range from drop mechanisms that reduce their number of columns, to learned approaches. Among the latter, Cartridges have emerged as a leading compression method, learning compact KV representations through distillation on relevant Q/A pairs. While existing evaluations focus primarily on whether Cartridges and other CKVs yield approximately similar responses to document-related, on-context queries, we investigate the crucial deployment question of whether they can handle off-context queries, something the native KV representation is particularly good at, thanks to the mechanics of attention. We observe a fundamental trade-off: while Cartridges perform better for on-context queries, heuristic-variants preserve better the original LLM's ability to operate off-context. We measure this through their capability to avoid context contamination in their response, retain general knowledge, and follow instructions. We propose Cartridges++, simple modifications to cartridges that retain off-context abilities at small or negligible cost. The router variant decides at inference time whether the query should use the learned long-context memory, while the data-mixing variant allocates a small fraction of training Q/As to queries outside the reference long document. Our study shows that assessing CKVs on document utility alone can mask substantial degradation in broader model capabilities, yet those issues can be fixed with benign changes to CKV inference or training.
Key facts. Cited by 1 paper 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 67 of its 75 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
67 of 75 references.
Closest ancestors · 13
Same direction, newest first
- 2026What It Costs to Compose, Rebuild, and Correct Precomputed Memory31 Aug
- 2026Cartridges at Scale: Training Modular KV Caches over Large Document Collections3 Jun
- 2026Training Transformers for KV Cache Compressibility7 May
- 2026Learning to Evict from Key-Value Cache10 Feb
- 2025The Pitfalls of KV Cache Compression30 Sep
- 2025Learned Structure in Cartridges: Keys as Shareable Routers in Self-Studied Representations23 Aug
- 2025KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction29 May
- 2024MatryoshkaKV: Adaptive KV Compression via Trainable Orthogonal Projection16 Oct
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling4 Jun
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attention21 May
- 2024PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference21 May
- 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
1 more
Other references · 54
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,800
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
- 2025Gemma 3 Technical Reportcited by 1,686
- 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
38 more
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2023Large Language Models Can Be Easily Distracted by Irrelevant Contextcited by 820
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 475
- 2022Memory-Based Model Editing at Scalecited by 443
- 2023Learning to Compress Prompts with Gist Tokenscited by 379
- 2023Making Retrieval-Augmented Language Models Robust to Irrelevant Contextcited by 364
- 2023Adapting Language Models to Compress Contextscited by 350
- 2024tinyBenchmarks: evaluating LLMs with fewer examplescited by 295
- 2022Conformal Risk Controlcited by 290
- 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 279
- 2022Aging with GRACE: Lifelong Model Editing with Discrete Key-Value Adaptorscited by 267
- 2021QuALITY: Question Answering with Long Input Texts, Yes!cited by 204
- 2022SGPT: GPT Sentence Embeddings for Semantic Searchcited by 204
- 2026Gemma 4 Technical Reportcited by 187
- 2024xRAG: Extreme Context Compression for Retrieval-augmented Generation with One Tokencited by 123
- 2024WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Modelscited by 90
- 2023A Benchmark for Learning to Translate a New Language from One Grammar Bookcited by 74
- 2025Cartridges: Lightweight and general-purpose long context representations via self-studycited by 74
- 2024Sufficient Context: A New Lens on Retrieval Augmented Generation Systemscited by 69
- 2024500xCompressor: Generalized Prompt Compression for Large Language Modelscited by 45
- 2024Lifelong Knowledge Editing for LLMs with Retrieval-Augmented Continuous Prompt Learningcited by 40
- 2026Doc-to-LoRA: Learning to Instantly Internalize Contextscited by 36
- 2024LongHealth: A Question Answering Benchmark with Long Clinical Documentscited by 33
- 2026Fast KV Compaction via Attention Matchingcited by 28
- 2025Training Plug-n-Play Knowledge Modules with Deep Context Distillationcited by 22
- 2025KV-Distill: Nearly Lossless Learnable Context Compression for LLMscited by 19
- 2025Semantic Integrity Matters: Benchmarking and Preserving High-Density Reasoning in KV Cache Compressioncited by 16
- 2024A Silver Bullet or a Compromise for Full Attention? A Comprehensive Study of Gist Token-based Context Compressioncited by 15
- 2025Long Context In-Context Compression by Getting to the Gist of Gistingcited by 12
- 2026Latent Context Compilation: Distilling Long Context into Compact Portable Memorycited by 11
- 2026Metis: Memory Foundation Modelcited by 5
- 2026When Does Continual Learning Require Learningcited by 4
- 2025Zero-RAG: Towards Retrieval-Augmented Generation with Zero Redundant Knowledgecited by 3
- 2026Rethinking Data Curation in LLM Training: Online Reweighting Offers Better Generalization than Offline Methodscited by 3
- 2026Context Distillation as Latent Memory Managementcited by 3
50 most cited of 54 All 54 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches
- 2026KV Cache Offloading for Context-Intensive Tasks
- 2025Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scores
- 2026C2KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference
- 2026KV2: A Self-Refining KV Cache
- 2026PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
- 2024ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression
- 2024RazorAttention: Efficient KV Cache Compression Through Retrieval Heads