LGCLCRCVJun 18, 2024

Dissecting Adversarial Robustness of Multimodal LM Agents

arXiv:2406.12814v3108 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses a critical challenge for developers of autonomous AI agents in real environments, though it is incremental as it builds on existing evaluation methods.

The paper tackles the problem of adversarial robustness in multimodal language model agents by creating 200 targeted adversarial tasks and proposing the Agent Robustness Evaluation (ARE) framework, finding that imperceptible perturbations can hijack agents with success rates up to 67% and that added components like inference-time compute can increase attack success by 15-20%.

As language models (LMs) are used to build autonomous agents in real environments, ensuring their adversarial robustness becomes a critical challenge. Unlike chatbots, agents are compound systems with multiple components taking actions, which existing LMs safety evaluations do not adequately address. To bridge this gap, we manually create 200 targeted adversarial tasks and evaluation scripts in a realistic threat model on top of VisualWebArena, a real environment for web agents. To systematically examine the robustness of agents, we propose the Agent Robustness Evaluation (ARE) framework. ARE views the agent as a graph showing the flow of intermediate outputs between components and decomposes robustness as the flow of adversarial information on the graph. We find that we can successfully break latest agents that use black-box frontier LMs, including those that perform reflection and tree search. With imperceptible perturbations to a single image (less than 5% of total web page pixels), an attacker can hijack these agents to execute targeted adversarial goals with success rates up to 67%. We also use ARE to rigorously evaluate how the robustness changes as new components are added. We find that inference-time compute that typically improves benign performance can open up new vulnerabilities and harm robustness. An attacker can compromise the evaluator used by the reflexion agent and the value function of the tree search agent, which increases the attack success relatively by 15% and 20%. Our data and code for attacks, defenses, and evaluation are at https://github.com/ChenWu98/agent-attack

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes