LLM Vocabulary Compression for Low-Compute Environments
Not on the map. Why?
Abstract (arXiv)
We present a method to compress the final linear layer of language models, reducing memory usage by up to 3.4x without significant performance loss. By grouping tokens based on Byte Pair Encoding (BPE) merges, we prevent materialization of the memory-intensive logits tensor. Evaluations on the TinyStories dataset show that our method performs on par with GPT-Neo and GPT2 while significantly improving throughput by up to 3x, making it suitable for low-compute environments.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 9 references that are in the map. First posted on arXiv 10 Nov 2024.
Builds on
6 of 9 references.
References · 6
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 425
- 2018Adaptive Input Representations for Neural Language Modelingcited by 226
- 2016Exploring the Limits of Language Modelingcited by 172
- 2016Efficient softmax approximation for GPUscited by 67
- 2024The Compute Divide in Machine Learning: A Threat to Academic Contribution and Scrutiny?cited by 20
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025SpeLLM: Character-Level Multi-Head Decodingcited by 1
- 2025SpeLLM: Character-Level Multi-Head Decoding22 Jul 2025