Slow-Fast Inference: Training-Free Inference Acceleration via Within-Sentence Support Stability
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Long-context autoregressive decoding remains expensive because each decoding step must repeatedly process a growing history. We observe a consistent pattern during decoding: within a sentence, and more generally within a short semantically coherent span, the dominant attention support often remains largely stable. Motivated by this observation, we propose Slow-Fast Inference (SFI), a training-free decoding framework that decouples generation into frequent low-cost fast steps and occasional dense-attention slow steps. Fast steps reuse a compact sparse memory for efficient decoding. Slow steps are triggered near semantic boundaries. At slow steps, the model revisits the broader context and uses the Selector to refresh the selected memory for subsequent fast steps. Across the evaluated context lengths, SFI delivers approximately 1.6×--14.4× higher decoding throughput while generally maintaining quality on par with the full-KV baseline across long-context and long-CoT settings. Because SFI is training-free and applies directly to existing checkpoints, it offers a practical path to reducing inference cost for contemporary autoregressive reasoning models in long-context, long-horizon, and agentic workloads.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 52 of its 55 references that are in the map. First posted on arXiv 12 Mar 2026.
Builds on
52 of 55 references.
References · 52
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2025Gemma 3 Technical Reportcited by 1,824
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
38 more
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 832
- 2025DeepSeek-V3.2: Pushing the Frontier of Open Large Language Modelscited by 815
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
- 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 634
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 591
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 474
- 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Timecited by 439
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 432
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 407
- 2024LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitaskscited by 379
- 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Headscited by 288
- 2024Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inferencecited by 235
- 2026MiMo-V2-Flash Technical Reportcited by 191
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2024SageAttention: Accurate 8-Bit Attention for Plug-and-play Inference Accelerationcited by 160
- 2024GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLMcited by 158
- 2024ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inferencecited by 134
- 2024Transformers are Multi-State RNNscited by 120
- 2024SageAttention2: Efficient Attention with Thorough Outlier Smoothing and Per-thread INT4 Quantizationcited by 114
- 2024MagicPIG: LSH Sampling for Efficient LLM Generationcited by 111
- 2024Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoningcited by 97
- 2024Loki: Low-rank Keys for Efficient Sparse Attentioncited by 89
- 2024A Simple and Effective L2 Norm-Based Strategy for KV Cache Compressioncited by 86
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distributioncited by 74
- 2024ThinK: Thinner Key Cache by Query-Driven Pruningcited by 68
- 2025ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inferencecited by 60
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategycited by 51
- 2024NACL: A General and Effective KV Cache Eviction Framework for LLMs at Inference Timecited by 43
- 2024DynamicKV: Task-Aware Adaptive KV Cache Compression for Long Context LLMscited by 42
- 2024TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attentioncited by 29
- 2024RefreshKV: Updating Small KV Cache During Long-form Generationcited by 11
- 2026HySparse: A Hybrid Sparse Attention Architecture with Oracle Token Selection and KV Cache Sharingcited by 10
- 2026OpenClaw AI Agents as Informal Learners at Moltbook: Characterizing an Emergent Learning Community at Scalecited by 8
- 2024Optimization Hyper-parameter Laws for Large Language Modelscited by 7
- 2025LagKV: Lag-Relative Information of the KV Cache Tells Which Tokens Are Importantcited by 7
- 2024LoCo: Low-Bit Communication Adaptor for Large-scale Model Trainingcited by 6
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
- 2025QuickSilver -- Speeding up LLM Inference through Dynamic Token Halting, KV Skipping, Contextual Token Fusion, and Adaptive Matryoshka Quantization
- 2026Deeper is Not Always Better: Mitigating the Alignment Tax via Confident Layer Decoding
- 2025A*-Decoding: Token-Efficient Inference Scaling
- 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
- 2026RACER: Retrieval-Augmented Contextual Rapid Speculative Decoding
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding
- 2026Shallow Prefill, Deep Decoding: Efficient Long-Context Inference via Layer-Asymmetric KV Visibility