MemRiskBench: Trace-Aware Risk-Preserving Evaluation for Long-Horizon LLM Agents
Jianhua Jiang, Dongbo Yuan, Weihua Li
cs.AI
Quick verdict
Offers a 120-episode deterministic memory-risk benchmark plus subset selector; careful and honest, but its edge over a plain disagreement baseline is thin.
Summary
The paper introduces MemRiskBench, a 120-episode scripted benchmark that evaluates safety-relevant memory failures of long-horizon LLM agents across a five-category taxonomy: stale memory reliance, conflicting-memory misresolution, cross-scope leakage, revoked-memory reuse, and constraint decay, plus a documented but unscored sixth category. Scoring is fully deterministic, drawing on text, tool-call, memory-ledger, and constraint checks over logged traces, with no LLM-as-judge on the pass/fail path. Five quantized local models (1.5B-7B parameters; three Qwen2.5 variants, Phi-3.5-mini, Llama-3.2-3B) produced 600 traces. A second contribution is a coverage-constrained greedy subset selector on 12 trace-derived features that, at 20% of episodes, preserves the full-benchmark model ranking (Spearman rho=0.975), risk-type coverage (1.0), and high-risk-model detection (1.0), cutting compute fivefold. Notable findings include severe cross-scope leakage failures for Qwen2.5-1.5B (1 of 24 episodes, versus 10 of 24 for Phi-3.5-mini) and an inverted constraint-obedience pattern (the 1.5B model passes all 24). Main limitations: only small local models, three of five from one family; a quantization confound on the 7B (Q3 vs Q4); headline model-risk contrasts that do not survive Holm correction; a memory-baseline experiment reported without numbers; and the selector's dependence on a fixed reference model set.
Review complete
Assessment at a glance
6
risk flags identified
● high 1
● medium 3
● low 2
6 strengths · 5 weaknesses · 5 author questions
AI text signal = Binoculars zero-shot detector score over 20 sampled passages (Fast-DetectGPT co-reported) — absence does not prove human authorship, and a flag does not imply misconduct.
Levels reflect verification complexity — not a quality score. Evolve never rates your paper.
Key claims under review
- Standard aggregate evaluation hides sparse high-impact memory failures, which MemRiskBench surfaces via a five-category risk taxonomy scored deterministically from traces with no LLM-as-judge on the pass/fail path.
- A coverage-constrained greedy selector retains full-benchmark ranking (Spearman rho=0.975), risk-type coverage (1.0), and high-risk-model detection (1.0) at a 20% subset, reducing compute 5x (~18h to ~3.6h for five models).
- Model size does not uniformly predict memory safety: Qwen2.5-1.5B is worst on cross-scope leakage (1/24) yet the only model obeying all 24 constraints.
- Standard retrieval-level memory filtering (RAG and recency) performs worse than no filtering on memory-risk episodes, indicating memory risk requires dedicated evaluation.
Strengths
Judge-free deterministic scoring
Pass/fail derives from four evidence channels (text regex/exact match, tool-call trace, memory read/write ledger, constraint state) over fully logged traces (Section 4.2), removing the noise and bias of LLM-as-judge that plagues agent benchmarks.
Unusual transparency about scoring defects
Section 4.3 discloses that 20 episodes had 'label: value' expected arguments no model emits, re-scores 39 of 600 trace-episode pairs, and releases both original and revised expected values with a per-(model, risk) audit.
Honest statistical self-reporting
Selector objective extends compression literature
Complete release package
Demonstrated aggregate-score blindness
Weaknesses
Internal contradiction on the central differentiation claim
Selector ties a trivial baseline on 3 of 4 headline metrics
Headline interaction rests on uncorrected statistics
Memory-baseline experiment reported without any numbers
Thin and homogeneous model pool with acknowledged confound
Full Review Report
$1.99 · one-timeUnlock the complete preliminary analysis Evolve produced for this paper.
Report preview
Scope & Claims
MemRiskBench (arXiv 2609.14976) targets a gap the authors argue is missed by memory-capability benchmarks (LongMemEval, LoCoMo, MemBench, MemoryAgentBench, BEAM): long-horizon agents fail in sparse, stateful, high-impact ways - acting on stale facts, mishandling conflicting updates, leaking across scopes, reusing revoked memories, and decaying declared constraints. The paper claims two contributions: (C1) a 120-episode scripted benchmark spanning a five-category risk taxonomy (R1 stale, R2 conflict, R3 cross-scope leakage, R4 revoke, R5 constraint decay; R6 summary contamination documented but unscored), scored deterministically from traces with no LLM-as-judge on the pass/fail path; and (C2) a risk-preserving subset selector retaining ranking (Spearman rho=0.975), risk-type coverage (1.0), and high-risk-model detection (1.0) at 20% of episodes, cutting compute 5x (~18h to ~3.6h for five models). C3 is an empirical characterization of five quantized local models (1.5B-7B).
The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.
- All 6 strengths & 5 weaknesses, analyzed in detail
- 6 risk flags with severity, section & reviewer questions
- Methods & statistical evidence assessment
- 5 questions a peer reviewer would ask
- Full six-dimension evaluation report & recommendations
One-time purchase · this paper only
One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.
Frequently asked questions
What is MemRiskBench?
MemRiskBench is a 120-episode benchmark measuring five safety-relevant memory failure types of long-horizon LLM agents - stale memory reliance, conflicting-memory misresolution, cross-scope leakage, revoked-memory reuse, and constraint decay - scored deterministically from agent traces without an LLM judge on the pass/fail path.
How much compute does the subset selector save?
It selects 24 of 120 episodes (20%), preserving the full-benchmark model ranking (Spearman 0.975), risk-type coverage, and high-risk model detection, cutting evaluation compute about 5x (roughly 18 hours to 3.6 hours for five models).
Which models were evaluated in the paper?
Five quantized local models under 8B parameters run via llama.cpp: Qwen2.5-1.5B/3B/7B-Instruct, Phi-3.5-mini-instruct, and Llama-3.2-3B-Instruct. No frontier API models (GPT-4, Claude, Gemini) were tested, and the 7B ran at Q3 quantization versus Q4 for the others.
Is the MemRiskBench code and data available?
The paper states the full release - 120 episode definitions, trace schema, the deterministic scorer, all 600 raw traces, the subset selector, bootstrap audit scripts, and the strict-matching revision audit - is publicly available at github.com/fuxue-mingzhu/MemRiskBench.
About this review
This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.
- Figures (pipeline, bootstrap CI distributions, per-risk heatmap) appear only as garbled extracted text; visual data could not be analyzed.
- Some tables are extracted inline with lossy formatting; row/column alignment was inferred from surrounding text.
- The GitHub release's existence and contents could not be verified from the text alone.
- The abstract appears truncated mid-sentence in extraction ('released to support reproducible'), suggesting minor text loss.
Go deeper on this paper
Wrote a paper? Stress-test it before reviewers do.
Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.
