# Archer: Adaptive Reuse of Cached Hidden States for Efficient Rollback in Diffusion Language Models

arXiv: https://arxiv.org/abs/2608.08086 · HTML: https://mlsanity.com/paper/2608.08086/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Placed in Discrete and text diffusion, one of 14 directions in Diffusion models.
- Builds on 17 of its 23 references that are in the map.
- First posted on arXiv 8 Aug 2026.

## Placed in

- Diffusion models / [Discrete and text diffusion](https://mlsanity.com/diffusion/discrete-and-text-diffusion/)

## Builds on (most cited first, 17 of 17)

- [Evaluating Large Language Models Trained on Code](https://mlsanity.com/paper/2107.03374/) (2021)
- [Efficient Memory Management for Large Language Model Serving with PagedAttention](https://mlsanity.com/paper/2309.06180/) (2023)
- [Measuring Mathematical Problem Solving With the MATH Dataset](https://mlsanity.com/paper/2103.03874/) (2021)
- [Program Synthesis with Large Language Models](https://mlsanity.com/paper/2108.07732/) (2021)
- [LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code](https://mlsanity.com/paper/2403.07974/) (2024)
- [Structured Denoising Diffusion Models in Discrete State-Spaces](https://mlsanity.com/paper/2107.03006/) (2021)
- [PubMedQA: A Dataset for Biomedical Research Question Answering](https://mlsanity.com/paper/1909.06146/) (2019)
- [Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution](https://mlsanity.com/paper/2310.16834/) (2023)
- [FinQA: A Dataset of Numerical Reasoning over Financial Data](https://mlsanity.com/paper/2109.00122/) (2021)
- [Efficiently Scaling Transformer Inference](https://mlsanity.com/paper/2211.05102/) (2022)
- [Prompt Cache: Modular Attention Reuse for Low-Latency Inference](https://mlsanity.com/paper/2311.04934/) (2023)
- [Remasking Discrete Diffusion Models with Inference-Time Scaling](https://mlsanity.com/paper/2503.00307/) (2025)
- [DiffuCoder: Understanding and Improving Masked Diffusion Models for Code Generation](https://mlsanity.com/paper/2506.20639/) (2025)
- [Accelerated Sampling from Masked Diffusion Models via Entropy Bounded Unmasking](https://mlsanity.com/paper/2505.24857/) (2025)
- [CodeScore: Evaluating Code Generation by Learning Code Execution](https://mlsanity.com/paper/2301.09043/) (2023)
- [Don't Settle Too Early: Self-Reflective Remasking for Diffusion Language Models](https://mlsanity.com/paper/2509.23653/) (2025)
- [Promises and Pitfalls of Generative Masked Language Modeling: Theoretical Framework and Practical Guidelines](https://mlsanity.com/paper/2407.21046/) (2024)

## Abstract (arXiv)

Diffusion language models (DLMs) can revise earlier predictions as context evolves, but rollback requires costly full-sequence recomputation. Conventional key-value (KV) caching assumes immutable historical states and is difficult to reconcile with such revision. We introduce Adaptive Reuse of Cached Hidden States for Efficient Rollback (Archer), a training-free caching method for rollback-capable DLMs. Archer recomputes the mutable response at every update while reusing prompt K/V within a bounded response-state neighborhood. This asymmetric boundary amortizes prompt computation without restricting rollback. Bounded reuse also delays feedback from tentative tokens while keeping response revision active. Our analysis characterizes the cache boundary, bounds state-dependent approximation error, and gives a decoder-margin condition for preserving full-refresh decisions. On code-generation benchmarks, Archer achieves the best mean performance of 33.63% with a 2.57x mean speedup, reaching 2.95x speedup on a single benchmark. On non-code benchmarks, Archer achieves up to 4.33x speedup over LLaDA-Confidence while improving average accuracy. Controlled analyses support the delayed prompt feedback mechanism. Our code is available at https://github.com/Hxnng/Archer
