MemSlides: A Hierarchical Memory Driven Agent Framework for Personalized Slide Generation with Multi-turn Local Revision
- URL: http://arxiv.org/abs/2606.17162v1
- Date: Mon, 15 Jun 2026 18:02:55 GMT
- Title: MemSlides: A Hierarchical Memory Driven Agent Framework for Personalized Slide Generation with Multi-turn Local Revision
- Abstract summary: We propose MemSlides, a hierarchical memory framework for personalized presentation agents.<n>User profile memory stores intent-conditioned profiles for round-0 personalization, working memory carries active preferences and session constraints.<n>MemSlides pairs this memory design with scoped slide-local revision, so targeted updates act on the smallest affected region.
- Score: 50.30742645266505
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Personalized presentation generation requires more than conditioning on a current prompt or template: agents must preserve stable user preferences across tasks, retain newly introduced preferences and constraints during multi-turn revision, and carry out local edits reliably. We propose MemSlides, a hierarchical memory framework for personalized presentation agents that separates long-term memory from working memory and further divides long-term memory into user profile memory and tool memory. User profile memory stores intent-conditioned profiles for round-0 personalization, working memory carries active preferences and session constraints across revision rounds, and tool memory stores reusable execution experience for reliable localized editing. MemSlides pairs this memory design with scoped slide-local revision, so targeted updates act on the smallest affected region instead of repeatedly regenerating the full deck. In controlled experiments, user profile memory improves persona-alignment judgments on a multi-persona, multi-intent profile bank, tool-memory injection improves closed-loop modify behavior in diagnostic matched-pair settings, and qualitative cases illustrate working memory's ability to carryover preferences. Taken together, these results suggest that effective personalization in presentation authoring depends on separating persistent user profiles, session-level working memory, and reusable execution experience across generation and localized revision.
Related papers
- MemPrism: Task-Conditioned Relational Memory Views for Long-Horizon Agents [14.296334759650918]
Long-horizon agents rely on memory to reuse experiences, yet existing memory systems assume that evidence can be directly consumed through a fixed representation.<n>MemPrism is a task-conditioned relational memory framework that separates persistent experience storage from decision-time working memory.<n>MemPrism consistently improves the task performance, especially as trajectories become longer, while reducing memory token consumption.
arXiv Detail & Related papers (2026-08-07T03:13:43Z) - EvoGraph-Mem: Failure-Aware Editable Graph Memory for Long-Term Language Agents [4.265255679736993]
Existing memory-augmented agents mainly focus on storing and retrieving past experience.<n>Previously distilled insights can become outdated, over-generalized, or harmful under new task contexts.<n>We propose a failure-aware memory maintenance framework based on an editable insight graph.
arXiv Detail & Related papers (2026-08-03T12:35:44Z) - MEMPROBE: Probing Long-Term Agent Memory via Hidden User-State Recovery [58.64329475683699]
We argue that long-term memory should be evaluated as an auditable post-interaction artifact.<n>We instantiate this view in MEMPROBE, a benchmark in which a memory-equipped agent assists simulated users.<n>We find that successful assistance and recoverable memory behave as distinct capabilities.
arXiv Detail & Related papers (2026-06-23T13:52:46Z) - Memory Retrieval for Changing Preferences [19.459455322636025]
We propose a unified framework for memory access and selection based on changing preferences.<n>We quantify the utility of each memory turn using a Bayes factor.<n>Our approach outperforms existing embedding-based retrieval on long-context, preference-intensive tasks.
arXiv Detail & Related papers (2026-06-02T00:29:12Z) - Learning User-Aware Recall: Personalized Retrieval in Long-Term Conversational Memory [15.297367578990903]
Profile-guided Personalized Retrieval Optimization (PPRO) builds episodic and semantic memory banks from dialogue histories.<n>PPRO serves as an explicit personalized prior in memory ranking, allowing retrieval to account for stable user attributes, preferences, and relationships.<n>Experiments on LoCoMo and LongMemEval-S show consistent gains over training-free memory systems.
arXiv Detail & Related papers (2026-05-28T06:47:48Z) - MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models [56.31411457917676]
We introduce MemGuard, a type-aware memory framework that preserves functional memory boundaries during memory construction and retrieval.<n>Across hallucination and long-horizon conversation benchmarks, MemGuard improves memory reliability by up to 28.27% while retrieving up to 5.8x fewer memory tokens than prior methods.
arXiv Detail & Related papers (2026-05-27T06:04:19Z) - Personalize-then-Store: Benchmarking and Learning Personalized Memory for Long-horizon Agents [20.22872890297194]
Existing large language model (LLM) based memory systems apply universal, static policies that overlook a fundamental reality: the contexts that are worth storing in memory are different across users.<n>We introduce PerMemBench, the first benchmark for evaluating personalized memory systems.<n>We propose session level storage gating, a lightweight framework that selectively bypasses memory operations for transient sessions.
arXiv Detail & Related papers (2026-05-25T07:48:33Z) - Learning How and What to Memorize: Cognition-Inspired Two-Stage Optimization for Evolving Memory [53.8372503928207]
Large language model (LLM) agents require long-term user memory for consistent personalization.<n>Existing memory systems mainly rely on static, hand-crafted update rules.<n>We introduce MemCoE, a cognition-inspired two-stage optimization framework that learns how memory should be organized and what information to update.
arXiv Detail & Related papers (2026-05-01T14:45:20Z) - From Recall to Forgetting: Benchmarking Long-Term Memory for Personalized Agents [38.52713500119118]
We introduce Memora, a long-term memory benchmark spanning weeks to months long user conversations.<n>The benchmark evaluates three memory-grounded tasks: remembering, reasoning, and recommending.<n>Forgetting-Aware Memory Accuracy (FAMA) is a metric that penalizes reliance on obsolete or invalidated memory.
arXiv Detail & Related papers (2026-04-21T21:31:01Z) - MemoryArena: Benchmarking Agent Memory in Interdependent Multi-Session Agentic Tasks [55.145729491377374]
Existing evaluations of agents with memory typically assess memorization and action in isolation.<n>We introduce MemoryArena, a unified evaluation gym for benchmarking agent memory in multi-session Memory-Agent-Environment loops.<n> MemoryArena supports evaluation across web navigation, preference-constrained planning, progressive information search, and sequential formal reasoning.
arXiv Detail & Related papers (2026-02-18T09:49:14Z) - OP-Bench: Benchmarking Over-Personalization for Memory-Augmented Personalized Conversational Agents [55.27061195244624]
We formalize over-personalization into three types: Irrelevance, Repetition, and Sycophancy.<n>Agents tend to retrieve and over-attend to user memories even when unnecessary.<n>Our work takes an initial step toward more controllable and appropriate personalization in memory-augmented dialogue systems.
arXiv Detail & Related papers (2026-01-20T08:27:13Z) - Fine-Mem: Fine-Grained Feedback Alignment for Long-Horizon Memory Management [63.48041801851891]
Fine-Mem is a unified framework designed for fine-grained feedback alignment.<n> Experiments on Memalpha and MemoryAgentBench demonstrate that Fine-Mem consistently outperforms strong baselines.
arXiv Detail & Related papers (2026-01-13T11:06:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.