arXiv:2605.09278cs.AI2026-05被引 2

提出新方法,让多智能体辩论系统自动校准共享记忆可信度。

EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium

论文配图:EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium
图 1 · 摘自论文原文
  • 将记忆更新建模为零信任博弈,用均衡解判断记忆可信度。
  • 在多个基准上显著优于现有防护机制,且抗恶意智能体攻击。
  • 无需额外大模型判断,仅利用已有检索路径即可完成校准。

多智能体辩论(MAD)系统依赖共享记忆支持长时推理,但单一错误条目可能污染后续推理,而辩论本身无法过滤此类错误。现有防护机制依赖启发式或大模型验证,但其判断逻辑与智能体相同,忽略多智能体间的动态交互。本文将记忆更新建模为零信任记忆博弈,假设所有智能体均不可信,以博弈均衡作为最优记忆信任的指示器。基于此均衡,提出EquiMem,在推理时通过分析各智能体的已有检索查询与遍历路径,算法化地量化每次记忆更新的可信度,无需请求额外大模型判断。该方法适用于嵌入与图结构两种记忆形式,在多种基准、框架和架构下均表现更优,对对抗性智能体保持鲁棒,且推理开销极低。

原文摘要 · Abstract (English)

Multi-agent debate (MAD) systems increasingly rely on shared memory to support long-horizon reasoning, but this convenience opens a critical vulnerability: a single corrupted entry can contaminate the downstream memory-augmented reasoning, and debate alone fails to filter such errors. Existing safeguards filter entries via heuristics or LLM-based validation, yet they rely on AI judgments that share the same failure modes and overlook the cross-agent dynamics of MAD. We address this gap by formulating memory updating in MAD as a zero-trust memory game, in which no agent is assumed honest and the game's equilibrium serves as an indicator of optimal memory trust. Guided by this equilibrium, we propose EquiMem, an inference-time calibration mechanism that quantifies each update algorithmically against the shared memory state, using agents' existing retrieval queries and traversal paths as evidence rather than soliciting any LLM judgment. EquiMem instantiates calibration for both embedding- and graph-based memory, and across diverse benchmarks, MAD frameworks, and memory architectures, it consistently outperforms existing safeguards, remains robust under adversarial agents, and incurs negligible inference overhead.

多智能体记忆校准博弈论推理安全

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。