mlsanityData to 14 Oct 2026

Position-Aware Depth Decay Decoding (D3): Boosting Large Language Model Inference Efficiency

arXiv 2503.08524 ↗First posted 11 Mar 2025cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

Due to the large number of parameters, the inference phase of Large Language Models (LLMs) is resource-intensive. Unlike traditional model compression, which needs retraining, recent dynamic computation methods show that not all components are required for inference, enabling a training-free pipeline. In this paper, we focus on the dynamic depth of LLM generation. A token-position aware layer skipping framework is proposed to save 1.5x times operations efficiently while maintaining performance. We first observed that tokens predicted later have lower perplexity and thus require less computation. Then, we propose a training-free algorithm called Position-Aware Depth Decay Decoding (D3), which leverages a power-law decay function, leftlfloor L × (αi) rightrfloor, to determine the number of layers to retain when generating token Ti. Remarkably, without any retraining, the D3 achieves success across a wide range of generation tasks for the first time. Experiments on large language models (ie the Llama) with 7 ~ 70 billion parameters show that D3 can achieve an average 1.5x speedup compared with the full-inference pipeline while maintaining comparable performance with nearly no performance drop (<1%) on the GSM8K and BBH benchmarks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 11 Mar 2025.

Builds on

25 of 32 references.

References · 25

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  5. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  6. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
  7. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  8. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  9. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
  10. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  11. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 1,006
  12. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
13 more
  1. 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
  2. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 332
  3. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  4. 2019Depth-Adaptive Transformercited by 236
  5. 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 226
  6. 2017Adaptive Neural Networks for Efficient Inferencecited by 163
  7. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
  8. 2021The Efficiency Misnomercited by 98
  9. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  10. 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
  11. 2020CascadeBERT: Accelerating Inference of Pre-trained Language Models via Calibrated Complete Models Cascadecited by 47
  12. 2021Accelerating BERT Inference for Sequence Labeling via Early-Exitcited by 29
  13. 2023Learning to Skip for Language Modelingcited by 19

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.