MoVE: Mixture of Value Embeddings -- A New Axis for Scaling Parametric Memory in Autoregressive Models
Not on the map. Why?
Abstract (arXiv)
Autoregressive sequence modeling stands as the cornerstone of modern Generative AI, powering results across diverse modalities ranging from text generation to image generation. However, a fundamental limitation of this paradigm is the rigid structural coupling of model capacity to computational cost: expanding a model's parametric memory -- its repository of factual knowledge or visual patterns -- traditionally requires deepening or widening the network, which incurs a proportional rise in active FLOPs. In this work, we introduce MoVE (Mixture of Value Embeddings), a mechanism that breaks this coupling and establishes a new axis for scaling capacity. MoVE decouples memory from compute by introducing a global bank of learnable value embeddings shared across all attention layers. For every step in the sequence, the model employs a differentiable soft gating mechanism to dynamically mix retrieved concepts from this bank into the standard value projection. This architecture allows parametric memory to be scaled independently of network depth by simply increasing the number of embedding slots. We validate MoVE through strictly controlled experiments on two representative applications of autoregressive modeling: Text Generation and Image Generation. In both domains, MoVE yields consistent performance improvements over standard and layer-wise memory baselines, enabling the construction of "memory-dense" models that achieve lower perplexity and higher fidelity than their dense counterparts at comparable compute budgets.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 30 Jan 2026.
Builds on
22 of 32 references.
References · 22
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023GPT-4 Technical Reportcited by 18,396
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2020Taming Transformers for High-Resolution Image Synthesiscited by 3,253
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2016Improved Techniques for Training GANscited by 2,970
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2024Mixtral of Expertscited by 1,823
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
10 more
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2022Scaling Autoregressive Models for Content-Rich Text-to-Image Generationcited by 1,295
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2024Autoregressive Model Beats Diffusion: Llama for Scalable Image Generationcited by 777
- 2018Universal Transformerscited by 647
- 2014Memory Networkscited by 363
- 2024Titans: Learning to Memorize at Test Timecited by 328
- 2023From Sparse to Soft Mixtures of Expertscited by 248
- 2019Large Memory Layers with Product Keyscited by 124
- 2019Augmenting Self-attention with Persistent Memorycited by 93
Built on by
Citing papers per year: 2026: 2.
2 papers.