Accelerating Inference in Large Language Models with a Unified Layer Skipping Strategy
Not on the map. Why?
Abstract (arXiv)
Recently, dynamic computation methods have shown notable acceleration for Large Language Models (LLMs) by skipping several layers of computations through elaborate heuristics or additional predictors. However, in the decoding process of existing approaches, different samples are assigned different computational budgets, which cannot guarantee a stable and precise acceleration effect. Furthermore, existing approaches generally skip multiple contiguous layers at the bottom or top of the layers, leading to a drastic change in the model's layer-wise representations, and thus a consequent performance degeneration. Therefore, we propose a Unified Layer Skipping strategy, which selects the number of layers to skip computation based solely on the target speedup ratio, and then skips the corresponding number of intermediate layer computations in a balanced manner. Since the Unified Layer Skipping strategy is independent of input samples, it naturally supports popular acceleration techniques such as batch decoding and KV caching, thus demonstrating more practicality for real-world applications. Experimental results on two common tasks, i.e., machine translation and text summarization, indicate that given a target speedup ratio, the Unified Layer Skipping strategy significantly enhances both the inference performance and the actual model throughput over existing dynamic approaches.
Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 24 of its 49 references that are in the map. First posted on arXiv 10 Apr 2024.
Builds on
24 of 49 references.
References · 24
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,674
- 2022InstructPix2Pix: Learning to Follow Image Editing Instructionscited by 2,591
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2018Universal Transformerscited by 613
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2022Using Large Language Models to Simulate Multiple Humans and Replicate Human Subject Studiescited by 506
12 more
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2023Is ChatGPT a Good NLG Evaluator? A Preliminary Studycited by 420
- 2019Q8BERT: Quantized 8Bit BERTcited by 296
- 2019Depth-Adaptive Transformercited by 227
- 2020ProphetNet: Predicting Future N-gram for Sequence-to-Sequence Pre-trainingcited by 221
- 2016Spatially Adaptive Computation Time for Residual Networkscited by 118
- 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
- 2023DiffuSum: Generation Enhanced Extractive Summarization with Diffusioncited by 25
- 2021Anytime Dense Prediction with Confidence Adaptivitycited by 18
- 2019Synchronous Bidirectional Inference for Neural Sequence Generationcited by 10
- 2017Probabilistic Adaptive Computation Timecited by 4
Built on by
Citing papers per year: 2024: 6; 2025: 6; 2026: 5.
17 papers.
Sort:
By area:
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Accelerationcited by 69
- 2024Understanding Layer Significance in LLM Alignmentcited by 19
- 2025AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inferencecited by 12
- 2024Mixture-of-Modules: Reinventing Transformers as Dynamic Assemblies of Modulescited by 11
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimizationcited by 10
- 2024Dynamic layer selection in decoder-only transformerscited by 3
- 2025DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policiescited by 3
- 2025ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Modelscited by 3
- 2025IG-Pruning: Input-Guided Block Pruning for Large Language Modelscited by 2
- 2024FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reductioncited by 0
- 2024Distributed Collaborative Inference System in Next-Generation Networks and Communicationcited by 0
- 2025LiteStage: Latency-aware Layer Skipping for Multi-stage Reasoningcited by 0
5 more
- 2026TIDE: Token-Informed Depth Execution for Per-Token Early Exit in LLM Inferencecited by 0
- 2026Experience-Driven Dynamic Exits for LLMs with Reinforcement Learningcited by 0
- 2026CausalGate: Causal Importance Distillation for Transformer Module Pruningcited by 0
- 2026Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inferencecited by 0
- 2026vSkipper: Translating Dynamic Layer Skipping into LLM Serving Gainscited by 0
- 2026vSkipper: Translating Dynamic Layer Skipping into LLM Serving Gains29 Sep 2026
- 2026Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inference8 Sep 2026
- 2026CausalGate: Causal Importance Distillation for Transformer Module Pruning21 Jul 2026
- 2026Experience-Driven Dynamic Exits for LLMs with Reinforcement Learning2 Jun 2026
- 2026TIDE: Token-Informed Depth Execution for Per-Token Early Exit in LLM Inference22 Mar 2026
- 2025IG-Pruning: Input-Guided Block Pruning for Large Language Models4 Nov 2025
- 2025LiteStage: Latency-aware Layer Skipping for Multi-stage Reasoning16 Oct 2025
- 2025ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Models25 Aug 2025
- 2025DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies23 May 2025
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization22 May 2025
- 2025AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference4 Jan 2025
- 2024Distributed Collaborative Inference System in Next-Generation Networks and Communication16 Nov 2024
5 more
- 2024Dynamic layer selection in decoder-only transformers26 Oct 2024
- 2024Understanding Layer Significance in LLM Alignment23 Oct 2024
- 2024FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reduction16 Oct 2024
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct 2024
- 2024Mixture-of-Modules: Reinventing Transformers as Dynamic Assemblies of Modules9 Jul 2024
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Accelerationcited by 69
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimizationcited by 10
- 2024Dynamic layer selection in decoder-only transformerscited by 3
- 2025DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policiescited by 3
- 2025ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Modelscited by 3
- 2026TIDE: Token-Informed Depth Execution for Per-Token Early Exit in LLM Inferencecited by 0
- 2026Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inferencecited by 0
- 2026vSkipper: Translating Dynamic Layer Skipping into LLM Serving Gainscited by 0
- 2026vSkipper: Translating Dynamic Layer Skipping into LLM Serving Gains29 Sep 2026
- 2026Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inference8 Sep 2026
- 2026TIDE: Token-Informed Depth Execution for Per-Token Early Exit in LLM Inference22 Mar 2026
- 2025ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Models25 Aug 2025
- 2025DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies23 May 2025
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization22 May 2025
- 2024Dynamic layer selection in decoder-only transformers26 Oct 2024
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct 2024
- 2024Understanding Layer Significance in LLM Alignmentcited by 19
- 2024Understanding Layer Significance in LLM Alignment23 Oct 2024
- 2025AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inferencecited by 12
- 2024Mixture-of-Modules: Reinventing Transformers as Dynamic Assemblies of Modulescited by 11
- 2025IG-Pruning: Input-Guided Block Pruning for Large Language Modelscited by 2
- 2024FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reductioncited by 0
- 2024Distributed Collaborative Inference System in Next-Generation Networks and Communicationcited by 0
- 2026Experience-Driven Dynamic Exits for LLMs with Reinforcement Learningcited by 0
- 2026CausalGate: Causal Importance Distillation for Transformer Module Pruningcited by 0
- 2026CausalGate: Causal Importance Distillation for Transformer Module Pruning21 Jul 2026
- 2026Experience-Driven Dynamic Exits for LLMs with Reinforcement Learning2 Jun 2026
- 2025IG-Pruning: Input-Guided Block Pruning for Large Language Models4 Nov 2025
- 2025AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference4 Jan 2025
- 2024Distributed Collaborative Inference System in Next-Generation Networks and Communication16 Nov 2024
- 2024FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reduction16 Oct 2024
- 2024Mixture-of-Modules: Reinventing Transformers as Dynamic Assemblies of Modules9 Jul 2024