Vision-Language-Action (VLA) models offer a promising paradigm for autonomous driving. However, the massive parameter scale of VLAs strains onboard computational resources during real-time inference. This directly increases energy consumption and limits vehicle battery range, making it critical to minimize computational overhead without compromising driving capability and explainability. Current research on efficient VLA-based driving focuses on sequential adaptation (e.g., Chain-of-Thought and token adjustment), leaving structural adaptation underexplored despite parameter redundancy across dynamic driving scenes. To address this gap, we propose Scene-Adaptive VLA, an efficient framework leveraging dynamic layer routing to adjust active parameters based on real-time scenes. Inspired by the temporal continuity of scenes and model predictive uncertainty, our approach characterizes model-perceived scene complexity via frame-level temporal scene variations and decision deviations. To uncover latent scene-to-parameter correspondences, we encode this characterization into scene-aware tokens, alongside two specialized queries. A budget-conditioned layer routing mechanism evaluates these refined queries to allocate a budget that determines the active parameter ratio and subsequently selects appropriate layer combinations. The entire framework is optimized end-to-end. Extensive evaluations on the Bench2Drive benchmark show that when adapted to a state-of-the-art VLA model, our approach significantly reduces inference-time computational overhead by 53.5% with negligible degradation in driving and language capabilities. Code is available at https:github.com/yang-luvu/Scene-Adaptive-VLA.
Figures & tables
Figure 1: Driving performance under varying capacities of a state-of-the-art model [ 3 ] on Bench2Drive. (a) Fixed Ratio Across Routes: The model with 70% active parameters completely fails on routes featuring more complex driving scenes, yet completes routes with only a 20% score drop on routes dominated by routine scenes. (b) Activation Ratios (Complex Route): Reducing parameters severely degrades performance, with lower ratios causing critical local failures (e.g., lane deviation at 40%, blockage at 70%). (c) Layer Selection Strategies (Complex Route): At 70% activation, an early-exit strategy significantly underperforms random layer dropping, proving that active parameter combinations are critical.
Figure 2: Overview of the Scene-Adaptive VLA, featuring Model-Perceived Scene Complexity Characterization and Budget-Conditioned Layer Routing. Adjacent icons denote paramter status (left/top: Stage 1; right/bottom: Stage 2). Left : The characterization module encodes temporal visual variations and inter-frame decision deviations into scene-aware tokens ( es , epw , esw ). Right : The LLM prefix layers process these tokens alongside budget ( qb ) and routing ( qlr ) queries. A budget scheduler allocates a real-time computational budget b based on intermediate qb features from the middle prefix layers. At the final prefix layer, a routing scheduler utilizes qlr to generate a binary mask M , dynamically activating specific layers and bypassing others via residual connections to yield final predictions.
Method
Avg. P (B)
Nin
Nout
TFLOPs ↓
Latency (ms) ↓
Mem. (GB) ↓
Language
DriveMoE [ 6 ]
3.00
527
1
3.17
319.54
14.85
×
AutoVLA [ 5 ]
3.00
1736
18
10.52
1322.85
7.18
✓
ORION [ 4 ]
7.00
538
110
9.07
5440.70
17.83
✓
ORION+SA
3.68
538
110
4.77
2971.60
17.83
✓
SimLingo [ 3 ]
0.50
569
22
0.59
410.79
2.03
✓
SimLingo+SA
0.23
569–576
22
0.27
214.01
2.01
✓
Table 1: LLM computation overhead per driving decision.
Method
DS ↑
SR( % ) ↑
Efficiency ↑
Comfortness ↑
TFLOPs ↓
UniAD-Base [ 15 ]
45.81
16.36
129.21
43.58
3.42
VAD [ 16 ]
42.35
15.00
157.94
46.01
1.14
TCP-traj [ 32 ]
59.90
30.00
76.54
18.08
0.04
AutoVLA [ 5 ]
78.84
57.73
146.93
39.33
10.52
DriveMoE [ 6 ]
74.22
48.64
175.96
15.31
3.17
ORION [ 4 ]
77.74
54.62
151.48
17.38
9.07
Table 2: Comparison with SOTA driving methods on the closed-loop benchmark.
Figure 3: Visualization of scene-adaptive parameter activation. Left: driving scenes at selected steps. Right: corresponding budget and sampled layer combinations.
Budget
Scene
Speed
Path
DS ↑
SR(%) ↑
Efficiency ↑
Comfortness ↑
Avg. B (%) ↓
✓
✓
✓
✓
84.87
65.45
266.19
54.36
44.64
×
✓
✓
✓
83.81
62.55
259.18
51.49
60.03
✓
✓
×
✓
84.60
64.09
249.68
37.63
71.89
✓
✓
✓
×
83.88
63.63
247.17
30.75
66.70
✓
✓
×
×
84.12
63.18
241.10
34.24
68.05
✓
×
✓
✓
83.37
64.09
258.74
56.74
54.37
Table 4: Ablation study on the closed-loop benchmark.
Vision-Language-Action (VLA) models are reshaping autonomous driving (AD) by unifying perception, reasoning, and control through language, enabling semantic grounding, interpretable decisions, and better long-tail generalization. But language is expensive onboard: latency and memory budgets are tight, and autoregressive decoding is inherently sequential. This work reframes the central question as when and where language should act at inference, since inference cost recurs at every deployed frame while training cost is paid once. We introduce the Language Residue taxonomy to organize methods by their inference-time use of language: train-time-only supervision (L1), latent non-textual reasoning (L2), conditional invocation (L3), and full per-frame generation (L4). We review representative methods and tag each across five deployment axes (latency, parameters, memory, FLOPs, tokens), analyzing them on major open- and closed-loop driving benchmarks (e.g., nuScenes, NAVSIM, Bench2Drive). We further trace how efficient methods from NLP/LLM are adapted in AD, identifying the constraints and motivations driving these adaptations. A continuously updated repository will be available at Github.
Tongfei Guo, Lili Su
Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA.
The integration of Vision-Language-Action (VLA) models into autonomous driving systems offers a unified framework for interpreting complex scenes and executing control commands. However, the necessity to incorporate historical multi-view frames for accurate temporal reasoning imposes a severe computational burden, primarily driven by the quadratic complexity of self-attention mechanisms in Large Language Models (LLMs). To alleviate this bottleneck, we propose ETA-VLA, an Efficient Token Adaptation framework for VLA models. ETA-VLA processes the past n frames of multi-view images and introduces a novel Intra-LLM Sparse Aggregator (ILSA). Drawing inspiration from human driver attention allocation, ILSA dynamically identifies and prunes redundant visual tokens guided by textual queries and temporal consistency. Specifically, we utilize a text-guided scoring mechanism alongside a diversity-preserving sparsification strategy to select a sparse subset of critical tokens, ensuring comprehensive awareness of the driving scene. Extensive experiments on the NAVSIM v2 demonstrate that ETA-VLA achieves driving performance comparable to state-of-the-art baselines while reducing computational FLOPs by approximately 32%. Notably, our method prunes 85% of visual tokens and reduces inference FLOPs by 61%, but still retaining 94% of the original accuracy on the NAVSIM v2 benchmark.
Yiru Wang, Anqing Jiang, Shuo Wang +3
Bosch Corporate Research, Bosch (China) Investment Ltd., Shanghai, China. · School of Communication and Information Engineering, Shanghai University, Shanghai, China
Vision-Language-Action (VLA) models promise to bring end-to-end reasoning to autonomous driving, but their computational cost remains far too high for real-time control. The core challenge is structural: VLA inference is not a single bottleneck but a cascade of four. Visual encoding wastes compute on overlapping video frames; language-model prefill recomputes context that could be carried over from the previous timestep; reasoning tokens are generated serially despite low entropy; and flow-matching denoising applies uniform compute to a non-uniform velocity field. Addressing any one stage in isolation leaves the others untouched. We propose FlashDrive, an algorithm-system co-design framework that targets all four stages simultaneously. Our key insight is that each bottleneck admits a distinct, lightweight algorithmic shortcut: temporal overlap enables streaming KV-cache reuse across frames; the low per-token entropy and strong intra-block correlations of driving-domain reasoning make a non-autoregressive diffusion drafter highly effective for speculative decoding; and the velocity field's structure---sharp at the endpoints, flat in the middle---permits adaptive step caching that concentrates compute where it matters. Layered on system-level CUDA Graph compilation and kernel fusion, these techniques compound. Applied to Alpamayo 1.5-10B with W4A8 quantization, FlashDrive reduces end-to-end latency from 717ms to 151ms (4.7x) while leaving accuracy essentially unchanged: [email protected] shifts by only 0.08m, minADE1 improves, and closed-loop collision and off-road rates improve in simulation. By raising a 10B-parameter reasoning VLA from 1.4Hz to 6.6Hz on a single GPU, FlashDrive moves end-to-end autonomous driving substantially closer to real-time deployment.
Zekai Li, Yihao Liang, Hongfei Zhang +3
1UC San Diego · 2Princeton · 3Independent Researcher