让记忆在不同大模型间无缝迁移,提升多模型协作效率。
Rosetta Memory: Adaptive Memory for Cross-LLM Agents

- 以记忆为中心设计适配器,实现跨模型记忆读写
- 在多个问答数据集上显著优于基线,支持未见模型替换
- 适合需要多模型协同的长期任务系统开发者
记忆是将无状态大模型转化为持续进化智能体的关键,可实现经验积累、长周期规划与持续自我优化。现有记忆系统通常围绕特定大模型设计,但实际中用户常在不同模型间切换,如用Claude编程、GPT写作,或在同一任务中分步调用不同模型以降低成本。这导致上游模型生成的记忆需被下游模型使用。如何使记忆有效适配并激活下游模型,仍是未充分研究的问题。为此,本文提出从模型中心转向记忆中心的设计范式,从写入与读取两端构建两个受配置条件约束的算子,并联合训练以优化记忆存储与呈现方式。为确保泛化能力,采用最小收益采样课程,优先训练服务较少的模型。通过性能差距奖励机制,对比基线而非依赖模型自身能力评估效果。在HotpotQA、2WikiMultihopQA和MuSiQue上的实验表明,该方法持续优于基线,且对未见模型替换保持鲁棒性。
原文摘要 · Abstract (English)
Memory is the key component for transforming a stateless LLM into a persistent, evolving agent through experience accumulation, long-horizon planning, and continual self-improvement. Existing memory systems typically take the LLM as the center and design memory operations tailored to a specific backbone. In practice, however, users frequently switch between LLMs, for example using Claude for coding and GPT for writing across tasks, or routing different steps to different backbones within a single task for cost-effective trade-offs. As a result, memory written by one model often needs to be consumed by another. Making upstream memory effectively adapt to and activate downstream LLMs remains a critical yet underexplored problem. To bridge this gap, we shift the perspective from LLM-centric memory design to \emph{memory-centric LLM adaptation}. Specifically, we approach the above upstream-downstream memory adaptation problem from both the write and read sides, and design two profile-conditioned operators that are jointly trained to optimize how memory is stored and presented for better task completion. To ensure the learned operators generalize across a broad set of LLMs, we propose a minimum-gain sampling curriculum that prioritizes the least-served LLMs during training. To better measure the operators' actual contribution rather than the LLM's own capability, we design a performance-gap reward that compares against a naive memory baseline. Experiments on HotpotQA, 2WikiMultihopQA, and MuSiQue demonstrate that our model consistently outperforms baselines and remains robust under unseen-model replacement.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。