多智能体系统用语义投票和拜占庭容错机制实现同步记忆清理,减少冗余。
PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning
- 基于轻量级DistilBERT的语义投票,结合上下文判断记忆相关性。
- 通过多尺度时间衰减函数,按年龄和访问频率自动降权旧数据。
- 采用PBFT共识确保在恶意节点干扰下仍能正确决策,适合高可靠性场景。
多智能体系统在复杂动态环境中广泛应用,亟需高效可靠的共享知识管理机制。核心挑战在于保持分布式记忆的一致性、相关性,并避免过时或无关数据的积累,类似生物遗忘过程。本文提出协同遗忘协议(Co-Forgetting Protocol),一种综合性框架,实现多智能体系统的同步记忆修剪。该协议包含三个关键组件:(1) 上下文感知的语义投票,使用轻量级DistilBERT模型根据内容与当前情境评估记忆项的相关性;(2) 多尺度时间衰减函数,基于记忆年龄和访问频率在不同时间尺度上递减其重要性;(3) 基于实用拜占庭容错(PBFT)的共识机制,在最多f个拜占庭节点存在且系统规模N≥3f+1的前提下,确保多数合格节点达成关于保留或删除记忆项的一致决策。协议通过gRPC实现高效跨智能体通信,利用Pinecone进行可扩展向量嵌入存储与相似性检索,SQLite管理元数据。在由4个智能体构成的模拟环境中,实验表明协议在500轮内使内存占用减少52%,遗忘决策投票准确率达88%(对比人工标注基准),在模拟拜占庭条件下共识成功率为92%,内存访问缓存命中率达82%。
原文摘要 · Abstract (English)
The proliferation of multi-agent systems (MAS) in complex, dynamic environments necessitates robust and efficient mechanisms for managing shared knowledge. A critical challenge is ensuring that distributed memories remain synchronized, relevant, and free from the accumulation of outdated or inconsequential data - a process analogous to biological forgetting. This paper introduces the Co-Forgetting Protocol, a novel, comprehensive framework designed to address this challenge by enabling synchronized memory pruning in MAS. The protocol integrates three key components: (1) context-aware semantic voting, where agents utilize a lightweight DistilBERT model to assess the relevance of memory items based on their content and the current operational context; (2) multi-scale temporal decay functions, which assign diminishing importance to memories based on their age and access frequency across different time horizons; and (3) a Practical Byzantine Fault Tolerance (PBFT)-based consensus mechanism, ensuring that decisions to retain or discard memory items are agreed upon by a qualified and fault-tolerant majority of agents, even in the presence of up to f Byzantine (malicious or faulty) agents in a system of N greater than or equal to 3f+1 agents. The protocol leverages gRPC for efficient inter-agent communication and Pinecone for scalable vector embedding storage and similarity search, with SQLite managing metadata. Experimental evaluations in a simulated MAS environment with four agents demonstrate the protocol's efficacy, achieving a 52% reduction in memory footprint over 500 epochs, 88% voting accuracy in forgetting decisions against human-annotated benchmarks, a 92% PBFT consensus success rate under simulated Byzantine conditions, and an 82% cache hit rate for memory access.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。