Mechanistic Attention Guidance for Agent Memory Refinement
arXiv:2607. 17621v1 Announce Type: new Abstract: Existing self-evolving memory systems mainly improve agent memory based on textual outputs, such as task trajectories and reflections.
RefCon is a method for extracting higher‑quality memories in context‑evolving agents by combining sequential self‑refinement with parallel self‑contrast, without relying on gold labels. It shows strong, consistent gains on benchmarks such as AppWorld, BFCL‑V3, ACE, ReMe, and ReasoningBank, outperforming existing baselines across different model scales and even surpassing ground‑truth baselines in software engineering tasks. The approach also maintains favorable efficiency and continues to improve as more trajectories are used, unlike diversity‑only scaling which saturates earlier.
arXiv:2607. 17621v1 Announce Type: new Abstract: Existing self-evolving memory systems mainly improve agent memory based on textual outputs, such as task trajectories and reflections.
REMORY is a neural memory network that augments a textual summary of an agent’s history with a small set of soft memory tokens. These tokens, conditioned on the summary, enable a frozen large language model to approximate the continuation it would generate using the full history, effectively acting as a residual connection along the sequence dimension. Experiments on SummHay and long‑horizon agent benchmarks show that REMORY improves source attribution, maintains insight coverage, and achieves near full‑context performance while using only 5.2% of the input positions, while also reducing repeated tool outputs and errors on BrowseComp and Terminal‑Bench 2.1.
arXiv:2605. 18421v2 Announce Type: replace-cross Abstract: Recent benchmarks for Large Language Model (LLM) agents mainly evaluate reasoning, planning, and execution.
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. 06036v1 Announce Type: new Abstract: Despite recent progress, LLM agents still struggle with reasoning over long interaction histories.
arXiv:2606. 24437v1 Announce Type: new Abstract: Mixture-of-Agents (MoA) architectures improve inference-time scaling by organizing multiple LLM agents into layered reasoning pipelines.
arXiv:2610.17928v1 Announce Type: new Abstract: Recent advances in vision-language models (VLMs) have substantially improved the capabilities of GUI agents, while memory augmentation has emerged as a...
arXiv:2601. 21714v5 Announce Type: replace Abstract: The evolution of Large Language Model (LLM) agents towards System~2 reasoning, characterized by deliberative, high-precision problem-solving, requires maintaining rigorous logical integrity over extended horizons.
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.
Mixture-of-Agents (MoA) architectures improve inference-time scaling by organizing multiple LLM agents into layered reasoning pipelines. However, existing MoA variants fail to sustain gains as depth increases, exhibiting degradation, early plateauing, or saturation.
The paper introduces GraphMemory, a lightweight graph-based memory system designed to improve token efficiency in test-time continual learning for large language models. By retrieving only relevant subgraphs for each query, GraphMemory keeps the amount of retrieved memory constant as more examples are processed, avoiding the token cost and performance degradation of traditional shared-context approaches. Experiments demonstrate that GraphMemory achieves competitive downstream performance while using roughly 81‑85% fewer memory‑construction tokens than baseline methods.
arXiv:2608. 19652v1 Announce Type: new Abstract: As LLM-based agents are deployed for longer and higher-stakes tasks, their memory systems continue to have crucial gaps.