arXiv:2609.36435v1 Announce Type: new
Abstract: An assistant that serves the same user over a long horizon has to answer from what that user has revealed: which preferences still hold, which were rev...
By Jingxuan Wu, Yuzhe Yang, Yiqiao Huang, Chengzhi Liu, Qingni Wang, Chengxuan Qian, Shutong Wu, Jiawei Zhang, Xin Eric Wang
Latent Compaction is a test‑time training method that learns a compact, document‑specific key–value cache for large‑context language models. It initializes cache entries using reconstruction importance, teacher attention, and key‑space diversity, then fits attention outputs and log‑normalizers to the full cache before jointly optimizing the entire cache via end‑to‑end distillation. Experiments on RULER, LongBench, and Phonebook Lookup show significant accuracy gains over budget‑matched compression baselines, achieving 96.7% accuracy at 32× compression on RULER and transferring well across model scales and families.
By Yingfa Chen, Xingyu Shen, Chaojun Xiao, Xu Han
arXiv:2610.33025v1 Announce Type: cross
Abstract: Letting a language model take gradient steps on the text it is reading, known as dynamic evaluation, lowers its loss on the rest of the document. Its...
By Surya Saka
The paper introduces REM (Reusable Experience Memory), a framework that manages the lifecycle of experience for large language model agents performing long-horizon coding tasks. REM consolidates completed trajectories into compact, phase-structured documents, injects them at task start, and evicts them after a single exposure, making the memory system responsive to the agent’s needs. Experiments on repository-level bug fixing show REM outperforms state‑of‑the‑art memory systems in retrieval accuracy and task resolution while reducing cost.
By Xinyi Lisa Chen, Pedro Herrero-Vidal, Xiaohan Chen, Xiaojing Yu, Cris Liu, Bingqing Song, Bin Xu, Suleiman A. Khan, You-Lin Chen
arXiv:2610.14754v1 Announce Type: new
Abstract: Hybrid language models interleave Gated DeltaNet (GDN) layers, whose recurrent memory has a fixed size, with full-attention layers, whose key-value (KV...
By Junjie Li, Jiong Lou, Jie Li
The paper introduces Declarative Attention (DA), a protocol that lets language models explicitly declare which parts of their context to focus on during generation. By partitioning decoding into full-context, region-specific, and recent-output-only modes, the inference engine can skip large portions of the KV cache, dramatically reducing attended tokens. Experiments on 15 long-context tasks with off-the-shelf models show significant savings (52.0% and 31.1% reductions) with only modest accuracy drops that diminish as model size increases.
By Namgyu Ho, Huzama Ahmad, Woosung Koh, Se-Young Yun, Tal Schuster, Cicero Nogueira dos Santos