

















Abstract:Scaling laws enable the optimal selection of data amount and language model size, yet the impact of the data unit, the token, on this relationship remains underexplored. In this work, we systematically investigate how the information granularity of tokens, controlled by the compression rate (i.e., average bytes of text per token), affects scaling trends. We train 988 latent tokenized models (BLT) ranging from 50M to 7B parameters that enable setting the desired compression rate. This flexibility allows us to study the role of compression rate well beyond 4.57 bytes per token obtained with a popular BPE tokenizer. Our experiments reveal that in compute-optimal configurations, model parameter counts scale proportionally to data size measured in bytes, not in tokens as commonly perceived (Kaplan et al., 2020; Hoffmann et al., 2022). Furthermore, we discover that the optimal compression rate differs from the one obtained with BPE and decreases with compute. These findings generalize to both latent and subword tokenization, as well as to languages other than English, guiding language model developers on tokenization scheme selection for maximal compute efficiency.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2605.01188 [cs.CL] |
| (or arXiv:2605.01188v2 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2605.01188 arXiv-issued DOI via DataCite |
From: Tomasz Limisiewicz PhD [view email]
[v1]
Sat, 2 May 2026 01:53:22 UTC (8,347 KB)
[v2]
Tue, 26 May 2026 17:52:49 UTC (8,347 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。