Skip to content

UniMem: Complementary Episodic-to-Parametric Memory for Boundary-Agnostic Task Streams

Jul 2026 · arXiv.org · Vol abs/2607.26017 · 0 citations · 29 references
Computer Science

TL;DR

Inspired by the human brain, which balances plasticity and stability through complementary episodic storage and gradual consolidation, UniMem is proposed, a self-routing framework for autonomous memory management that consistently outperforms baselines while maintaining execution fidelity.

Abstract

Memory is essential for LLM agents to accumulate task experience and reuse task-specific execution strategies. However, real-world deployment over boundary-agnostic and evolving task streams exposes a fundamental stability-plasticity dilemma. External retrieval-based memory can rapidly absorb new evidence, but it often fails to internalize recurring execution patterns and incurs inference-time retrieval overhead. Parametric memory enables stable and efficient execution once learned, but typically relies on explicit task boundaries and fixed parameter budgets. Inspired by the human brain, which balances plasticity and stability through complementary episodic storage and gradual consolidation, we propose UniMem, a self-routing framework for autonomous memory management. UniMem uses learnable routing tokens as memory controllers, enabling adaptive coordination between complementary memory pathways: novel or sparse tasks are retained in an episodic buffer for retrieval-augmented execution, while recurring and reliable patterns are consolidated into expandable parametric memory. By decoupling task identification from task execution with routing tokens and parametric memory blocks, UniMem expands memory on demand without task labels during deployment or uncontrolled parameter growth. Experiments on long-horizon streaming task sequences show that UniMem consistently outperforms baselines while maintaining execution fidelity, achieving an average gain of 4.0 EM points across three backbone models.

View source

Similar papers

Preprint Aug 2026

Where Should Experience Live? Hierarchical Hebbian Memory for Continual Vision Transformers

Vision Transformers provide strong visual representations but typically rely on slowly updated parameters, limiting their ability to organize newly acquired information across different memory timescales. This work proposes \textit{Hierarchical Hebbian Memory}, a three-level memory architecture composed of rapid Working Memory, persistent Routed Episodic Memory, and slower Semantic Memory. A learned controller regulates memory contribution, read and write routing, plasticity, retention, and consolidation. A causal read-before-write lifecycle ensures that the current outcome cannot influence the prediction it supervises. The architecture is evaluated on Omniglot 5-way 1-shot recognition and CORe50 continual object recognition. With Swin-Tiny, the hierarchical model reaches 97.39\% accuracy on Omniglot and 95.37\% final accuracy on CORe50 when combined with experience replay. Learned multi-bank retrieval reaches 47.50\% delayed-association accuracy, compared with 24.17\% for a single persistent bank and 25.00\% without memory. After intervening distractors, Episodic Memory retains approximately 0.96 cosine similarity with stored associations, while Working Memory falls to approximately 0.05. These results show that Hebbian association and learned memory routing can jointly organize online visual experience across rapid, persistent, and consolidated memory timescales within Vision Transformers.

Mohammed Yusuf Mujawar, Noorbakhsh Amiri Golilarz · 0 citations
Preprint Aug 2026

ERSkill: Evolving for Skill-Guided Adaptive Memory Retrieval

Experiments across multiple agent memory benchmarks demonstrate that ERSkill substantially outperforms strong non-evolving and self-evolving baselines.

Haolong Chen, Liangyin Zhang, Zhuodan Li et al. · 0 citations
#natural language process... Preprint Aug 2026

Dual-Layer Agentic Memory with Fast Write Routing and Slow Consolidation

Dual-Layer Agentic Memory is proposed, a framework that shifts memory management to the write phase through cost-aware epistemic routing and periodic parametric consolidation, allowing the router to adaptively suppress redundant writes as the model's epistemic boundaries evolve.

Wenzhi Li, Dong Nie, Ruiyi Lan et al. · 0 citations
Preprint Aug 2026

MemPrism: Task-Conditioned Relational Memory Views for Long-Horizon Agents

Experiments on long-horizon embodied and web-agent benchmarks show that MemPrism consistently improves the task performance, especially as trajectories become longer, while reducing memory token consumption.

Zhi-Sheng Chen, Bingfan Zeng, Bangde Cao et al. · 0 citations
Preprint Aug 2026

RippleMem: From Isolated Retrieval to Associative Recollection for Long-Term Agent Memory

RippleMem is a long-term memory system that replaces one-shot retrieval with adaptive associative recollection, Inspired by cue-dependent episodic retrieval and associative completion, that stores interaction history as cue-rich episodic memory units and organizes them in an event-centric memory graph.

Jingbo Ji, Lingyi Li, Xilong Cheng et al. · 0 citations
Preprint Aug 2026

Memory Is Not Always Needed: Characterizing Conditional Memory in Scientific Reasoning

Scientific reasoning requires language models to retrieve specialized knowledge and incorporate it reliably into multi-step computation. Conditional memory provides an explicit lookup pathway that complements dense neural representations, but its usefulness is inherently input- and computation-dependent: retrieved information may repair missing scientific associations, yet it may also introduce distracting shortcuts or interfere with reasoning that the base model can already perform correctly. In this work, we systematically investigate when, where, and to what extent conditional memory should participate in scientific reasoning. We characterize the scientific knowledge boundary and controlled interventions on memory-enabled knowledge-circuit nodes. Based on these analyses, we propose a Knowledge Boundary-Aware Router that uses task-specific input proxies available before generation to determine whether memory is activated, which layer-stage nodes receive memory signals, and how strongly these signals contribute. Experiments on biological and chemical reasoning benchmarks, covering two backbone families and six task types, show that memory effects vary substantially across inputs, tasks, and injection locations. Compared with static and activation-rate-matched random routing, our approach more consistently preserves beneficial memory contributions while suppressing memory-induced regressions, establishing selective memory allocation as an important principle for reliable scientific reasoning.

Zhen Bi, Xueshu Chen, Yan Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.