mlsanityData to 14 Oct 2026

ReplaySSM: Cache SSM Inputs, Not State

arXiv 2610.13778 ↗First posted 9 Oct 2026cs.LG cs.AIcited by 2

On the map: Efficient LLM inference and serving → Speculative decoding also fits: Serving systems and request scheduling

Abstract (arXiv)

State-space models (SSMs) maintain a fixed-size recurrent state, but reading and writing it at every decoding step can bottleneck hybrid models. This eager state management causes large state I/O with low arithmetic intensity, leaves speculative decoding no cheap rollback, and feeds state quantization error into subsequent recurrent updates. We introduce ReplaySSM, which unrolls the recurrence to represent the state as a checkpoint and a buffer of recent SSM inputs. This separates output computation from checkpoint updates. By updating the checkpoint periodically, ReplaySSM avoids state writes on most steps and roughly halves the dominant state memory traffic. Keeping recent inputs also makes speculative rollback a buffer-pointer operation and enables output-only verification without materializing intermediate states. The same separation allows a low-precision checkpoint to serve output computation on most steps while a higher-precision checkpoint serves recurrent updates, so rounding error in the low-precision copy never enters later updates. We implement ReplaySSM in vLLM for Mamba-2 and Gated DeltaNet. At serving batch size 256, it accelerates standard decoding by 1.20--1.47× over a tuned vLLM baseline across four hybrid models, and delivers about 1.8× the throughput of vLLM's speculative decoding on the two 120B-class models. Separate state precisions also reduce output KL divergence and downstream accuracy losses compared with a shared low-precision checkpoint.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 24 of its 34 references that are in the map. First posted on arXiv 9 Oct 2026.

Builds on

24 of 34 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025STree: Speculative Tree Decoding for Hybrid State-Space Models20 May
  2. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 22

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  4. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  5. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  6. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  7. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,848
  8. 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
  9. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  10. 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
  11. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
  12. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
10 more
  1. 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 396
  2. 2015Deep Learning with Limited Numerical Precisioncited by 376
  3. 2024Repeat After Me: Transformers are Better than State Space Models at Copyingcited by 216
  4. 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 196
  5. 2024An Empirical Study of Mamba-based Language Modelscited by 186
  6. 2026Kimi K3: Open Frontier Intelligencecited by 138
  7. 2024The Mamba in the Llama: Distilling and Accelerating Hybrid Modelscited by 122
  8. 2025NVIDIA Nemotron 3: Efficient and Open Intelligencecited by 65
  9. 2026Nemotron 3 Ultra: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoningcited by 42
  10. 2024Marconi: Prefix Caching for the Era of Hybrid LLMscited by 31

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Compiler-First State Space Duality and Portable O(1) Autoregressive Caching for Inference
  2. 2026GhostServe: A Lightweight Checkpointing System in the Shadow for Fault-Tolerant LLM Serving
  3. 2026Low-Discrepancy Dither for Quantized Recurrent State Caches
  4. 2026Validating Hybrid-State Cache Recovery for GLM-5.3-Flash with vLLM and LMCache
  5. 2026Stage-Replay Divergence Follows the KV Cache: Fixed-Prefix Precision Controls and Bidirectional Cache Transplantation
  6. 2025Stateful KV Cache Management for LLMs: Balancing Space, Time, Accuracy, and Positional Fidelity
  7. 2024SMR: State Memory Replay for Long Sequence Modeling
  8. 2024Fast State Restoration in LLM Serving with HCache