MemCodex: Self-Programming Hierarchical Memory for Language Agents
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The Flow has not summarised this story yet — read it at arXiv Computation and Language.
arXiv:2605. 18421v2 Announce Type: replace-cross Abstract: Recent benchmarks for Large Language Model (LLM) agents mainly evaluate reasoning, planning, and execution.
Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks. Yet nearly all existing approaches, from graph-structured memories to reflective insight stores, access memory through fixed, hand-designed heuristics.
arXiv:2606. 00619v1 Announce Type: cross Abstract: Long-horizon autonomous agents require memory systems to retain historical information, track evolving states, and reuse relevant knowledge beyond finite context windows.
arXiv:2607. 13591v1 Announce Type: cross Abstract: Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.
arXiv:2606. 07909v2 Announce Type: replace Abstract: Modern large language model (LLM) agents can use external tools to help users solve complex tasks.
MemMA is a plug‑and‑play multi‑agent framework that coordinates the memory cycle of memory‑augmented LLM agents on both forward and backward paths. On the forward path, a Meta‑Thinker guides a Memory Manager for construction and a Query Reasoner for iterative retrieval. On the backward path, MemMA performs in‑situ self‑evolving memory construction, generating probe QA pairs, verifying the memory, and converting failures into repair actions before finalization. Experiments on LoCoMo show that MemMA consistently outperforms existing baselines across multiple LLM backbones and improves three different storage backends.