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

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 (D 3 ), which leverages a power-law decay function, L ( i ) , to determine the number of layers to retain when generating token T i .Remarkably, without any retraining, the D 3 achieves success across a wide range of generation tasks for the first time.Experiments on large language models (i.e., the Llama) with 7 70 billion parameters show that D 3 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.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.154
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Han Peng, Yequan Wang, Xingrun Xing, Siqi Fan et al.
Algorithms and Data Compression
article

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

Han Peng, Yequan Wang, Xingrun Xing, Siqi Fan, Shuo Shang, Xuezhi Fang
article en

Abstract

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 (D 3 ), which leverages a power-law decay function, L ( i ) , to determine the number of layers to retain when generating token T i .Remarkably, without any retraining, the D 3 achieves success across a wide range of generation tasks for the first time.Experiments on large language models (i.e., the Llama) with 7 70 billion parameters show that D 3 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.

National Science Foundation, National Natural Science Foundation of China, National Science and Technology Major Project
Openalex Percentile: Top 90%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.