arXiv:2606. 25449v1 Announce Type: cross Abstract: A language model's memory can be worse than having no memory at all.
By Alex Kwon
A language model's memory can be worse than having no memory at all. Give a model a memory that kept a wrong conclusion but dropped the work behind it, and it emits that stale value as a confident answer; give the same model an empty memory and it abstains.
The paper introduces “Revise”, a runtime system that performs validity-guided, fine-grained recovery for online revisions in structured agent workflows. When a revision arrives, Revise intersects the change with recorded data and control dependencies, propagates the impact through the partially executed DAG, stops invalid work, preserves unaffected progress, and recomputes only the affected region. Experiments on real coding‑agent traces and LangGraph/LLMCompiler applications show that Revise matches a latest‑version oracle, reduces model calls by up to 56%, and improves service‑level objective goodput under load.
By Ruoling Qi, Xuaner Wu, Penghang Liu, Jian Chen, Yirui Liu
The paper proposes invalidation contracts to manage cached recovery suggestions in LLM agents, attaching version stamps and cacheability hints to each suggestion so stale entries can be evicted without trial and error. The protocol separates realized savings into validity (protocol‑dependent) and compliance (planner‑dependent), showing that row‑level invalidation can significantly improve first‑try compliance and recover a substantial portion of token costs across multiple models, while table‑level invalidation can be detrimental. The study evaluates the approach across seven models, three serving paths, two domains, and about 9,400 episodes, demonstrating deterministic validity and high eviction precision.
By Michael Wu, Arquimedes Canedo
The paper introduces SpecAgent, a protocol that lets a strong language model act as a reviewer rather than a generator for tool‑using agents. A weaker model drafts steps, executing read‑only tool calls to ground its proposals, while the strong model verifies the draft in a single prefill pass, committing the longest valid prefix and repairing any rejected step. Experiments on benchmarks show SpecAgent achieves near‑strong‑model performance while cutting memory traffic, wall time, and token generation.
By Zilin Wang, Yinhong Liu, Chao Chen, Qun Liu, Zhijiang Guo
The study evaluates how to best split tasks among large‑language‑model agents for cross‑border VAT determination, comparing one broad agent to configurations ranging from one to five narrow agents. Across 4,400 runs—including token‑matched and failure‑injection scenarios—the intermediate configurations achieved the highest accuracy but did not surpass the fine‑endpoint benchmark, leaving the optimal decomposition hypothesis unconfirmed. The pilot provides a preregistered heuristic for right‑sizing decomposition, along with an oracle, dataset, and analysis pipeline.
By Pedro Santos