- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper introduces a more fine-grained fitness function for optimizing memory poisoning attacks. Instead of relying on binary attack success, it proposes Counterfactual Memory Regret (CMR), which measures the difference in downstream operational loss between clean and poisoned memory. I find the counterfactual formulation particularly interesting, as it provides a meaningful baseline for quantifying the actual impact of an attack. The paper also provides extensive experimental evaluations to demonstrate the effectiveness of the proposed approach.
Critical strengths
-
Clear writing and motivation. The paper is well written, and the motivation for moving beyond binary attack success toward severity-aware optimization is clearly presented.
-
Comprehensive experiments. The evaluation is thorough, covering multiple benchmarks, memory architectures, and representative baselines. The results demonstrate that MemHarm consistently achieves higher attack severity than existing methods, including strong baselines.
-
Interesting mechanism findings. I particularly appreciate the finding that the specific corrupted semantic factor matters. This aligns with my intuition that the effectiveness of prompt injection often depends on how relevant the injected information is to the agent's task. It is interesting to see the paper provide empirical evidence of the causal contribution of individual memory factors to downstream attack severity.
Critical weaknesses
-
Evaluation on relatively outdated models. The main CMR experiments primarily use Llama-3.1-70B and GPT-4o, which are relatively outdated compared with recent models. Although the paper includes additional evaluations with Gemini-3.5-Flash and GPT-OSS-120B, it remains unclear whether the observed improvements would generalize to more capable, recent agents. This is very important as it can provide evidence to show whether the CMR algorithm can still be interesting if the models get stroner. Evaluating stronger models under the same CMR protocol would make the findings more convincing.
-
Overstated theoretical contributions. While Proposition 1 provides useful justification for the optimization procedure, the severity decomposition and subsequent bounds are relatively straightforward derivations, and Proposition 2 follows from standard statistical arguments. More importantly, these results do not appear to directly inform the algorithm design or provide substantial new insights into its effectiveness. I would encourage the authors to clarify their practical implications or simplify the theoretical presentation.
Questions for authors
While I think the paper provide very interesting finding and solid experiment results, my main concern is that the evaluation is still based on some outdated models which make it still unclear whether it can be effective for stronger LLM.
3 comments
Thank you for your response and the additional experiments. Regarding stronger models, I meant models with greater capabilities, rather than simply newer models—for example, gpt-soll rather than only terra. I also appreciate the clarification of the theoretical contribution. Please incorporate these clarifications into the revised manuscript.
Thanks for your feedback. We will run the suggested experiment and incorporate the results and clarifications into the revision.
Response to Reviewer YToq
We thank the reviewer for emphasizing stronger-model generalization and the practical significance of the theory. We conducted a new matched-protocol evaluation on a contemporary backbone and will sharpen the presentation of the theoretical results.
Response to W1 and Q1. Stronger-Model Generalization
Appendix G.1 already reports CMR results on Gemini-3.5-Flash and native-agent evaluations on GPT-OSS-120B. To further examine generalization under the full paired-CMR protocol, we evaluated GPT-6.1 Terra on AgentDojo and τ³-bench, with 48 held-out tasks per benchmark and matched memory contracts, evaluation seeds, and attack budgets (Table Y1).
Table Y1. Stronger-backbone CMR evaluation on GPT-6.1 Terra (new)
To contextualize these attack results, Table Y2 compares the stronger defender's clean-task utility with the original GPT-4o reference.
Table Y2. Clean-task utility: original and new defender evaluations
On GPT-6.1 Terra, MemHarm achieves the highest CMR on both benchmarks, outperforming ASR-guided selection by +0.117 on AgentDojo (paired 95% CI [+0.035, +0.213]), with a positive gain also observed on τ³-bench. The defender maintains strong clean-task utility across both benchmarks. These findings extend the evidence for MemHarm's effectiveness to a more capable tool-using backbone under the original paired-CMR evaluation protocol.
Response to W2. Theoretical Contributions
We appreciate the reviewer's suggestion to clarify the practical role of our theoretical analysis.
Proposition 1 directly informs attack selection: its confidence bounds guide rollout allocation and provide a stopping criterion for certifying an η-near-optimal semantic edit. Appendix E reports 91.4% certified instances and 30.7% fewer median paired rollouts at the same certification rate.
The severity decomposition provides a mechanistic interpretation by separating the downstream consequences of corrupting a semantic factor from the memory retrieval and use processes that realize those consequences. Consistent with this distinction, Appendix G.3 shows a 0.34 CMR decrease after removing the targeted factor, compared with 0.02 for an irrelevant factor.
We will clarify these algorithmic and empirical connections while moving Proposition 2 to the appendix to streamline the theoretical presentation.
Summary and Planned Revisions
The stronger-backbone experiment further demonstrates MemHarm's generalization to more capable defenders, while the existing certification and factor-removal results clarify the theory's practical contribution.We will add the new results, report their uncertainty, and streamline the theoretical presentation around its algorithmic and mechanistic roles.
We are especially grateful for the reviewer's insightful suggestions, which have guided us toward a more rigorous evaluation and a clearer articulation of the theory's practical value.