In plain words: Instead of chopping text into pre-made chunks, this model reads raw bytes and adds bigger processing steps right after spaces, where words usually end. At the same computing cost, it matched models that use pre-chopped chunks and beat other byte-reading ones.
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.
Kevin Slagle
arXiv:2404.14408 · cs.CL, cs.AI, cs.LG · submitted Apr 22, 2024 · updated Oct 6, 2024
abstract · pdf · html · 9+10 pages, 3+1 figures, 2+4 tables