Jun 2026· 2026 7th International Conference on Artificial Intelligence and Electromechanical Automation (AIEA)· pp. 1135-1139· 2 citations· 29 references
TL;DR
Structured Experience Compression (SEC), a lightweight method that distills each trajectory into a four-field unit encoding the task type, key decisions, failure reason, and repair action, is proposed, suggesting potential suitability for long-lived deployment settings.
Abstract
Retrieval-augmented experience replay is an emerging approach for the parameter-free adaptation of large language model (LLM) agents at inference time. However, injecting raw multi-step trajectories into the agent's context is costly and risks flooding the prompt with irrelevant details as the experience pool grows. We propose Structured Experience Compression (SEC), a lightweight method that distills each trajectory into a four-field unit encoding the task type $(T)$, key decisions $(D)$, failure reason $(F)$, and repair action $(R)$. At inference time the top- $k$ units closest to the current task are retrieved and appended to the prompt. Experiments on ALFWorld and WebShop show that SEC outperforms rawtrajectory retrieval by 7.7 percentage points on ALFWorld and by an absolute reward gain of 0.056 on WebShop, while consuming only 37% of the context tokens. SEC also degrades more gracefully when the pool contains noisy or mismatched records, suggesting potential suitability for long-lived deployment settings.
Long-term memory enables LLM agents to leverage past interactions, but dialogue histories quickly exceed the context window, forcing agents to retrieve relevant subsets at query time. Because useful evidence is sparse and scattered across verbose conversations, retrieval faces a fundamental tension: broadening recall improves coverage but floods downstream reasoning with noise, while compressing memories at write time eases retrieval but irreversibly discards details that future queries may need. We introduce LazyMem, which resolves this tension by deferring all memory construction to query time. Given a retrieved candidate pool, a lightweight model processes it in overlapping parallel windows, selectively retaining and compressing only query-relevant content. The model is trained with supervised fine-tuning followed by reinforcement learning, using a reward that jointly encourages the identification of relevant messages and the generation of compressions that are faithful to the source and useful for answering the query. On LongMemEval, LazyMem-4B achieves an LLM-judge accuracy of 0.85, outperforming the strongest non-oracle baseline while using only 213 answer-context memory tokens, 21.0 times fewer than the baseline. It further generalizes to LoCoMo without target-domain training and reduces mean latency relative to the prior query-time baseline. Code is available at https://github.com/allacnobug/LazyMem.
Jing Yu, Yibo Zhao, Jiaming Zhang et al.· 1 citation
Agentic retrieval workflows produce query, retrieval, and stopping traces as a byproduct of answering questions. We study how these traces can adapt a deployed dense retriever to changing workflow distributions without new relevance labels, synthetic queries, or LLM judgments. We introduce Navigation-Informed Embeddings (NIE), a family of trace-derived objectives. NIE-Stop turns the stopping document into a soft positive; NIE-Path additionally uses preceding path documents as hard comparisons and imposes ordinal constraints with geometric decay. A BGE encoder adapted from retained source trajectories improves support Recall@20 on an independent target benchmark from 72.2 to 78.0 overall. NIE-Stop reaches 76.9 overall and 52.3 on long paths; NIE-Path raises long-path performance to 55.4, compared with 46.7 for the unadapted encoder. A shuffled-order control under the full path objective loses 3.2 points. Without public-benchmark training, the same adapter also improves nDCG@10 by 1.9 points on standard BEIR HotpotQA. NIE therefore provides a lightweight adaptation channel for settings where trajectories are already retained, with zero incremental labeling cost.
This work proposes a novel Human-profile Enhanced Retrieval Optimization framework for long-term agent memory (HERO), which converts the dialogue history into a traceable heterogeneous memory graph that preserves raw dialogue text as evidence for reasoning, thereby mitigating information loss.
Yuanhua Lin, Yile Li, Zhiyuan Zhao et al.· 0 citations
Pro-LONG, a minimal context management framework built around programmatic memory for LLM agents in long-horizon, exploratory settings, is proposed, which addresses the tradeoff of preserving more information makes retrieving relevant details less tractable.
A. Fox, Junlin Wang, P. Rosu et al.· 2 citations· ⚡1
Large language model (LLM) agents increasingly use external memory systems to support personalization by drawing on long and evolving interaction histories, in which user preferences may be distributed across time, change with context, and conflict with earlier evidence. However, existing systems face three limitations: fixed-turn, fixed-token, or session-based boundaries can mix unrelated dialogue or split an event from its causes, decisions, and outcomes; storing multiple pieces of user information from the same interaction as a single memory binds together items that serve different functions and should be independently retrievable; and treating the current task as a single top-$k$ retrieval query can return fragments that are individually relevant but fail to jointly capture preference evolution, temporal validity, and contextual applicability. We introduce \textsc{QUMem}, a structured memory framework for query-conditioned user-state inference. \textsc{QUMem} first segments interaction histories into variable-length episodes according to semantic continuity, then decomposes each episode into independently retrievable factual, preference, and transferable insight memories while preserving temporal positions and source evidence. At inference time, three sequential agents identify task-specific information needs, plan multi-query retrieval over the typed memory stores, and jointly infer a temporally and contextually valid user state for downstream response generation. \textsc{QUMem} achieves state-of-the-art performance on both PersonaMem and KnowU-Bench, demonstrating the effectiveness of query-conditioned user-state inference for long-term personalization.
Heng Wang, Yifei Li, Lingling Zhang et al.· 0 citations