EvolvAttack: Backdooring self Evolving VLM Agents
Organizations: University of Pennsylvania · Brown University · Nanyang Technological University · University of Notre Dame ·
Abstract
Self-evolving mechanisms let vision-language model (VLM) agents continually adapt through evolving memory, but they also allow malicious behavior to emerge only after deployment. We introduce a new attack surface, the self-evolving backdoor, whose payload stays dormant in the initial agent and is progressively activated as the agent evolves. Unlike conventional backdoors, which can be exposed by testing triggered inputs on a static model, our attack requires both a visual trigger and a sufficiently evolved memory state; static scanning with clean memory thus yields near-zero attack success and may deem the agent benign. We realize this through memory-aware backdoor training, which couples trigger activation with the agent's evolving memory while preserving benign behavior unless the trigger co-occurs with payload-related memory. Across three VLM backbones, four agent pipelines, and recency-, semantic-, and reward-based memory evolution, the attack preserves normal functionality and stays nearly inactive before evolution (0.5% attack success rate), yet exceeds 95% attack success within 100 interactions, revealing a stealthy threat unique to self-evolving agents.
Figures & tables
| Attack Eff. | Stealth | |||||
| Phase | Retrieval | Method | ASR | AC | GA | SR |
| Query-Only | 0.23 | 0.64 | 0.29 | 0.20 | ||
| Before Evolving | No Mem. | EvolvAttack | 0.00 (-.23) | 0.87 (+.23) | 0.47 (+.18) | 0.43 (+.23) |
| After Evolving | Recent- | Query-Only | 0.26 | 0.77 | 0.29 | 0.21 |
| Mem.-Only | 0.10 | 0.81 | 0.35 | 0.27 | ||
| EvolvAttack | 1.00 (+.74) | 0.86 (+.05) | 0.54 (+.19) | 0.49 (+.22) | ||
| Loss Terms | ASR | Stealth | ||||
| ASR | SR | FP | ||||
| 0.95 | 0.43 | 0.00 | ||||
| 1.00 | 0.28 | 0.97 | ||||
| 0.00 | 0.28 | 0.00 | ||||
| ∗ 0.94 | 0.40 | 0.00 | ||||
| 0.92 | 0.43 | 0.97 | ||||
Appendix figures & tables9 assets
Supplementary material from the paper’s appendix.
Appendix
| Hyperparameter | Value |
| Optimizer | AdamW |
| Learning rate | |
| LR schedule | Linear warmup |
| Warmup ratio | |
| Batch size | 1 per device |
| Gradient accumulation | 1 |
| Split | Count | Purpose |
| Train | (2,123 clean + 375 poison-eligible) | LoRA fine-tuning |
| Held-out test | 100 unique | Deployment evaluation |
| Memory Pipeline | Update | Retrieval |
| Recent-history | Gated append | Last- |
| Semantic | Gated append | Cosine top- |
| Reward-aware | Gated append | Reward-weighted top- |
| Framework | Prompt Source | Prompt Adaptation |
| AppAgent | Task template | Preserve agent role, task description, and history slot; replace action space and output schema. |
| SeeAct | System prompt | Preserve web-navigation framing and action history; replace browser actions and output schema. |
| Mobile-Agent v3.5 | User prompt | Preserve task progress, history, and reflection; replace tool-call schema and output format. |
| Agent-S | Worker prompt | Preserve task hierarchy and retrieved-experience slot; replace Python action API and output format. |
| Forward | Image | Memory | Target |
| F1 | Clean | Benign | |
| F2 | Clean | Benign | |
| F3 | Triggered | Benign / Payload | |
| F4 | Triggered | Payload | |
| F5 | Clean | Benign |
| Variant | Forwards | Key supervision |
| Presence | 4 | Learns activation from the presence of memory context; spark is applied to the empty-memory state. |
| Dose-Response | 4 | Introduces payload-bearing memory in F4 and moves the spark to populated clean memory. |
| AND-Gate | 5 | Adds F5, explicitly enforcing . |
| Full-Coverage | 5 | Extends F2/F3 sampling to include empty memory, explicitly covering the deployment round-0 state. |
| Variant | ASR | FP | Success |
| Presence | 0% | 0% | 40% |
| Dose-Response | 90% | 97% | 43% |
| AND-Gate | 95% | 0% | 43% |
| Full-Coverage | 84% | 0% | 40% |
Backdoor Attacks
Backdoor attacks implant hidden, trigger-dependent behaviors in models while aiming to preserve normal performance.
See all 135 papers