解释了掩码扩散模型为何能缓解逆向推理困境
A Theoretical Analysis of Why Masked Diffusion Models Mitigate the Reversal Curse
- 通过参数耦合机制,让正反向查询共享证据存储
- 理论证明正向训练可增强逆向预测的可重用证据
- 适合研究语言模型推理与对称性问题的学者
自回归语言模型存在逆向诅咒:学会‘A是B’后,难以处理‘B是A’的逆向查询。掩码扩散语言模型(MDMs)虽仍存在该问题,但程度显著减弱,其原因尚不明确。尽管普遍认为归因于任意顺序掩码训练,但仅观察‘[M]是B’并不能直接解释为何能支持‘B是[M]’的逆向推理。本文提供理论分析,揭示正向与逆向位置条件在参数层面存在耦合:共享的Transformer参数存储词元对证据,相对位置编码则通过查询与键路由注意力,而不改变值侧证据。在一层MDM中,证明正向掩码训练增强了可复用于逆向查询的证据,诱导出相关联的正反向注意力路径,并产生降低逆向损失的一阶正向梯度分量。受控单层实验及大规模LLaDA/Dream实验验证了这些特征,并显示其显著提升逆向预测性能。
原文摘要 · Abstract (English)
Autoregressive language models (ARMs) suffer from the reversal curse: after learning ''$A$ is $B$,'' they often fail on the reverse query ''$B$ is $A$.'' Masked diffusion language models (MDMs) exhibit this failure in a much weaker form, but the underlying reason has remained unclear. A common explanation attributes this mitigation to their any-order masked training objective. However, observing ''$[\mathbf{M}]$ is $B$'' during training teaches recovery of $A$ from $B$ in one positional configuration, and does not by itself explain why the learned evidence should transfer to the reverse prompt ''$B$ is $[\mathbf{M}]$.'' We provide a theoretical analysis showing that this transfer arises from a parameter-level coupling between forward and reverse positional conditionals: shared Transformer parameters store token-pair evidence, while relative positional encodings route attention through queries and keys without changing the value-side evidence being retrieved. In a one-layer MDM, we prove that forward masked training strengthens evidence that is reusable in reverse queries, induces correlated forward--reverse attention routes, and yields a positively aligned shared-storage gradient component that decreases the reverse loss to first order. Controlled one-layer experiments and large-scale LLaDA/Dream experiments verify these signatures and show that they translate into improved reverse prediction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。