arXiv:2608.16357cs.DCcs.AI2026-08

让分布式智能体记忆自动对齐知识,避免信息丢失或错误合并。

MELD: A Protocol for Merging Knowledge Across Distributed Agentic Memories

  • 用五种状态处理外来知识,基于身份、相似度和语义推理决策。
  • 在热问答数据集上,存储量少11%却保持更高召回率,误合并率仅1.3%。
  • 无需中心协调,可自愈网络分裂,适合跨边缘-云端的协同系统。

自主智能体虽可共享工具,却无法共享知识:缺乏协议来统一不同表述的事实、关联分散知识或妥善处理矛盾而不丢弃任何一方。我们提出MELD,一种基于知识图谱运行时模型的自管理一致性机制。每个智能体通过五类结果(插入、合并、关联、冲突、拒绝)处理传入声明,依据三项信号(作用域内身份、嵌入相似度、自然语言推理判断)及上下文与新鲜度门限,仅通过唯一可审计的认证补丁修改状态。结合标准发布/订阅传输与每条声明的状态CRDT,实现无协调器的主权记忆一致性:在分区后自我修复,抗丢包路由,防止同伴静默覆盖,在良性故障模型下安全运行。MELD不判定真伪,检测到矛盾则保留以待后续裁决,从不沉默解决。在HotpotQA干扰数据集上,分布式融合在预设等价测试下召回率不低于集中式存储,且比简单并联合格高出约11%的存储效率;合并分类器在已裁决候选对上达到AUC 0.968,误合并率0.013;状态CRDT在30次真实分区恢复试验中全部成功收敛,而最后写者胜方案仅11次成功;语义路由在匹配召回率下消息量减少约3倍。评估基于横跨运营商级5G边缘、国家超算和本地层级的真实计算连续体,阈值经实测校准。

原文摘要 · Abstract (English)

Autonomous agents share a transport and can call each other's tools, but they cannot share what they know: no protocol lets two agents' memories reconcile a fact phrased two ways, link related facts held apart, or reconcile contradictory knowledge without silently discarding either claim. We present MELD, a self-managing coherence mechanism for a federation of agent memories whose run-time model is the knowledge graph itself. Each brain admits every incoming claim through a five-outcome procedure (insert, merge, relate, conflict, or reject), decided from three signals (scoped claim-key identity, embedding similarity, and a natural-language-inference verdict) under context and freshness gates, and acting through exactly one auditable, authenticated Patch, the only object that mutates state. A binding onto standard publish/subscribe transport with a per-claim status CRDT keeps sovereign brains coherent in claim status without a coordinator: self-healing after partitions and under lossy routing, and self-protecting against silent rewrite by a peer, under a benign-fault model. MELD does not adjudicate truth; a detected contradiction is preserved for later adjudication, never silently resolved. On HotpotQA distractor, distributed merge is recall-non-inferior to a centralized store under a pre-specified equivalence test and recall-superior to naive union at about 11% less live storage; the merge classifier separates at AUC 0.968 with a 0.013 false-merge rate on adjudicated candidate pairs; the status CRDT reconverges in 30/30 real partition-heal trials where last-writer-wins manages 11/30; and semantic routing delivers about 3x fewer messages at matched recall. We evaluate on a real computing continuum spanning an operator-grade 5G edge, national HPC, and a local tier, with empirically calibrated thresholds.

知识融合分布式智能体一致性协议知识图谱

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