Pith. sign in

REVIEW 4 cited by

MrT5: Dynamic Token Merging for Efficient Byte-level Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.20771 v3 pith:KKAXPDOX submitted 2024-10-28 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords mrt5modelssequencebyt5byte-leveltokenscharacter-levelcompression
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Models that rely on subword tokenization have significant drawbacks, such as sensitivity to character-level noise like spelling errors and inconsistent compression rates across different languages and scripts. While character- or byte-level models like ByT5 attempt to address these concerns, they have not gained widespread adoption -- processing raw byte streams without tokenization results in significantly longer sequence lengths, making training and inference inefficient. This work introduces MrT5 (MergeT5), a more efficient variant of ByT5 that integrates a token deletion mechanism in its encoder to dynamically shorten the input sequence length. After processing through a fixed number of encoder layers, a learned delete gate determines which tokens are to be removed and which are to be retained for subsequent layers. MrT5 effectively "merges" critical information from deleted tokens into a more compact sequence, leveraging contextual information from the remaining tokens. In continued pre-training experiments, we find that MrT5 can achieve significant gains in inference runtime with minimal effect on performance, as measured by bits-per-byte. Additionally, with multilingual training, MrT5 adapts to the orthographic characteristics of each language, learning language-specific compression rates. Furthermore, MrT5 shows comparable accuracy to ByT5 on downstream evaluations such as XNLI, TyDi QA, and character-level tasks while reducing sequence lengths by up to 75%. Our approach presents a solution to the practical limitations of existing byte-level models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Scratchpad Patching: Decoupling Compute from Patch Size in Byte-Level Language Models

    cs.CL 2026-05 conditional novelty 7.0 of 10

    Scratchpad Patching decouples compute from patch size in byte-level language models by inserting entropy-triggered scratchpads to update patch context dynamically.

  2. Phonemes to the Rescue: Multilingual Tokenization Based on International Phonetic Alphabet

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    IPA-based subword tokenizers trained across 24 languages improve tokenization quality and generalization to unseen languages compared to standard text tokenizers, especially for non-Latin scripts.

  3. Accelerating Vision Transformers with Adaptive Patch Sizes

    cs.CV 2025-10 conditional novelty 6.0 of 10

    APT adaptively varies patch sizes within a single image to reduce ViT token count, delivering 40-50% throughput gains on large models with no downstream performance loss.

  4. Synergy: End-to-end Concept Model

    cs.CL 2025-07 reject novelty 5.0 of 10

    A byte-level transformer with a learned top-k router matches a tokenized Llama3 baseline on Wikipedia bits-per-byte, and works best when positional encoding is removed from its middle layers.

Pith tools