aiqbench analysis
MultiHashFormer introduces a novel framework enabling hash-based autoregression in causal language models, effectively bypassing the parameter scaling limits of traditional embedding matrices. By representing tokens as unique hash signatures processed by a Transformer decoder, this approach achieves superior performance across multiple benchmarks while maintaining a constant parameter footprint even during significant vocabulary expansion. This research advances the efficiency and scalability of large language models without relying on quantum mechanics or incidental AI features.
MultiHashFormer: Hash-based Generative Language Models
arXiv:2606.28057v2 Announce Type: replace-cross Abstract: Language models (LMs) represent tokens using embedding matrices that scale linearly with the vocabulary size. To constrain the parameter footprint, prior work proposes hashing many tokens into a single vector within encoder-only models. While this offers parameter efficiency, many-to-one collisions prevent its use in causal LMs. In this paper, we propose MultiHashFormer, a new framework that allows hash-based autoregression. Each token is represented as a unique hash signature, a short sequence of discrete hash IDs, generated by multiple independent hash functions. A Hash Encoder compresses this signature into a single latent vector for processing by a Transformer decoder. Then, a Hash Decoder generates the hash signature of the next token, which is then mapped back to text. We evaluate our approach at the 100M, 1B and 3B parameter scales, demonstrating that MultiHashFormer consistently outperforms standard Transformer LMs across multiple benchmarks. Furthermore, we show that our model handles multilingual vocabulary expansion with a constant parameter footprint without any modifications.
Abstract:Language models (LMs) represent tokens using embedding matrices that scale linearly with the vocabulary size. To constrain the parameter footprint, prior work proposes hashing many tokens into a single vector within encoder-only models. While this offers parameter efficiency, many-to-one collisions prevent its use in causal LMs. In this paper, we propose MultiHashFormer, a new framework that allows hash-based autoregression. Each token is represented as a unique hash signature, a short sequence of discrete hash IDs, generated by multiple independent hash functions. A Hash Encoder compresses this signature into a single latent vector for processing by a Transformer decoder. Then, a Hash Decoder generates the hash signature of the next token, which is then mapped back to text. We evaluate our approach at the 100M, 1B and 3B parameter scales, demonstrating that MultiHashFormer consistently outperforms standard Transformer LMs across multiple benchmarks. Furthermore, we show that our model handles multilingual vocabulary expansion with a constant parameter footprint without any modifications.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
arXiv:2606.28057 [cs.CL]
(or arXiv:2606.28057v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2606.28057 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 257 words
Related coverage

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026

Natera’s intelligent appointment scheduling with Amazon Bedrock AgentCore
AWS · Aug 26, 2026
Controllable-CoT leads to covert reasoning capabilities
LessWrong · Sep 22, 2026

[AINews] OpenAI shuts off Cursor
Latent Space · Aug 29, 2026