mlsanityData to 14 Oct 2026

SpeLLM: Character-Level Multi-Head Decoding

arXiv 2507.16323 ↗First posted 22 Jul 2025cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

Scaling LLM vocabulary is often used to reduce input sequence length and alleviate attention's quadratic cost. Yet, current LLM architectures impose a critical bottleneck to this procedure: the output projection layer scales linearly with vocabulary size, rendering substantial expansion impractical. We propose SpeLLM, a method that decouples input and output vocabularies by predicting character-level strings through multiple output heads. In SpeLLM, each of the k linear heads predicts a single character simultaneously, enabling the model to represent a much larger output space using smaller, independent linear heads. We present a self-distillation approach for converting a standard LLM to a SpeLLM. Our experiments with four pre-trained LLMs show their SpeLLM variants achieve competitive performance on downstream tasks while reducing runtime by 5.1% on average across models. Our approach provides a potential avenue for reducing LLM costs, while increasing support for underrepresented languages and domains.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 27 of its 30 references that are in the map. First posted on arXiv 22 Jul 2025.

Builds on

27 of 30 references.

References · 27

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  5. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  6. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
  7. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
  8. 2015Teaching Machines to Read and Comprehendcited by 1,049
  9. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 843
  10. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
  11. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
  12. 2021CANINE: Pre-training an Efficient Tokenization-Free Encoder for Language Representationcited by 232
15 more
  1. 2023Language Model Tokenizers Introduce Unfairness Between Languagescited by 214
  2. 2023Do All Languages Cost the Same? Tokenization in the Era of Commercial Language Modelscited by 192
  3. 2023MEGABYTE: Predicting Million-byte Sequences with Multiscale Transformerscited by 170
  4. 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 146
  5. 2016Efficient softmax approximation for GPUscited by 67
  6. 2021Softermax: Hardware/Software Co-Design of an Efficient Softmax for Transformerscited by 54
  7. 2020Improving Multilingual Models with Language-Clustered Vocabulariescited by 53
  8. 2024Fast Vocabulary Transfer for Language Model Compressioncited by 42
  9. 2022What do tokens know about their characters and how do they know it?cited by 36
  10. 2021Models In a Spelling Bee: Language Models Implicitly Learn the Character Composition of Tokenscited by 27
  11. 2025FR-Spec: Accelerating Large-Vocabulary Language Models via Frequency-Ranked Speculative Samplingcited by 20
  12. 2024T-FREE: Subword Tokenizer-Free Generative LLMs via Sparse Representations for Memory-Efficient Embeddingscited by 10
  13. 2023Headless Language Models: Learning without Predicting with Contrastive Weight Tyingcited by 5
  14. 2023Vocabulary-level Memory Efficiency for Language Model Fine-tuningcited by 2
  15. 2024LLM Vocabulary Compression for Low-Compute Environmentscited by 1

Built on by

Cited by year (2026 to 14 Oct)

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

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Beyond Tokens: A Survey on Decoding Methods for Large Language and Vision-Language Models
  2. 2024A Thorough Examination of Decoding Methods in the Era of LLMs
  3. 2025Direct Multi-Token Decoding
  4. 2024Decoding at the Speed of Thought: Harnessing Parallel Decoding of Lexical Units for LLMs
  5. 2024Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized Drafters
  6. 2025VOCABTRIM: Vocabulary Pruning for Efficient Speculative Decoding in LLMs
  7. 2026LycheeDecode: Accelerating Long-Context LLM Inference via Hybrid-Head Sparse Decoding
  8. 2026Hidden Decoding at Scale: Latent Computation Scaling for Large Language Models