Adaptive Targeted Dynamic Chunking for Tokenization-Free Hierarchical Model
Not on the map. Why?
Abstract (arXiv)
Tokenization-free hierarchical models are emerging as a promising alternative to traditional Large Language Models (LLMs), addressing inherent preprocessing issues such as vocabulary design complexity, out-of-vocabulary (OOV) errors, and language-specific constraints. However, a significant challenge in these byte-level methods is the optimization of the compression ratio, a critical factor that dictates model performance for processing bytes data via chunks. In this paper, we propose Adaptive Targeted Dynamic Chunking (ATDC), a novel byte-compression control mechanism designed to enhance the effectiveness of dynamic chunking within hierarchical architectures. Our approach utilizes curriculum learning to progressively adjust the compression ratio during training, transitioning from low to high compression to stabilize the learning process. We provide an analysis establishing the relationship between the target compression ratio and Bytes-Per-Innermost-Chunk (BPIC), allowing for tracking of chunk-size evolution throughout the training phase. Evaluations conducted on the FineWeb-Edu 100B dataset demonstrate that hierarchical models equipped with ATDC achieve competitive Bits-Per-Byte (BPB) performance compared to conventional baselines operating at both byte and token levels. Furthermore, the proposed method exhibits more stable training dynamics and superior final performance across diverse downstream tasks compared to models using fixed compression ratios, while maintaining the inherent robustness and flexibility of byte-level processing.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 25 references that are in the map. First posted on arXiv 28 May 2026.
Builds on
22 of 25 references.
References · 22
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
- 2020GLU Variants Improve Transformercited by 1,804
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
- 2023Language Model Tokenizers Introduce Unfairness Between Languagescited by 214
- 2023Do All Languages Cost the Same? Tokenization in the Era of Commercial Language Modelscited by 192
- 2023MEGABYTE: Predicting Million-byte Sequences with Multiscale Transformerscited by 170
10 more
- 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 146
- 2024Simple and Scalable Strategies to Continually Pre-train Large Language Modelscited by 127
- 2021Hierarchical Transformers Are More Efficient Language Modelscited by 102
- 2020Fast WordPiece Tokenizationcited by 87
- 2025Dynamic Chunking for End-to-End Hierarchical Sequence Modelingcited by 72
- 2024Exponential Moving Average of Weights in Deep Learning: Dynamics and Benefitscited by 71
- 2024MambaByte: Token-free Selective State Space Modelcited by 59
- 2025Boundless Byte Pair Encoding: Breaking the Pre-tokenization Barriercited by 32
- 2025Hierarchical Autoregressive Transformers: Combining Byte- and Word-Level Processing for Robust, Adaptable Language Modelscited by 22
- 2025H-Net++: Hierarchical Dynamic Chunking for Tokenizer-Free Language Modelling in Morphologically-Rich Languagescited by 1
Built on by
Not cited yet.