Pith. sign in

REVIEW 2 cited by

SpaceByte: Towards Deleting Tokenization from Large Language Modeling

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 2404.14408 v3 pith:NBRB5OIM submitted 2024-04-22 cs.CL cs.AIcs.LG

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

Tokenization is widely used in large language models because it significantly improves performance. However, tokenization imposes several disadvantages, such as performance biases, increased adversarial vulnerability, decreased character-level modeling performance, and increased modeling complexity. To address these disadvantages without sacrificing performance, we propose SpaceByte, a novel byte-level decoder architecture that closes the performance gap between byte-level and subword autoregressive language modeling. SpaceByte consists of a byte-level Transformer model, but with extra larger transformer blocks inserted in the middle of the layers. We find that performance is significantly improved by applying these larger blocks only after certain bytes, such as space characters, which typically denote word boundaries. Our experiments show that for a fixed training and inference compute budget, SpaceByte outperforms other byte-level architectures and roughly matches the performance of tokenized Transformer architectures.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Hierarchical Autoregressive Transformers: Combining Byte- and Word-Level Processing for Robust, Adaptable Language Models

    cs.CL 2025-01 conditional novelty 6.0 of 10

    A hierarchical byte-to-word-to-byte transformer matches subword-tokenizer LLMs at 1B-7B scale while being more robust to input corruption and faster to adapt to new languages.

  2. Scaling Particle Collision Data Analysis

    cs.LG 2024-11 conditional novelty 4.0 of 10

    A byte-level transformer trained from scratch on simulated collider data matches specialized jet-tagging models when given enough training examples.

Pith tools