MemReasoner用记忆机制提升大模型在长链推理中的泛化能力。
Can Memory-Augmented Language Models Generalize on Reasoning-in-a-Haystack Tasks?
- 引入记忆模块学习事实顺序,支持跳转访问和选择性注意力。
- 仅用1%标注事实即实现强泛化,远超基线模型。
- 适合需要长程推理与弱监督的复杂问答任务。
大型语言模型在长链推理任务中常表现出脆弱性。本文提出MemReasoner,一种新型简单的记忆增强型LLM架构:记忆模块学习上下文事实的相对顺序,支持跳转访问,解码器则选择性关注记忆内容。该模型端到端训练,可选不同程度的支持事实监督。我们在两个不同的合成多跳推理任务上对比了MemReasoner、现有记忆增强Transformer模型及状态空间模型。在包含长干扰文本或测试集答案变化等挑战场景下,MemReasoner在单跳和双跳任务上均表现优异。其泛化能力仅需零至弱度支持事实监督(单跳无需,双跳使用1%支持事实),而基线模型整体泛化差,且对全量支持事实监督依赖性强。结果表明,显式记忆机制结合弱监督对提升大模型上下文处理与推理能力至关重要。
原文摘要 · Abstract (English)
Large language models often expose their brittleness in reasoning tasks, especially while executing long chains of reasoning over context. We propose MemReasoner, a new and simple memory-augmented LLM architecture, in which the memory learns the relative order of facts in context, and enables hopping over them, while the decoder selectively attends to the memory. MemReasoner is trained end-to-end, with optional supporting fact supervision of varying degrees. We train MemReasoner, along with existing memory-augmented transformer models and a state-space model, on two distinct synthetic multi-hop reasoning tasks. Experiments performed under a variety of challenging scenarios, including the presence of long distractor text or target answer changes in test set, show strong generalization of MemReasoner on both single- and two-hop tasks. This generalization of MemReasoner is achieved using none-to-weak supporting fact supervision (using none and 1\% of supporting facts for one- and two-hop tasks, respectively). In contrast, baseline models overall struggle to generalize and benefit far less from using full supporting fact supervision. The results highlight the importance of explicit memory mechanisms, combined with additional weak supervision, for improving large language model's context processing ability toward reasoning tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。