MemRefine: LLM-Guided Compression for Long-Term Agent Memory
Summary
MemRefine is an LLM-guided framework for compressing long-term agent memory under fixed storage budgets, using similarity for candidate pairing and an LLM judge for factual deletion/merge decisions, outperforming rule-based baselines on benchmarks.
View Cached Full Text
Cached at: 06/12/26, 08:51 AM
# MemRefine: LLM-Guided Compression for Long-Term Agent Memory Source: [https://arxiv.org/abs/2606.13177](https://arxiv.org/abs/2606.13177) [View PDF](https://arxiv.org/pdf/2606.13177) > Abstract:Large language model \(LLM\) agents are increasingly expected to operate over long\-term interactions, where information from past dialogues must be preserved and recalled to support future tasks\. However, as interactions accumulate, the memory store grows without bound and fills with redundant entries that inflate storage cost and degrade retrieval by crowding out the most useful evidence\. Furthermore, this is especially limiting on resource\-constrained platforms with hard memory budgets, motivating us to formulate storage\-budgeted memory management, the task of keeping an already constructed memory store within a fixed budget while preserving information useful for future interactions\. To this end, we then propose MemRefine, an LLM\-guided framework that, since surface similarity poorly reflects factual value, uses similarity only to propose candidate pairs and defers delete, merge, and preserve decisions to an LLM judge based on factual content, iterating until the budget is met\. Across multiple memory frameworks and long\-term conversation benchmarks, MemRefine consistently meets target budgets while preserving downstream performance and outperforming rule\-based baselines under tight budgets\. ## Submission history From: Minjae Kim \[[view email](https://arxiv.org/show-email/f165dd1d/2606.13177)\] **\[v1\]**Thu, 11 Jun 2026 10:46:17 UTC \(629 KB\)
Similar Articles
RecMem: Recurrence-based Memory Consolidation for Efficient and Effective Long-Running LLM Agents
RecMem is a recurrence-based memory consolidation method for long-running LLM agents that reduces token consumption by up to 87% while improving accuracy, by only invoking LLMs when semantically similar interactions recur.
SimpleMem: Efficient Lifelong Memory for LLM Agents
Introduces SimpleMem, an efficient memory framework for LLM agents that uses semantic lossless compression to improve accuracy and reduce token consumption, achieving 26.4% F1 improvement and up to 30x reduction in inference-time token usage.
MemGym: a Long-Horizon Memory Environment for LLM Agents
MemGym is a benchmark for evaluating memory formation in LLM agents over long-horizon tasks, unifying existing agent gyms and synthetic pipelines with memory-isolated scores. It spans tool-use dialogue, multi-turn search, coding, and computer use, and includes a lightweight reward model (MemRM) for efficient evaluation.
AdMem: Advanced Memory for Task-solving Agents
This paper introduces AdMem, a unified memory framework for LLM-based agents that integrates semantic, episodic, and procedural memory with a bi-level short-term and long-term store, using a multi-agent architecture for automatic memory generation and adaptive retrieval. Experiments show improved robustness and success on long multi-turn tasks.
Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents
MRAgent introduces a novel graph-based memory framework that dynamically reconstructs memory during reasoning, achieving up to 23% improvement on long-horizon benchmarks while reducing computational costs.