Kathleen Writes: Autoregressive Generation and Data Scaling Without Attention
Not on the map. Why?
Abstract (arXiv)
Papers 1-2 of the Kathleen series showed that a byte-level, attention-free architecture built from a wavetable encoder and multi-scale reverberant state can match strong baselines on classification at ~450-700K parameters, without pretraining. We ask whether the same ingredients can generate. (1) Scaling: on byte-level language modeling (WikiText-103, raw UTF-8, no tokenizer), the reverberant model beats a parameter-matched transformer at every dataset scale measured (2-512 MB), e.g. 1.84 vs 2.04 bits/byte at 512 MB with ~0.5M parameters; the transformer needs more than 512 MB to match what the attention-free model learns from 32 MB. (2) Measurement: we introduce FORM DISTANCE, a non-parametric, gaming-resistant instrument for "reads like text": nine statistical axes of human text define a reference cloud, and five constructed fakes are all rejected. (3) Generation: decoding policy dominates architecture -- widening the sampler halves the same model's distance (3.17 to 1.52), and a retrieval-augmented decoding scheme takes the frozen model further (1.52 to 1.14) with no training step involved; the ablation attributes the gain to the sparse phrase dose itself, not the selection gate. The gain has a sharp boundary condition: the phrases must come from the model's own training corpus -- a 40x larger foreign library helps not at all, an effect the attention twin shares, consistent with in-context integration being a capability of scale. We also report four architectural additions that did not help, and a computed lexicon reaching 94% of a learned table's top-1 accuracy at one fifth of the parameters. Everything runs offline; all experiments are reproducible on a free Kaggle T4.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 17 references that are in the map. First posted on arXiv 5 Aug 2026.
Builds on
11 of 17 references.
References · 11
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 800
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
- 2021MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence Frontierscited by 470
- 2023MEGABYTE: Predicting Million-byte Sequences with Multiscale Transformerscited by 170
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024When Linear Attention Meets Autoregressive Decoding: Towards More Effective and Efficient Linearized Large Language Models
- 2026Hidden Decoding at Scale: Latent Computation Scaling for Large Language Models
- 2026The Efficiency Gap in Byte Modeling
- 2025Speculative Decoding and Beyond: An In-Depth Survey of Techniques
- 2025Progress by Pieces: Test-Time Scaling for Autoregressive Image Generation
- 2026Autoregressive vs. Masked Diffusion Language Models: A Controlled Comparison
- 2024Promises and Pitfalls of Generative Masked Language Modeling: Theoretical Framework and Practical Guidelines
- 2026WAND: Windowed Attention and Knowledge Distillation for Efficient Autoregressive Text-to-Speech Models