DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Large language models (LLMs) have achieved remarkable performance across a wide range of NLP tasks. However, their substantial inference cost poses a major barrier to real-world deployment, especially in latency-sensitive scenarios. To address this challenge, we propose DASH, an adaptive layer-skipping framework that dynamically selects computation paths conditioned on input characteristics. We model the skipping process as a Markov Decision Process (MDP), enabling fine-grained token-level decisions based on intermediate representations. To mitigate potential performance degradation caused by skipping, we introduce a lightweight compensation mechanism that injects differential rewards into the decision process. Furthermore, we design an asynchronous execution strategy that overlaps layer computation with policy evaluation to minimize runtime overhead. Experiments on multiple LLM architectures and NLP benchmarks show that our method achieves significant inference acceleration while maintaining competitive task performance, outperforming existing methods.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 12 of its 16 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
12 of 16 references.
Closest ancestors · 1
Same direction, newest first
Other references · 11
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2024Not All Layers of LLMs Are Necessary During Inferencecited by 96
- 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
- 2024FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skippingcited by 23
- 2024Accelerating Inference in Large Language Models with a Unified Layer Skipping Strategycited by 17
- 2025AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inferencecited by 12
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Skip a Layer or Loop It? Learning Program-of-Layers in LLMs
- 2026End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inference
- 2024Dynamic layer selection in decoder-only transformers
- 2026Probe and Skip: Self-Predictive Token Skipping for Efficient Long-Context LLM Inference
- 2025QuickSilver -- Speeding up LLM Inference through Dynamic Token Halting, KV Skipping, Contextual Token Fusion, and Adaptive Matryoshka Quantization
- 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving
- 2026QTALE: Quantization-Robust Token-Adaptive Layer Execution for LLMs