ByteFlow: Language Modeling through Adaptive Byte Compression without a Tokenizer
Not on the map. Why?
Abstract (arXiv)
Modern language models still rely on fixed, pre-defined subword tokenizations. Once a tokenizer is trained, the LM can only operate at this fixed level of granularity, which often leads to brittle and counterintuitive behaviors even in otherwise strong reasoning models. We introduce ByteFlow Net, a new hierarchical architecture that removes tokenizers entirely and instead enables models to learn their own segmentation of raw byte streams into semantically meaningful units. ByteFlow Net performs compression-driven segmentation based on the coding rate of latent representations, yielding adaptive boundaries while preserving a static computation graph via Top-K selection. Unlike prior self-tokenizing methods that depend on brittle heuristics with human-designed inductive biases, ByteFlow Net adapts its internal representation granularity to the input itself. Experiments demonstrate that this compression-based chunking strategy yields substantial performance gains, with ByteFlow Net outperforming both BPE-based Transformers and previous byte-level architectures. These results suggest that end-to-end, tokenizer-free modeling is not only feasible but also more effective, opening a path toward more adaptive and information-grounded language models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 39 references that are in the map. First posted on arXiv 3 Mar 2026.
Builds on
30 of 39 references.
References · 30
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,973
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 504
- 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 490
- 2020How Good is Your Tokenizer? On the Monolingual Performance of Multilingual Language Modelscited by 313
18 more
- 2017Synthetic and Natural Noise Both Break Neural Machine Translationcited by 304
- 2023Language Model Tokenizers Introduce Unfairness Between Languagescited by 207
- 2023MEGABYTE: Predicting Million-byte Sequences with Multiscale Transformerscited by 164
- 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 137
- 2021Hierarchical Transformers Are More Efficient Language Modelscited by 99
- 2024Tokenization Is More Than Compressioncited by 87
- 2022Efficient Transformers with Dynamic Token Poolingcited by 75
- 2020Adv-BERT: BERT is not robust on misspellings! Generating nature adversarial samples on BERTcited by 69
- 2025Dynamic Chunking for End-to-End Hierarchical Sequence Modelingcited by 65
- 2024MambaByte: Token-free Selective State Space Modelcited by 58
- 2025SuperBPE: Space Travel for Language Modelscited by 58
- 2023A Formal Perspective on Byte-Pair Encodingcited by 35
- 2025Physics of Language Models: Part 4.1, Architecture Design and the Magic of Canon Layerscited by 32
- 2024SpaceByte: Towards Deleting Tokenization from Large Language Modelingcited by 31
- 2024Counting Ability of Large Language Models and Impact of Tokenizationcited by 29
- 2024CUTE: Measuring LLMs' Understanding of Their Tokenscited by 28
- 2024MrT5: Dynamic Token Merging for Efficient Byte-level Language Modelscited by 27
- 2025From Bytes to Ideas: Language Modeling with Autoregressive U-Netscited by 15
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Byte Language Models: Scaling, Emergent Abstractions, and Information Allocation
- 2026The Efficiency Gap in Byte Modeling
- 2025Dynamic Large Concept Models: Latent Reasoning in an Adaptive Semantic Space
- 2026Scratchpad Patching: Decoupling Compute from Patch Size in Byte-Level Language Models
- 2026A Family of LLMs Liberated from Static Vocabularies
- 2025R1-Compress: Long Chain-of-Thought Compression via Chunk Compression and Search
- 2025ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference
- 2025Length-MAX Tokenizer for Language Models