Dynamic Vocabulary Pruning in Early-Exit LLMs
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Increasing the size of large language models (LLMs) has been shown to lead to better performance. However, this comes at the cost of slower and more expensive inference. Early-exiting is a promising approach for improving the efficiency of LLM inference by enabling next token prediction at intermediate layers. Yet, the large vocabulary size in modern LLMs makes the confidence estimation required for exit decisions computationally expensive, diminishing the efficiency gains. To address this, we propose dynamically pruning the vocabulary at test time for each token. Specifically, the vocabulary is pruned at one of the initial layers, and the smaller vocabulary is then used throughout the rest of the forward pass. Our experiments demonstrate that such post-hoc dynamic vocabulary pruning improves the efficiency of confidence estimation in early-exit LLMs while maintaining competitive performance.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 18 of its 21 references that are in the map. First posted on arXiv 24 Oct 2024.
Builds on
18 of 21 references.
Closest ancestors · 3
Same direction, newest first
- 2024Fast yet Safe: Early-Exiting with Risk Control31 May
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding25 Apr
- 2023Towards Anytime Classification in Early-Exit Architectures by Enforcing Conditional Monotonicity5 Jun
Other references · 15
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 530
- 2019Depth-Adaptive Transformercited by 227
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2022Will we run out of data? Limits of LLM scaling based on human-generated datacited by 187
- 2024Scaling Laws with Vocabulary: Larger Models Deserve Larger Vocabulariescited by 113
- 2024A Survey of Resource-efficient LLM and Multimodal Foundation Modelscited by 84
- 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decodingcited by 80
3 more
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025CARVQ: Corrective Adaptor with Group Residual Vector Quantization for LLM Embedding Compressioncited by 3
- 2026The Shape of Overthinking: Backtracking Bursts in Long Reasoning Tracescited by 2
- 2026Optimizing Korean-Centric LLMs via Token Pruningcited by 1
- 2026NanoSpec: Accelerating Speculative Decoding using Minimalist In-Context Vocabulariescited by 1
- 2026The Shape of Overthinking: Backtracking Bursts in Long Reasoning Traces27 May 2026
- 2026Optimizing Korean-Centric LLMs via Token Pruning17 Apr 2026
- 2026NanoSpec: Accelerating Speculative Decoding using Minimalist In-Context Vocabularies8 Apr 2026
- 2025CARVQ: Corrective Adaptor with Group Residual Vector Quantization for LLM Embedding Compression14 Oct 2025
Similar, not cited
Close in wording, no citation either way
- 2024An Efficient Inference Framework for Early-exit Large Language Models
- 2026The Diminishing Returns of Early-Exit Decoding in Modern LLMs
- 2025Pruning Laws for Large Language Models
- 2024LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inference
- 2025SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruning
- 2024How Can We Effectively Expand the Vocabulary of LLMs with 0.01GB of Target Language Text?
- 2023EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism
- 2025QuickSilver -- Speeding up LLM Inference through Dynamic Token Halting, KV Skipping, Contextual Token Fusion, and Adaptive Matryoshka Quantization