cs.CRDate pending

Bit-Flip Attacks on Vision-Language-Action Models: Action-Decoding Architecture Shapes the Vulnerability

Authors: Yudong GaoLinghan ChenWenhan WuMia ZhouJiyao WangKaiyan JiMingyu GuoHonglong Chen

Abstract

Quantized Vision-Language-Action (VLA) models expose a weight-fault surface: Rowhammer-style faults can corrupt deployed INT8 bits. We present the first bit-flip attack on a VLA: a few gradient-selected flips reduce closed-loop success to 0%0\%, while hundreds of random flips are harmless. Across four model variants spanning three action-head families, damaging bits concentrate in a few action-generating layers, but the empirical budget depends sharply on the head: direct regression and token policies fall in 11--55 flips, whereas the evaluated flow-matching policies require 100{\sim}100--300300. Our fixed-direction manifold-escape loss cuts \pizero{}'s budget from 1000{\sim}1000 to 100{\sim}100 flips, and a matched five-direction sweep shows that the attack is not specific to an all-positive direction. On a direct head, protecting 3.1%3.1\% of weights preserves 60%60\% success at K=100K{=}100, and protecting 5.3%5.3\% moves the open-loop break threshold from 3 to 100 flips. Finally, task-calibrated emulated K=100K{=}100 flips yield 0/200/20 real-robot successes, versus 14/2014/20 clean and 16/2016/20 global-random. Weight integrity is therefore a security boundary for embodied foundation models. Code is included as ancillary material.

Explore similar work

May 25, 2026cs.CR

Capability and Robustness Cannot Both Be Free: An Information-Theoretic Bound for Vision-Language-Action Models

Vision-Language-Action (VLA) models reach high success rates on clean inputs but collapse under small adversarial perturbations: a 16/25516/255 PGD attack drops OpenVLA-7B's LIBERO success from 95%95\% to under 5%5\%. Whether this trade-off has a theoretical floor was open. We prove that it does. For any VLA policy, capability I(\Astar;\Api)I(\Astar;\Api) and robustness I(\Api;\Atildepi)I(\Api;δ)I(\Api;\Atildepi)-I(\Api;δ) sum to at most H(\Astar)+I(X;\Xtilde)H(\Astar)+I(X;\Xtilde), the task entropy plus adversarial channel capacity. The proof reduces to two applications of the Data Processing Inequality. The pixel-level bound is loose by 103\sim 10^3 nats and serves as a ceiling guarantee; an encoder-specific corollary tightens it by over an order of magnitude, into a regime where realized capability already consumes 55--9%9\% of the budget. We validate Theorem~\ref{thm:main} with zero violations across 308308 cells: 252252 closed-form Gaussian-VLA, 4848 OpenVLA-7B++LIBERO++PGD (44 suites ×\times 44 \eps\eps ×\times 33 seeds), 44 Square-Attack, and 44 multi-step (T=10T{=}10). A complementary measurability inequality \Robdiscdisc\Rob_{\text{disc}} \le \Cap_{\text{disc}} further holds across 144144 cross-architecture cells spanning OpenVLA, OpenVLA-OFT (continuous-L1L_1), and SmolVLA (flow-matching). The same construction yields three label-free diagnostics: a pre-flight encoder ceiling, a defense-forensics probe that localizes input-side vs.\ language-model intervention, and a head-agnostic robustness ratio comparable across discrete-token, L1L_1-regression, and flow-matching policies. Together these provide the cross-setting axis defense and architecture comparisons currently lack.
Jianwei Tai
Date pendingcs.CR

DropVLA: An Action-Level Backdoor Attack on Vision-Language-Action Models

Vision-Language-Action (VLA) models map multimodal perception and language instructions to executable robot actions, making them particularly vulnerable to behavioral backdoor manipulation: a hidden trigger introduced during training can induce unintended physical actions while nominal task performance remains intact. Prior work on VLA backdoors primarily studies untargeted attacks or task-level hijacking, leaving fine-grained control over individual actions largely unexplored. In this work, we present DropVLA, an action-level backdoor attack that forces a reusable action primitive (e.g., open_gripper) to execute at attacker-chosen decision points under a realistic pipeline-black-box setting with limited data-poisoning access, using a window-consistent relabeling scheme for chunked fine-tuning. On OpenVLA-7B evaluated with LIBERO, vision-only poisoning achieves 98.67%-99.83% attack success rate (ASR) with only 0.31% poisoned episodes while preserving 98.50%-99.17% clean-task retention, and successfully triggers the targeted action within 25 control steps at 500 Hz (0.05 s). Text-only triggers are unstable at low poisoning budgets, and combining text with vision provides no consistent ASR improvement over vision-only attacks. The backdoor remains robust to moderate trigger variations and transfers across evaluation suites (96.27%, 99.09%), whereas text-only largely fails (0.72%). We further validate physical-world feasibility on a 7-DoF Franka arm with pi0-fast, demonstrating non-trivial attack efficacy under camera-relative motion that induces image-plane trigger drift. These results reveal that VLA models can be covertly steered at the granularity of safety-critical actions with minimal poisoning and without observable degradation of nominal performance.
Zonghuan Xu, Jiayu Li, Yunhan Zhao +3
Jul 14, 2026cs.RO

TrustVLA: Mechanism-Guided Inference-Time Defense Against Vision-Language-Action Backdoors

Vision-Language-Action (VLA) models are deployed through pipelines that end users cannot audit, and a poisoned VLA can behave normally on clean observations while a small visual trigger redirects a long-horizon robot policy before any failure becomes observable. Existing vision or language defenses rarely explain what a triggered VLA representation looks like or how to recover behavior without retraining. We study this gap through two independently proposed VLA attacks from groups with distinct injection strategies, BadVLA and INFUSE; the latter persists after downstream clean adaptation. Across the evaluated poisoned models, we identify a recurring internal mechanism: a \emph{compact causal footprint}, namely a small visual support that is attention-seeded, spatially compact, and \emph{causal} in a precise sense -- masking it returns a clean-calibrated evidence-evolution score to the normal operating region. This footprint motivates TrustVLA, a mechanism-guided inference-time defense that adapts the Dirichlet evidence framework from trusted classification to monitor per-token, per-layer epistemic uncertainty in VLA policies. With only a small clean calibration set, TrustVLA (i)~detects abnormal evidence evolution, (ii)~localizes the compact support by counterfactual mechanism-score drop, and (iii)~recovers the observation by localized inpainting. Across OpenVLA/LIBERO and π0.5π_{0.5} transfer evaluations, TrustVLA reduces attack success while preserving clean-task performance, providing a retraining-free, mechanism-guided defense for visual-triggered VLA backdoors.
Pinhan Fu, Xianda Guo, Xuetao Li +5