arXiv Machine Learning

BudgetBench: A Budget-Tiered Protocol and Pilot Harness for Memory Strategy Evaluation in Local Large Language Model Agents

arXiv AI
Oct 31

When Stored Evidence Stops Being Usable: Scale-Conditioned Evaluation of Agent Memory

The paper introduces a scale‑conditioned evaluation protocol for agent memory that measures how usable evidence degrades as irrelevant sessions accumulate. It logs memory trajectories and reports four diagnostics—budget‑compliant reliability, tail memory‑call burden, failure‑regime decomposition, and the usable‑scale boundary. Experiments on LongMemEval and LoCoMo show that reliability loss varies across memory interfaces and agents, highlighting that scalable‑memory claims must be conditioned on agent, interface, scale range, and interaction budget.

By Jiaqi Shao, Yiyi Lu, Yunzhen Zhang, Bing Luo
arXiv AI
Sep 3

HeadWiseKV: Budgeted Per-Head Cache Residency for Hybrid Long-Context Language Models

HeadWiseKV is a training‑free framework that compresses the residual global key–value caches of hybrid long‑context language models by assigning each physical KV head a static, multilevel history window. It formulates cache allocation as a restricted operational rate–distortion problem and uses the SeqCalib algorithm to generate per‑head residency policies that account for interactions across layers. In evaluations on four hybrid models, HeadWiseKV preserves near‑full‑KV quality while reducing peak device memory usage by 8.59% at a 112K context length and extending the largest verified context from 114K to 161K.

By Renjie Xie, Juncheng Yang, Aoting Hu, Mingxi Zhang, Liyao Wu, Zheheng Hong, Wei Xu
arXiv AI
Sep 12

SemVerBench: Benchmarking LLM Comprehension of Version-Constraint Resolution Semantics

SemVerBench is a benchmark that evaluates how well large language models (LLMs) understand and apply version-constraint resolution semantics, such as determining whether a version satisfies constraints like ^1.2.3 or >=2.0. The study finds that many models struggle with certain corner cases, with GPT‑5.1 performing poorly while Claude and Opus perform much better. The authors suggest that the failures stem from an activation/application gap rather than a lack of knowledge, and recommend that coding agents delegate version resolution to a dedicated resolver tool.

By Qibai Chen, Zeming Liu
arXiv Computation and Language
Oct 16

From Long Context to Selective Memory:A Survey of Memory-Centric Compression for Large Language Models

The paper surveys memory‑centric compression techniques for large language models, framing long‑context handling as a memory‑management problem. It distinguishes compute‑active memory from compute‑inactive memory, and models operations such as writing, offloading, recall, and forgetting as state transitions within an information lifecycle. The authors propose a unified cost model and argue that future research should focus on dynamic, lifecycle‑aware memory management rather than static compression.

By Chaogui Gou