arXiv AI

RefCon: Iterative Refinement and Contrastive Memory Extraction for Context-Evolving Agent

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 AI
Oct 9

REMORY: Learning Residual Memory for Context Compaction

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.

By Hanchen Xia, Baoyou Chen, Yutang Ge, Naihao Deng, Senqiao Yang, Zilong Dong, Weihao Yuan, Siyu Zhu
arXiv AI
Jul 16

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

arXiv:2607. 13591v1 Announce Type: cross Abstract: Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.

By Eric Hanchen Jiang, Zhi Zhang, Yuchen Wu, Levina Li, Dong Liu, Xiao Liang, Rui Sun, Yubei Li, Edward Sun, Haozheng Luo, Zhaolu Kang, Aylin Caliskan, Kai-Wei Chang, Ying Nian Wu
arXiv AI
Oct 5

Decoupling Memory from Context: Structured Memory for Token-Efficient Test-Time Continual Learning

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.

By Yehya Farhat, Michael Desmond, Anastasios Kyrillidis