Beyond Memory Majority: Latent-Source Reasoning for Multi-Agent Memory Arbitration

• URL: http://arxiv.org/abs/2608.19701v1
• Date: Thu, 20 Aug 2026 06:50:23 GMT
• Title: Beyond Memory Majority: Latent-Source Reasoning for Multi-Agent Memory Arbitration
• Abstract summary: Existing memory methods treat retrieved memories as independent evidence and combine them through voting or weighting.<n> memories written by different agents may inherit the same upstream source or shared bias, causing correlated evidence to be repeatedly counted and creating a false majority.<n>We propose textbfCorrelation-textbfAware textbfMemory textbfArbitration (CAMA) framework that jointly decouples retrieved memories and recovers missing independent evidence.
• Score: 1.1803729553124735
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Long-term multi-agent systems continuously accumulate the memories produced by different agents. Existing memory methods typically treat retrieved memories as independent evidence and combine them through voting or weighting. However, this independence assumption often fails in multi-agent settings: memories written by different agents may inherit the same upstream source or shared bias, causing correlated evidence to be repeatedly counted and creating a false majority. We term this failure mode \textit{Memory Correlation Bias}. To address the issue, we propose the \textbf{C}orrelation-\textbf{A}ware \textbf{M}emory \textbf{A}rbitration (CAMA) framework that jointly decouples retrieved memories and recovers missing independent evidence. We model the retrieved memories as query-conditioned evidence groups and combine neural dependency inference with provenance-based symbolic priors to estimate the effective number of independent evidence sources, thereby preventing correlated memories from forming a false majority. Since critical independent evidence may be absent from the initial retrieval set, \textsc{CAMA} further learns a sequential recovery policy that actively retrieves alternative evidence or traces upstream sources before making the final decision, aiming to recover sufficient independent evidence for reliable arbitration while minimizing retrieval cost. Experiments on multiple benchmarks demonstrate the superiority of our method over the state-of-the-art baseline methods, suppressing false majorities induced by correlated memories.

Related papers

• Navigating Sparse Evidence: Agentic Visual RAG via Explicit Context Selection and Consolidation [50.92223196290564]
  We propose a unified agent loop for explicit evidence selection and consolidation.<n>During exploration, SCoRE retains only query-relevant observations and their source pointers in a maintained textual ledger.<n>At termination, it reloads the referenced original images and consolidates the visual evidence for answering, arranging it into a logical sequence.
  arXiv  Detail & Related papers  (2026-09-14T16:11:35Z)
• GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory [87.58855368314693]
  We propose GraphMemix, a graph memory framework that models memory organization as query-aware evidence-forest construction.<n> Experimental results across four long-term multimodal memory benchmarks demonstrate significant improvements with different foundation models.
  arXiv  Detail & Related papers  (2026-08-27T11:28:49Z)
• SAGE: From Direct Answering to Evidence-Grounded Inference for Chinese Ancient Document Understanding [61.02068339726333]
  We propose SAGE, an evidence-grounded multi-agent framework for Chinese ancient document understanding.<n>SAGE coordinates specialized agents for task-aware planning, tool-mediated evidence acquisition, claim-level verification, and bounded replanning.<n> Experiments on the AncientDoc benchmark show that SAGE consistently outperforms matched direct-answering baselines.
  arXiv  Detail & Related papers  (2026-08-25T03:01:51Z)
• REVEAL: A Rubric-Guided Agent for Explicit Evidence Sufficiency Verificationin Long-Video Question Answering [25.519927761448603]
  REVEAL is a rubric-guided agent framework for long-video question answering.<n>We introduce an adaptive visual-similarity-based preprocessing pipeline that groups visually coherent adjacent frames into natural event units.<n>Built upon this structured memory, REVEAL uses an automatically constructed rubric library to explicitly verify whether retrieved evidence satisfies sufficiency criteria.
  arXiv  Detail & Related papers  (2026-08-09T09:55:42Z)
• ViSAGE: Constructing Self-Correcting Memories for Long-Form Video Understanding [11.461394531496397]
  ViSAGE is a multimodal agentic memory framework that constructs self-correcting, entity-centric memories.<n>It applies bidirectional memory refinement to propagate delayed identity evidence, retroactively unifying historical records and improving future reasoning.<n>Extensive results demonstrate that ViSAGE consistently outperforms the strongest baseline, achieving 5.9% higher accuracy.
  arXiv  Detail & Related papers  (2026-07-29T10:25:23Z)
• Mitigating Provenance-Role Collapse in Long-Term Agents via Typed Memory Representation [33.47493976010677]
  We propose MemIR, a typed Memory Intermediate Representation that operationalizes source monitoring as a structural constraint.<n>MemIR writes long-term memory into grounded atoms that separate raw evidence, retrieval cues, and truth-bearing claims.<n>Experiments on LoCoMo and BEAM-100K demonstrate that MemIR consistently outperforms existing memory baselines.
  arXiv  Detail & Related papers  (2026-05-25T13:56:31Z)
• SMMBench: A Benchmark for Source-Distributed Multimodal Agent Memory [34.330518284737806]
  Existing benchmarks for multimodal memory reasoning largely evaluate systems within pre-assembled contexts.<n>We argue that source-distributed memory composition is an important and under-examined bottleneck in multimodal agent memory.<n>We introduce Source-distributed Multimodal Memory Benchmark which measures whether agents can retrieve, align, and compose multimodal evidence scattered across multiple sources.
  arXiv  Detail & Related papers  (2026-05-15T08:00:46Z)
• Belief Memory: Agent Memory Under Partial Observability [56.41506249481312]
  We propose BeliefMem, which shifts the memory paradigm from committing to a single conclusion per observation to retaining multiple candidate conclusions with their probabilities.<n> BeliefMem preserves the uncertainty that the deterministic paradigm discards, enabling the agent to act with high confidence.<n> Empirical evaluations on LoCoMo and ALFWorld benchmarks show that, even with limited data, BeliefMem achieves the best average performance.
  arXiv  Detail & Related papers  (2026-05-07T02:03:13Z)
• Evoking User Memory: Personalizing LLM via Recollection-Familiarity Adaptive Retrieval [59.295767860331004]
  RF-Mem is a familiarity uncertainty-guided dual-path memory retriever.<n>It embeds human-like dual-process recognition into the retriever.<n>It consistently outperforms one-shot retrieval and full-context reasoning under fixed budget and latency constraints.
  arXiv  Detail & Related papers  (2026-03-10T06:31:44Z)
• AMA: Adaptive Memory via Multi-Agent Collaboration [54.490349689939166]
  We propose Adaptive Memory via Multi-Agent Collaboration (AMA), a novel framework that leverages coordinated agents to manage memory across multiple granularities.<n>AMA significantly outperforms state-of-the-art baselines while reducing token consumption by approximately 80% compared to full-context methods.
  arXiv  Detail & Related papers  (2026-01-28T08:09:49Z)
• Agentic Learner with Grow-and-Refine Multimodal Semantic Memory [50.81667005063605]
  ViLoMem is a dual-stream memory framework that constructs compact, schema-based memory.<n>It encodes visual distraction patterns and logical reasoning errors, enabling MLLMs to learn from their successful and failed experiences.
  arXiv  Detail & Related papers  (2025-11-26T18:55:08Z)
• Natural Logic-guided Autoregressive Multi-hop Document Retrieval for Fact Verification [21.04611844009438]
  We propose a novel retrieve-and-rerank method for multi-hop retrieval. It consists of a retriever that jointly scores documents in the knowledge source and sentences from previously retrieved documents. It is guided by a proof system that dynamically terminates the retrieval process if the evidence is deemed sufficient.
  arXiv  Detail & Related papers  (2022-12-10T11:32:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.