让大模型记忆能力独立于计算量增长,突破生成模型的容量瓶颈
MoVE: Mixture of Value Embeddings -- A New Axis for Scaling Parametric Memory in Autoregressive Models
- 用共享的可学习记忆库替代传统逐层记忆,通过软门控动态调用
- 相同算力下,记忆密度提升后,文本和图像生成的困惑度更低、质量更高
- 适合追求高记忆容量但受限于算力的生成模型研究者
自回归序列建模是现代生成式AI的核心,广泛应用于文本与图像生成。然而,其根本局限在于模型容量与计算成本刚性绑定:扩展参数化记忆(如知识或视觉模式)需加深或加宽网络,导致活跃浮点运算量成比例上升。本文提出MoVE(Value Embedding混合机制),打破这一耦合关系,开辟新的容量扩展路径。MoVE引入一个跨所有注意力层共享的全局可学习值嵌入库,每一步生成时,通过可微软门控机制从该库中动态混合检索到的概念进入标准值投影。此架构使参数化记忆可独立于网络深度扩展,仅需增加嵌入槽位数量即可实现。我们在文本生成与图像生成两个典型任务上进行严格控制实验,结果表明,相比标准及逐层记忆基线,MoVE在相同计算预算下显著提升性能,构建出‘记忆密集型’模型,实现更低困惑度与更高保真度。
原文摘要 · Abstract (English)
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 $\textbf{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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。