Σ-Mem: An Online Reliability Memory for LLM-based Multi-Agent Systems
Summary
The paper introduces Σ-Mem, an online reliability memory for LLM-based multi-agent systems that tracks historical competence of peers and peer relationships, enabling stable adaptation via spectral bounds and improving coordination through residual steering, routing, and weighted voting.
View Cached Full Text
Cached at: 07/31/26, 09:53 AM
Paper page - Σ-Mem: An Online Reliability Memory for LLM-based Multi-Agent Systems
Source: https://huggingface.co/papers/2607.27958
Abstract
Memoryiscentraltolong-horizonLLMagents,yetexistingmemorysystemsprimarilypreserveinteractioncontentratherthanmodelingwhichagentscanbetrustedandunderwhatconditions.Thislimitationisparticularlyimportantinmulti-agentsystems,whereacentralmodelmaybeunabletodirectlyverifyplausibleorcorrelatedpeerresponses.WeintroduceΣ-Mem,anonlinereliabilitymemorythatrecordshistoricalcompetenceevidenceforindividualpeersandpeerrelationshipevidenceacrossthepeerset.Bothformsofevidencearemaintainedasrealsymmetricstatesandupdatedfrompost-decisioncorrectnessfeedback.ByWeyl’sinequality,thespectralchangecausedbyeachevent-levelupdateisbounded,enablingstableonlineadaptationwithoutretrainingtheunderlyingmodels.Σ-Memprovidesageneralwrite-and-readinterface:thesamememorycanbeusedforresidualsteeringofacentralmodel,response-freepeerrouting,orreliability-weightedvoting.AcrossfiveQwen-familymodels,Σ-Memadaptstocounterfactualreliabilityshiftsandgeneralizestounseenpeersandtaskdomains.DirectmemoryreadoutsalsooutperformmajorityvotingandthebestfixedpeeroverthefullOODevaluationset.Moreover,performanceimprovesconsistentlyasmorecorrectnessfeedbackbecomesavailable,indicatingthatΣ-Memprogressivelyaccumulatesactionablereliabilityinformation.TheseresultsestablishreliabilitymemoryasareusablefoundationforadaptivecoordinationinLLM-basedmulti-agentsystems.
View arXiv pageView PDFAdd to collection
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2607.27958 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2607.27958 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2607.27958 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Governed Shared Memory for Multi-Agent LLM Systems
This paper introduces MemClaw, a governed shared memory architecture for multi-agent LLM systems, formalizing failure modes like unauthorized leakage and stale propagation, and evaluating the system via the ArgusFleet harness.
AdMem: Advanced Memory for Task-solving Agents
This paper introduces AdMem, a unified memory framework for LLM-based agents that integrates semantic, episodic, and procedural memory with a bi-level short-term and long-term store, using a multi-agent architecture for automatic memory generation and adaptive retrieval. Experiments show improved robustness and success on long multi-turn tasks.
RecMem: Recurrence-based Memory Consolidation for Efficient and Effective Long-Running LLM Agents
RecMem is a recurrence-based memory consolidation method for long-running LLM agents that reduces token consumption by up to 87% while improving accuracy, by only invoking LLMs when semantically similar interactions recur.
SimpleMem: Efficient Lifelong Memory for LLM Agents
Introduces SimpleMem, an efficient memory framework for LLM agents that uses semantic lossless compression to improve accuracy and reduce token consumption, achieving 26.4% F1 improvement and up to 30x reduction in inference-time token usage.
ActiveMem: Distributed Active Memory for Long-Horizon LLM Reasoning
ActiveMem introduces a distributed active memory system that decouples agent memory from the core LLM reasoning process, achieving state-of-the-art accuracy on long-horizon tasks with significantly reduced overhead.