提出新记忆更新机制,让模型能独立选择删除和写入位置。
Erase-then-Delta Attention: Decoupling Erase and Write Addresses in Delta-Rule Linear Attention
- 分离擦除与写入地址,先定向清除旧信息再修正新内容。
- 在2.5B和25B模型上均提升性能,长上下文(128k)仍最优。
- 适合需要高效管理长期记忆的序列建模任务。
Delta规则线性注意力通过在写入前修正当前写入位置的内容来改进循环记忆更新。然而,这种修正仍局限于同一写入地址,无法主动清除其他位置的过时信息。为此,本文提出Erase-then-Delta Attention(EDA),将擦除位置与写入位置解耦。方法首先沿学习到的擦除方向执行针对性清除,再沿当前写入方向进行标准的增量修正写入。该设计在保持原Δ规则修正能力的同时,扩展了内存管理能力。在密集型2.5B和MoE型25B-A2.8B模型族上的语言模型预训练实验表明,EDA在两种设置下均表现最佳。在25B MoE模型经80B token长上下文微调后,其在4k至128k上下文长度的评估中依然领先。紧凑更新分析与记忆状态探测显示:当被动衰减较弱时,EDA能有效分配额外清理路径,同时保留Δ规则的修正行为。结果表明,循环记忆模型应不仅决定写什么,还应自主选择删什么、在哪删。
原文摘要 · Abstract (English)
Delta-rule linear attention improves recurrent memory updates by correcting what is already stored at the current write address before writing new content. However, the active correction is still anchored to that same write address. As a result, stale information stored at a different address cannot be actively removed before new content is written elsewhere. We propose Erase-then-Delta Attention (EDA), a memory update rule that decouples where to erase from where to write. The key insight is that recurrent memory models should not only correct the current write, but also selectively suppress outdated memory at an independently chosen address. Concretely, our method first applies a targeted erase step along a learned erase direction, and then performs the standard delta-style corrective write along the current write direction. This preserves the corrective behavior of delta-rule updates while expanding their memory-management capacity. Language-model pretraining experiments across dense 2.5B and MoE 25B-A2.8B model families show that EDA performs best in both settings. The gain persists after 80B-token long-context midtraining of the MoE models, where EDA also performs best in long-context evaluations from 4k to 128k contexts. A compact update analysis and memory-state probes suggest why: EDA keeps the delta-rule corrective write intact while allocating an additional cleanup path most strongly when passive decay is weak. These results suggest that recurrent memory models should decide not only what to write, but also what stale information to erase and where.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。