arXiv Computation and Language By Egor Pakhomov, Erik Nijkamp

Bookkeeping, Composition, or Unreachable Gold? Reading MemoryAgentBench's Conflict-Resolution Scores Against a Frozen Last-Write Resolver

Read the original on arXiv Computation and Language →

The paper evaluates MemoryAgentBench’s Conflict‑Resolution split by applying the benchmark’s own rule—where the newest statement about a fact wins—using a frozen last‑write resolver. This rule correctly answers 80.25 % of the questions (74.5 % on the three held‑out lists). For the remaining 67 items, the gold answer is unreachable by the last‑write graph but would be reachable if overwritten statements were considered; these items comprise a third of the multi‑hop questions. The authors compare this baseline to two long‑context models and an approximate BM25 agent, reporting scores of 84.7 %, 82.6 % and 41.6 % on the items the rule solves, versus 10.4 %, 11.9 % and 6.0 % on the 67 unreachable items.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
6d ago

Better Retrievers, Worse Labels: How Incomplete Relevance Judgments Distort Abstention Evaluation in Conversational RAG

The paper investigates how conversational Retrieval-Augmented Generation (RAG) benchmarks that rely on relevance judgments to determine context sufficiency can be misleading. By re‑running official baselines on the RETECO track and evaluating with both large‑language‑model judges and a blind audit, the authors show that stronger retrievers produce a higher proportion of contexts lacking gold documents yet still containing the answer, leading to a sharp drop in shortcut precision from 0.68 to 0.10. The study demonstrates that many false misses arise from hard negatives, gold content from other turns, or neighboring chunks, and that using retrieval scores alone as a sufficiency detector can underestimate answerability by up to 0.19 in AUROC.

By Ivan Kochergin, Vasily Konovalov
arXiv Computation and Language
Sep 23

MoM: Memory of Memory

arXiv:2609.25054v1 Announce Type: new Abstract: For a long-horizon LLM agent, the memory question is not what was once recorded but what \emph{currently holds}. Most designs answer it only indirectly...

By Bowen Qin, Yao Lu
arXiv AI
Oct 1

Working Around the Compute Ceiling: Byte-Exact Memory in Galahad Makes LLM Reading a One-Time Cost LLM Reading a One-Time Cost

The paper introduces Galahad, a memory layer that stores a transformer language model’s key‑value state for blocks of text, allowing subsequent requests to reuse previously computed attention rather than recomputing it. On seven real‑world datasets, 98.7% of prompt tokens were already read, and with Galahad the model could attend to an entire 97,000‑token corpus, achieving 98–100% recall on a 100‑fact test while reducing inference time and energy consumption dramatically. The approach was validated across 30 models and all runtimes, demonstrating that stateful inference can replace stateless serving without loss of accuracy.

By Sietse Schelpe