arXiv:2611.05255v1 Announce Type: cross
Abstract: Byte level language models avoid tokenizer dependence and provide universal coverage, but processing every byte at full resolution is expensive. We introduce DeepMem, a causal multiscale architecture that separates semantic compression from exact byte preservation. A learned invertible subband transform constructs a hierarchy of shorter sequences, while a lossless carrier and explicit detail sidebands preserve byte identity. Fast weight memory blocks operate along the encoder, with iterative shared state computation at the compressed bottleneck, while an attention based super resolution decoder restores byte resolution representations. DeepMem achieves stronger language modeling performance than a matched byte level Transformer on FineWeb-Edu and PG19, and obtains the best macro average performance across the evaluated FLORES languages. It also improves PIQA accuracy while remaining competitive on code modeling, multiple choice reasoning, and byte level corruption robustness. Bottleneck refinement requires approximately $7{,}600\times$ fewer counted FLOPs than equivalent full resolution reasoning, while maintaining competitive evaluation throughput.
arxiv
DeepMem: A Multiscale Byte-Level Language Model with Invertible Subband Transform
DeepMem is a causal multiscale architecture for byte-level language modeling that separates semantic compression from exact byte preservation using a learned invertible subband transform. It builds a hierarchy of shorter sequences with lossless carriers and detail sidebands, and uses fast weight memory blocks and an attention-based super-resolution decoder. DeepMem outperforms a matched byte-level Transformer on FineWeb-Edu and PG19, achieves best macro-average across FLORES languages, and improves PIQA accuracy while reducing bottleneck FLOPs by ~7,600x.
The paper introduces a novel architecture with concrete performance gains and efficiency improvements, relevant to AI researchers and practitioners in language modeling.
Comments & Questions (0)
No comments yet
Be the first to comment!