Skip to content

BOOKMARKS: Efficient Active Storyline Memory for Role-playing

May 2026 · arXiv.org · Vol abs/2605.14169 · 0 citations · 55 references
Computer Science

TL;DR

A search-based memory framework called BOOKMARKS for active grounding, which retains access to the full preceding storyline and collects task-relevant information on demand, and improves next-action fidelity in a five-dimensional evaluation.

Abstract

Memory systems are critical for role-playing agents (RPAs) to maintain long-horizon consistency. However, existing RPA memory methods (e.g., profiling) mainly rely on incremental summarization, whose compression discards details which become inaccessible to subsequent grounding. To address this issue, we propose a search-based memory framework called \textbf{\underline{BOOKMARKS}} for \textbf{active grounding}, which retains access to the full preceding storyline and collects task-relevant information on demand. Since summarizing the preceding storyline anew for each grounding request incurs substantial redundant computation, BOOKMARKS introduces \textbf{passive updating} to reuse earlier search results as checkpoints. Each \textbf{bookmark} represents the \textbf{content} about a particular aspect (\textbf{section}) of story information at a specific synchronization \textbf{point}. For current task, BOOKMARKS searches for only useful contents, reuses existing semantically equivalent bookmarks or initializes new ones, and synchronizes the selected ones from their stored checkpoints to the current scene. A reused bookmark thus only needs to process the newly observed storyline suffix, avoiding repeated synchronization. We evaluate BOOKMARKS across six narrative artifacts involving 47 characters and 9,537 test cases against non-active grounding baselines, covering next-action prediction and challenging, human-authored reasoning questions from a mystery game. BOOKMARKS improves next-action fidelity in a five-dimensional evaluation (emotion, intent, causality, position, and content) and raises mystery-game reasoning accuracy from 39.44\% to 45.42\% over the strongest baseline.

View source

Similar papers

Preprint Sep 2026

TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agents

GUI agents accumulate high-resolution screenshots as the trajectory unfolds, increasing inference latency and memory usage. Training-free visual token pruning can reduce this cost, but cache reuse introduces a fundamental constraint. Once tokens are discarded, the corresponding visual evidence cannot be recovered witho...

Yu-Hao Wang, Mu Qiao, Xin-Dong Zhang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

MemForest: Efficient Agent Memory Management via EventTree Partitioning and Progressive Merging

This work proposes a general memory compression framework adaptable to various agent memory systems, MemForest, and introduces an anchor-guided propagation retrieval mechanism that retrieves relevant memory nodes from the temporal neighborhoods of key nodes, improving retrieval accuracy.

Junxi Wang, Te Sun, Jiayi Zhu et al. · 0 citations
Preprint Aug 2026

ACE: A Self-Correcting Agentic Canvas Editor for Multi-Slide Presentation Automation

Commercial design platforms increasingly edit documents through large language model (LLM) agents, but two practical problems block reliable deployment: legacy document formats expose only \emph{flat}, absolutely positioned elements, so agents must recompute coordinates and routinely break layouts; and design has no un...

Jooyoung Jang, Taegyeong Lee, Jihyeon Park et al. · 0 citations
#artificial intelligence Preprint Oct 2026

VAMR: Multi-Question Agentic Reasoning for Efficient Long-Form Video Understanding

Long-form video understanding often involves multiple questions about different aspects of the same recording. Yet existing video agents typically process each question through an isolated tool-use trajectory. This repeatedly restarts video exploration and memory construction, missing opportunities to acquire evidence...

Run-Quan Gui, Han-Zhu Chen, Ze-Hao Wang et al. · 0 citations
#natural language process... Preprint Sep 2026

Beyond Memory Construction: Rethinking Memory Access for LLM-based Conversational Agents

This work proposes Threader, a memory system that shifts the focus from memory construction to efficient, structure-aware access over raw interactions, and preserves them as first-class memory, organizes them into topic-coherent segments via lightweight incremental segmentation, and enables accurate retrieval through m...

Dong-Hua Cai, Yong-Heng Deng, Yi-Fei Wang et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 22, 2026

Flint-interactive: A language for creating interactive data visualizations

Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

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