CORTEXA
← Browse
arxivcs.CLcs.LG2026-06-27

Memory-Managed Long-Context Attention: Bounded Editable Memory with a Hard Lifecycle and Calibrated Sparse Fallback

Junyi Zou, Avrova Donz

We study memory-managed long-context attention: explicit bounded memory with a learned query-independent writer, lifecycle control, query-aware reading, calibrated sparse fallback, and frozen-LLM generation from raw evidence. Track A is a controlled versioned-variable task where last-mention retrieval is wrong by construction. Its full lifecycle scores 1.000 on all three seeds versus a 0.333 lexical baseline, and generation reaches 300/300 at 146 prompt tokens, compared with 172/300 for full-context reading at 729 tokens. Track B uses held-out HotpotQA questions and train-derived, answer-excluded distractors at natural and 8.2k-word lengths. A learned two-hop selector with a bounded 32-passage cache and fallback beats dense retrieval by 5.5--16.6 F1 and reaches 102--116% of full-context F1 at 10% of the evidence words. These real-text gains come from the learned selector; the cache preserves quality at a 0--2.9 F1 cost, and static QA text does not exercise overwrite or protection. The original Llama budget gate failure and the forward-adjudicated Qwen follow-up are reported explicitly. All backbones are frozen; joint training, faithful architecture baselines, and systems measurements remain future work.

View free PDFSource page

Related papers

arxivcs.CLcs.AIcs.LG2026-06-29

MATCH: Modulating Attention via In-Context Retrieval for Long-Context Transformers

Linrui Ma, Chun Hei Lo, Xinyu Wang, Peng Lu, Xihao Yuan, Hanting Chen, et al.

The quadratic computational cost of traditional attention mechanisms poses a major bottleneck to the scalability and practical deployment of large language models (LLMs), particularly in long-context scenarios. To improve efficiency, existing approaches often enforce rigid struct…

View free PDFSource page
arxivcs.CLcs.LG2026-07-16

VarRate: Training-Free Variable-Rate KV Cache Compression for Long-Context LLMs

Shahrzad Esmat, Dhawal Shah, Ali Jannesari

The key-value (KV) cache is the main memory bottleneck in long-context large language model (LLM) inference. Two leading training-free families are both structurally limited: token-selection methods (SnapKV, Ada-KV) score importance from an observation window and evict low-scorin…

View free PDFSource page
arxivcs.LGcs.AIcs.CLcs.IR2026-07-11

Context by Distinct Information: An Auditable Dirichlet-Process Working Memory for Long, Redundant Context Streams

Siddharth Pal, Viktoria Rojkova

Context engineering decides what information a model carries forward, and current designs meter it in tokens: compressing the past into a bounded recurrent state, keeping a key-value entry for every token, or imposing a fixed budget through a window or eviction rule. All three ma…

View free PDFSource page
arxivcs.LGcs.CL2026-06-30

RaBitQCache: Rotated Binary Quantization for KVCache in Long Context LLM Inference

Wenhao Li, Jinhao Dong, Hailin Zhang, Wenhang Shi, Wei Lu, Xiaoyong Du

Long-context Large Language Model inference is severely bottlenecked by the massive Key-Value (KV) cache, yet existing sparse attention methods often suffer from static fixed-budget (Top-k) retrieval or rely on proxy scores that are computationally expensive and biased. To addres…

View free PDFSource page