PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning
Duong Bach

TL;DR
This paper presents a novel memory pruning protocol for multi-agent systems that combines semantic relevance voting, temporal decay, and Byzantine fault-tolerant consensus to improve memory management efficiency and robustness.
Contribution
It introduces the Co-Forgetting Protocol integrating semantic voting, temporal decay, and PBFT consensus for synchronized memory pruning in MAS.
Findings
52% reduction in memory footprint over 500 epochs
88% voting accuracy against human benchmarks
92% PBFT consensus success rate under Byzantine faults
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Caching and Content Delivery · Ferroelectric and Negative Capacitance Devices
MethodsPruning · Mixing Adam and SGD
