Cooperative Memory Paging with Keyword Bookmarks for Long-Horizon LLM Conversations 文章

ArXiv CS.CL2026-05-26NEWSen作者: Ziyang Liu

详细信息

来源站点
ArXiv CS.CL
作者
Ziyang Liu
文章类型
NEWS
语言
en
发布日期
2026-05-26

摘要

arXiv:2604.12376v2 Announce Type: replace Abstract: When LLM conversations grow beyond the context window, old content must be evicted -- but how does the model recover it when needed? We propose cooperative paging: evicted segments are replaced with minimal keyword bookmarks ([pN:keywords], ~8-24 tokens each), and the model is given a recall() tool to retrieve full content on demand. On the LoCoMo benchmark (10 real multi-session conversations, 300+ turns), cooperative paging achieves the highest answer quality among six methods -- outperforming truncation, BM25, word-overlap retrieval, a search-tool baseline, and full context -- on four models (GPT-4o-mini, DeepSeek-v3.2, Claude Haiku, GLM-5), confirmed by four independent LLM judges ($p=0.017$, paired bootstrap). We then study the paging design space with a 5x4 ablation over boundary strategies and eviction policies (3,176 synthetic probes, 1,600 LoCoMo probes). Key findings: (1) coarse fixed-size pages (fixed_20) reach 96.