English

Training Language Models with homotokens Leads to Delayed Overfitting

Computation and Language 2026-01-14 v2

Abstract

Subword tokenization introduces a computational layer in language models where many distinct token sequences decode to the same surface form and preserve meaning, yet induce different internal computations. Despite this non-uniqueness, language models are typically trained using a single canonical longest-prefix tokenization. We formalize homotokens-alternative valid subword segmentations of the same lexical item-as a strictly meaning-preserving form of data augmentation. We introduce a lightweight training architecture that conditions canonical next-token prediction on sampled homotoken variants via an auxiliary causal encoder and block-causal cross-attention, without modifying the training objective or token interface. In data-constrained pretraining, homotoken augmentation consistently delays overfitting under repeated data exposure and improves generalization across diverse evaluation datasets. In multilingual fine-tuning, we find that the effectiveness of homotokens depends on tokenizer quality: gains are strongest when canonical tokens are highly compressed and diminish when the tokenizer already over-fragments the input. Overall, homotokens provide a simple and modular mechanism for inducing tokenization invariance in language models.

Keywords

Cite

@article{arxiv.2601.02867,
  title  = {Training Language Models with homotokens Leads to Delayed Overfitting},
  author = {Adrian Cosma and Stefan Ruseti and Emilian Radoi and Mihai Dascalu},
  journal= {arXiv preprint arXiv:2601.02867},
  year   = {2026}
}

Comments

8 pages, 6 figures, 3 Appendices

R2 v1 2026-07-01T08:52:21.940Z