mlsanityData to 14 Oct 2026

SupraTok: Cross-Boundary Tokenization for Enhanced Language Model Performance

arXiv 2508.11857 ↗First posted 16 Aug 2025cs.CL cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Tokenization remains a persistent bottleneck in language modeling, especially when vocabulary learning is limited by whitespace boundaries. We present SupraTok, a tokenizer that crosses whitespace boundaries using three modular components: optional entropy-based data curation, staged curriculum training with PMI-guided candidate search, and multilingual script handling. At 100k vocabulary on the same unfiltered training data, SupraTok improves compression over standard BPE by 17.5% and over the official SuperBPE implementation by 1.8%, while training 2.1x faster than SuperBPE. Across 50k-300k vocabularies in the same matched setting, SupraTok remains ahead of SuperBPE by 1.8%-8.6%. We evaluate entropy filtering separately as a pipeline step: at 100k vocabulary it raises SupraTok from 5.78 to 5.99 C/T, while matched controls show a smaller gain for SuperBPE and almost no change for SP-BPE-CrossBoundary. On FLORES-200 across 14 languages, SupraTok yields a macro-averaged 34.9% relative gain over the BPE baseline. In separate downstream experiments with matched compute and fixed token budgets, using 12L-768d and 24L-1024d GPT-2-style backbones with 256k vocabularies, SupraTok improves HellaSwag and MMLU. Overall, these results show that crossing whitespace boundaries gives consistent compression gains under controlled public-data comparisons, while optional entropy filtering provides a separate pipeline benefit.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 16 Aug 2025.

Builds on

24 of 33 references.

References · 24

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2020Scaling Laws for Neural Language Modelscited by 6,586
  4. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  5. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  6. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
  7. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  8. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  9. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  10. 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,077
  11. 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 639
  12. 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
12 more
  1. 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
  2. 2020How Good is Your Tokenizer? On the Monolingual Performance of Multilingual Language Modelscited by 318
  3. 2021Curriculum Learning: A Surveycited by 259
  4. 2021CANINE: Pre-training an Efficient Tokenization-Free Encoder for Language Representationcited by 232
  5. 2019BPE-Dropout: Simple and Effective Subword Regularizationcited by 195
  6. 2024Nemotron-CC: Transforming Common Crawl into a Refined Long-Horizon Pretraining Datasetcited by 160
  7. 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 146
  8. 2024Scaling Laws with Vocabulary: Larger Models Deserve Larger Vocabulariescited by 118
  9. 2025SuperBPE: Space Travel for Language Modelscited by 63
  10. 2025Over-Tokenized Transformer: Vocabulary is Generally Worth Scalingcited by 44
  11. 2021Multi-view Subword Regularizationcited by 40
  12. 2025Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barriercited by 32

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.