Inference-Time Hyper-Scaling with KV Cache Compression
On the map: LLM reasoning → Test-time compute and efficient thinking
also in 1 more
Abstract (arXiv)
Inference-time scaling trades efficiency for increased reasoning accuracy by generating longer or more parallel sequences. However, in Transformer LLMs, generation cost is bottlenecked by the size of the key-value (KV) cache, rather than the number of generated tokens. Hence, we explore inference-time hyper-scaling: by compressing the KV cache, we can generate more tokens within the same compute budget and further improve the accuracy of scaled inference. The success of this approach, however, hinges on the ability of compression methods to preserve accuracy even at high compression ratios. To make hyper-scaling practical, we introduce Dynamic Memory Sparsification (DMS), a novel method for sparsifying KV caches that only requires 1K training steps to achieve 8× compression, while maintaining better accuracy than training-free sparse attention. Instead of prematurely discarding cached tokens, DMS delays token eviction, implicitly merging representations and preserving critical information. We demonstrate the effectiveness of inference-time hyper-scaling with DMS on multiple families of LLMs, showing that it boosts accuracy for comparable inference latency and memory load. For instance, we enhance Qwen-R1 32B by 12.0 points on AIME 24, 8.6 on GPQA, and 9.7 on LiveCodeBench on average for an equivalent number of memory reads.
Key facts. Cited by 27 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 47 of its 60 references that are in the map. First posted on arXiv 5 Jun 2025.
Builds on
47 of 60 references.
Closest ancestors · 6
Same direction, newest first
- 2025Rethinking Inference-Time Scaling: Efficiency Limits and Linguistic Signals18 Apr
- 2024Improving LLM Reasoning through Scaling Inference Computation with Collaborative Verification5 Oct
- 2024Eigen Attention: Attention in Low-Rank Space for KV Cache Compression10 Aug
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
- 2023Alphazero-like Tree-Search can Guide Large Language Model Decoding and Training29 Sep
- 2023Self-Refine: Iterative Refinement with Self-Feedback30 Mar
Other references · 41
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2023Let's Verify Step by Stepcited by 3,789
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
29 more
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,784
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
- 2022Solving math word problems with process- and outcome-based feedbackcited by 901
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 591
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
- 2024From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipelinecited by 500
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 407
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
- 2019Analysing Mathematical Reasoning Abilities of Neural Modelscited by 335
- 2023Landmark Attention: Random-Access Infinite Context Length for Transformerscited by 213
- 2024Flex Attention: A Programming Model for Generating Optimized Attention Kernelscited by 185
- 2024Dynamic Memory Compression: Retrofitting LLMs for Accelerated Inferencecited by 116
- 2024Transformers need glasses! Information over-squashing in language taskscited by 91
- 2025The Hidden Risks of Large Reasoning Models: A Safety Assessment of R1cited by 91
- 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategycited by 51
- 2025The Sparse Frontier: Sparse Attention Trade-offs in Transformer LLMscited by 29
- 2024FlashMask: Efficient and Rich Mask Extension of FlashAttentioncited by 20
Built on by
Citing papers per year: 2025: 9; 2026: 18.
27 papers.
Sort:
By area:
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distributioncited by 74
- 2026Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Evictioncited by 16
- 2026KVzap: Fast, Adaptive, and Faithful KV Cache Pruningcited by 15
- 2025The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoningcited by 13
- 2025KV Cache Transform Coding for Compact Storage in LLM Inferencecited by 13
- 2025BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholdingcited by 13
- 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuitscited by 9
- 2025Bolmo: Byteifying the Next Generation of Language Modelscited by 9
- 2026Position: Modular Memory is the Key to Continual Learning Agentscited by 8
- 2026Accordion-Thinking: Self-Regulated Step Summaries for Efficient and Readable LLM Reasoningcited by 6
- 2026Cartridges at Scale: Training Modular KV Caches over Large Document Collectionscited by 6
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inferencecited by 4
15 more
- 2026DashAttention: Differentiable and Adaptive Sparse Hierarchical Attentioncited by 4
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Evictioncited by 3
- 2025AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decodingcited by 2
- 2026Neural Garbage Collection: Learning to Forget while Learning to Reasoncited by 2
- 2026Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utilitycited by 2
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compressioncited by 2
- 2026Echo: KV-Cache-Free Associative Recall with Spectral Koopman Operatorscited by 1
- 2026Linear Scaling Video VLMs for Long Video Understandingcited by 1
- 2026KVDiagnosis: A Diagnostic Benchmark for KV-Cache Compression in Long-Context Language Modelscited by 1
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstructioncited by 1
- 2026Behavior-Preserving KV Cache Compressioncited by 1
- 2026KVSlimmer: Theoretical Insights and Practical Optimizations for Asymmetric KV Mergingcited by 0
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inferencecited by 0
- 2026Diffusion-Guided Uncertainty-Aware Delayed Policy Optimizationcited by 0
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attentioncited by 0
- 2026Behavior-Preserving KV Cache Compression5 Oct 2026
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstruction30 Sep 2026
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attention20 Aug 2026
- 2026KVDiagnosis: A Diagnostic Benchmark for KV-Cache Compression in Long-Context Language Models10 Aug 2026
- 2026Diffusion-Guided Uncertainty-Aware Delayed Policy Optimization6 Jul 2026
- 2026Cartridges at Scale: Training Modular KV Caches over Large Document Collections3 Jun 2026
- 2026Linear Scaling Video VLMs for Long Video Understanding29 May 2026
- 2026DashAttention: Differentiable and Adaptive Sparse Hierarchical Attention18 May 2026
- 2026Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utility13 May 2026
- 2026Echo: KV-Cache-Free Associative Recall with Spectral Koopman Operators7 May 2026
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compression1 May 2026
- 2026Neural Garbage Collection: Learning to Forget while Learning to Reason20 Apr 2026
15 more
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inference8 Apr 2026
- 2026Position: Modular Memory is the Key to Continual Learning Agents2 Mar 2026
- 2026KVSlimmer: Theoretical Insights and Practical Optimizations for Asymmetric KV Merging1 Mar 2026
- 2026Accordion-Thinking: Self-Regulated Step Summaries for Efficient and Readable LLM Reasoning3 Feb 2026
- 2026Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Eviction25 Jan 2026
- 2026KVzap: Fast, Adaptive, and Faithful KV Cache Pruning12 Jan 2026
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inference19 Dec 2025
- 2025Bolmo: Byteifying the Next Generation of Language Models17 Dec 2025
- 2025BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding12 Dec 2025
- 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuits14 Nov 2025
- 2025KV Cache Transform Coding for Compact Storage in LLM Inference3 Nov 2025
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Eviction23 Oct 2025
- 2025AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decoding8 Oct 2025
- 2025The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning8 Oct 2025
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution1 Oct 2025
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distributioncited by 74
- 2026Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Evictioncited by 16
- 2026KVzap: Fast, Adaptive, and Faithful KV Cache Pruningcited by 15
- 2025KV Cache Transform Coding for Compact Storage in LLM Inferencecited by 13
- 2026Cartridges at Scale: Training Modular KV Caches over Large Document Collectionscited by 6
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Evictioncited by 3
- 2026KVDiagnosis: A Diagnostic Benchmark for KV-Cache Compression in Long-Context Language Modelscited by 1
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstructioncited by 1
- 2026Behavior-Preserving KV Cache Compressioncited by 1
- 2026Behavior-Preserving KV Cache Compression5 Oct 2026
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstruction30 Sep 2026
- 2026KVDiagnosis: A Diagnostic Benchmark for KV-Cache Compression in Long-Context Language Models10 Aug 2026
- 2026Cartridges at Scale: Training Modular KV Caches over Large Document Collections3 Jun 2026
- 2026Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Eviction25 Jan 2026
- 2026KVzap: Fast, Adaptive, and Faithful KV Cache Pruning12 Jan 2026
- 2025KV Cache Transform Coding for Compact Storage in LLM Inference3 Nov 2025
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Eviction23 Oct 2025
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution1 Oct 2025
- 2025The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoningcited by 13
- 2026Position: Modular Memory is the Key to Continual Learning Agentscited by 8
- 2026Accordion-Thinking: Self-Regulated Step Summaries for Efficient and Readable LLM Reasoningcited by 6
- 2025AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decodingcited by 2
- 2026Neural Garbage Collection: Learning to Forget while Learning to Reasoncited by 2
- 2026Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utilitycited by 2
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compressioncited by 2
- 2026Echo: KV-Cache-Free Associative Recall with Spectral Koopman Operatorscited by 1
- 2026Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utility13 May 2026
- 2026Echo: KV-Cache-Free Associative Recall with Spectral Koopman Operators7 May 2026
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compression1 May 2026
- 2026Neural Garbage Collection: Learning to Forget while Learning to Reason20 Apr 2026
- 2026Position: Modular Memory is the Key to Continual Learning Agents2 Mar 2026
- 2026Accordion-Thinking: Self-Regulated Step Summaries for Efficient and Readable LLM Reasoning3 Feb 2026
- 2025AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decoding8 Oct 2025
- 2025The Markovian Thinker: Architecture-Agnostic Linear Scaling of Reasoning8 Oct 2025
- 2026Linear Scaling Video VLMs for Long Video Understandingcited by 1
- 2026Linear Scaling Video VLMs for Long Video Understanding29 May 2026
- 2025BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholdingcited by 13
- 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuitscited by 9
- 2025Bolmo: Byteifying the Next Generation of Language Modelscited by 9
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inferencecited by 4
- 2026DashAttention: Differentiable and Adaptive Sparse Hierarchical Attentioncited by 4
- 2026KVSlimmer: Theoretical Insights and Practical Optimizations for Asymmetric KV Mergingcited by 0
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inferencecited by 0
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attentioncited by 0
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attention20 Aug 2026
- 2026DashAttention: Differentiable and Adaptive Sparse Hierarchical Attention18 May 2026
- 2026Flux Attention: Context-Aware Hybrid Attention for Efficient LLMs Inference8 Apr 2026
- 2026KVSlimmer: Theoretical Insights and Practical Optimizations for Asymmetric KV Merging1 Mar 2026
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inference19 Dec 2025
- 2025Bolmo: Byteifying the Next Generation of Language Models17 Dec 2025
- 2025BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding12 Dec 2025
- 2025Fast and Expressive Multi-Byte Prediction with Probabilistic Circuits14 Nov 2025
Similar, not cited
Close in wording, no citation either way
- 2026KV Cache Optimization Strategies for Scalable and Efficient LLM Inference
- 2025Lethe: Layer- and Time-Adaptive KV Cache Pruning for Reasoning-Intensive LLM Serving
- 2026MetaKV: Adaptive KV Cache Compression for Constrained LLM Inference
- 2024RefreshKV: Updating Small KV Cache During Long-form Generation
- 2024Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference
- 2025KV Cache Compression for Inference Efficiency in LLMs: A Review
- 2025R-KV: Redundancy-aware KV Cache Compression for Reasoning Models
- 2026C2KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference