arXiv (All)
open access
Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell
and-cluster-computingartificial-intelligencec-4computation-and-languagedistributedi-2-11i-2-7machine-learning
Decomposing long-context inference across cooperating agents bounds the active KV cache per call rather than total evidence, which matters when KV-cache memory binds. Many such systems add a persistent tier storing and recalling reasoning traces, usually validated by an ablation reporting an accurac
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell#1210262
- Learning to Remember: End-to-End Training of Memory Agents for Long-Context Reasoning#820369
- TRACE: Governing Memory Validity in Evolving Multi-Agent Systems#1118229
- Evaluating Memory Structure in LLM Agents#998107
- Experience Compression Spectrum: Unifying Memory, Skills, and Rules in LLM Agents#31330
Record · ID 1217157
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive