Visual world-model agents such as DreamerV3 act through a recurrent latent state rather than a single observation, which weakens frame-wise observation attacks and makes their perturbations vary sharply over time under a strict per-frame perturbation constraint. We study white-box, causal, online attacks on such agents and propose Critic-Induced Value-Subspace Attacks (CIVA). Our key observation is that, along a rollout, critic-guided perturbations concentrate in a low-dimensional subspace induced by the victim's own critic. Based on this observation, CIVA first probes the frozen victim offline with critic-guided PGD and extracts a low-rank value-subspace by SVD. At test time, it optimizes only the subspace coefficients, smooths them with an exponential moving average (EMA), and maps them back to pixels. This design attacks value-sensitive recurrent dynamics while keeping the online optimization cheap and temporally coherent. Extensive experiments on DMC walker walk, Atari Pong, and Crafter show that CIVA consistently outperforms five recent methods; on DMC walker walk, it achieves the largest reward drop of 26.07% while keeping temporal variation low, with TempAbs of 0.646.
Figures & tables
Figure 1: CIVA framework. Stage A extracts a critic-induced value-subspace from offline PGD probes; Stage B performs online subspace-PGD with EMA smoothing.
Method
Venue / Year
Episode Reward ↓
Drop% ↑
Action-KL ↑
TempAbs ↓
SSIM ↑
Natural (no attack)
—
952.25
—
—
—
1.000
MAD [ 69 ]
NeurIPS 2020
934.71
1.84%
0.753
9.126
0.748
UAP-RL [ 56 ]
ESORICS 2022
730.86
23.25%
1.000
0.00
0.656
PA-AD [ 53 ]
ICLR 2022
786.75
17.38%
1.35
19.97
0.35
Illusory [ 9 ]
ICLR 2024
795.13
16.50%
1.018
10.97
0.445
DAPGD [ 7 ]
ICASSP 2025
773.33
18.79%
0.775
12.31
0.501
Table 1: Attack results on DMC walker walk. “Natural” is the unattacked baseline; arrows show the favorable direction for the attacker. Bold = best, underline = second best.
Method
Venue / Year
Episode Reward ↓
Drop% ↑
Action-KL ↑
TempAbs ↓
SSIM ↑
Natural (no attack)
—
21.0
—
—
—
1.000
MAD [ 69 ]
NeurIPS 2020
7.0
66.67%
0.155
4.357
0.864
UAP-RL [ 56 ]
ESORICS 2022
18.0
14.29%
0.098
0.000
0.344
PA-AD [ 53 ]
ICLR 2022
17.0
19.05%
0.069
4.029
0.697
Illusory [ 9 ]
ICLR 2024
16.0
23.81%
0.138
9.570
0.599
DAPGD [ 7 ]
ICASSP 2025
19.0
9.52%
0.080
17.194
0.719
Table 2: Attack results on Atari Pong.
Figure 2: Attack dynamics over time. Cumulative reward (left pair) and Action-KL (right pair) on DMC walker walk and Atari Pong. The dashed line marks the attack start at t=200 .
Figure 3: Policy-logit shifts across attacks on Atari Pong. Dark bars mark the selected actions.
ID
Variant
(A) Signal
(B) Subspace
Online
EMA
EpReward ↓
Drop% ↑
V0
CIVA (full)
critic
critic-SVD
✓
✓
703.97
26.07%
V1
w/o critic-induced subspace
critic
random
✓
✓
886.54
6.90%
V2
w/o subspace constraint (full-pixel)
critic
—
✗
✗
832.21
12.61%
V3
w/o temporal EMA
critic
critic-SVD
✓
✗
696.66
26.84%
V4
w/o critic (reward-grad subspace)
reward
reward-SVD
✓
✓
906.13
4.84%
Table 3: Ablation: reward drop on DMC walker walk. The Online and EMA columns indicate whether subspace-restricted online PGD and temporal EMA are enabled.
ID
Variant
(A) Signal
(B) Subspace
Online
EMA
Action-KL ↑
TempAbs ↓
SSIM ↑
V0
CIVA (full)
critic
critic-SVD
✓
✓
1.130
0.646
0.710
V1
w/o critic-induced subspace
critic
random
✓
✓
0.058
0.8439
0.612
V2
w/o subspace constraint (full-pixel)
critic
—
✗
✗
0.730
3.2350
0.908
V3
w/o temporal EMA
critic
critic-SVD
✓
✗
0.798
1.7496
0.675
V4
w/o critic (reward-grad subspace)
reward
reward-SVD
✓
✓
1.054
0.542
0.833
Table 4: Ablation: behavioural deviation and stealth (DMC walker walk). Companion to Table 3 .
Despite the growing use of world models as decision-making agents, their adversarial robustness remains underexplored due to the lack of dedicated automated evaluation methods. A key obstacle is that attack evaluation must be both accurate and efficient: weak manually tuned attacks can overestimate robustness, while exhaustive hyperparameter search is prohibitively expensive because each candidate requires closed-loop rollouts through learned latent dynamics. We introduce WMAttack, an automated attack-search framework for adversarial evaluation of world-model agents. WMAttack formulates robustness evaluation as a finite-budget search over attack configurations, including attack families, perturbation budgets, optimization steps, restarts, and allocation rules. To improve search accuracy, Self-Correcting Attack Search (SCAS) refines the attack proposal distribution using feedback from reward degradation, action instability, runtime cost, and rollout variability. To improve search efficiency, Representation-Guided Attack Retrieval (RGAR) retrieves effective historical configurations from representation-similar tasks, providing a warm start for unseen environments. We provide a theoretical explanation showing that proposal refinement improves finite-budget search when it shifts probability mass toward high-utility attacks. Across Atari and DeepMind Control tasks, WMAttack consistently discovers stronger attacks than the evaluated baselines, improving normalized reward drop from 0.497 to 1.034 on DreamerV3 Atari and from 0.319 to 0.682 on DMC. Ablations further show that RGAR improves initial candidate quality and SCAS improves final attack utility under fixed evaluation budgets.
Zhixiang Guo, Siyuan Liang, Shi Fu +4
Nanyang Technological University · University of Szeged
Reinforcement learning (RL) post-training of Vision-Language-Action (VLA) models has shown strong promise for robotic manipulation. Among RL methods, critic-based approaches rely on a value estimator that predominantly operates on single-frame observations or single-frame VLM backbone latents, which is a fundamental mismatch with the partially observable nature of robot control. A naive approach to incorporate observation history into the critic incurs exponential complexity with high-dimensional visual space, and still fails because pure scalar-return regression provides insufficient supervision for learning cross-temporal dynamics. We identify the root cause as a state approximation problem: without an explicit world modeling objective, the critic's representation cannot capture the temporal structure needed for accurate value estimation. To address this, we propose the World Critic Model (WCM), built on a lightweight LeJEPA architecture; WCM jointly predicts future latent state and estimates values, such that the critic's representation is explicitly trained to capture temporal dynamics rather than merely regress scalar returns. WCM integrates seamlessly into both on-policy and off-policy training pipelines and is compatible with state-of-the-art VLA backbones including Pi0, Pi0.5, and OpenVLA-OFT. Extensive experiments on 149 tasks across four benchmarks demonstrate that WCM consistently achieves state-of-the-art performance in both in-distribution and out-of-distribution settings, with particularly strong generalization gains. We further validate WCM on seven real-world manipulation tasks using OpenVLA-OFT and Pi0.5 with off-policy RL, confirming stable deployment across diverse settings.
Senyu Fei, Xiaopeng Yu, Siyin Wang +3
1Tongji University · 3Fudan University · 2Shanghai Innovation Institute
Visual world models (VWMs) synthesize interactive, action-conditioned rollouts from a single context image. However, it remains an open question how robust these models are to adversarial perturbations. Standard adversarial attacks fail to assess this vulnerability because attackers lack ground-truth future videos and cannot predict subsequent user controls. We introduce BadWorld, a label-free adversarial framework tailored for autoregressive VWMs that systematically overcomes both constraints. First, to bypass the need for future supervision, we propose a self-supervised velocity attack that directly disrupts the early denoising dynamics of the model. Second, to ensure the attack generalizes across unpredictable user actions, we formulate a trajectory-adaptive bi-level optimization that actively mines hard control sequences to forge control-agnostic perturbations. Evaluated on representative VWMs with continuous and discrete controls, BadWorld exposes severe structural fragility. Visually indistinguishable adversarial images reliably trigger catastrophic degradation in future rollouts, leading to incomplete denoising, structural collapse, and control inconsistency. These findings reveal critical risks for deploying VWMs in safety-critical systems while highlighting a practical mechanism for privacy protection.