From Representational Complementarity to Dual Systems: Synergizing VLM and Vision-Only Backbones for End-to-End Driving
Sining Ang, Yuguang Yang, Chenxu Dang, Canyu Chen, Cheng Chi, Haiyan Liu, Xuanyao Mao, Jason Bao, Xuliang, Bingchuan Sun, Yan Wang
TL;DR
The paper analyzes representational and behavioral differences between full vision-language models (VLMs) and vision-only backbones within an end-to-end driving framework, revealing that policy learning compresses heterogeneous backbone signals into a shared decision space while VLMs expand subspaces at the representation level. It shows that complementarity between VLM and vision-only policies is mainly long-tail and manifested in distinct driving styles, which can be exploited by trajectory-level selection rather than representation-only gating. The authors propose HybridDriveVLA and DualDriveVLA to fuse or selectively deploy the two branches, achieving PDMS improvements up to $92.10$ and faster throughput with a strong fast-path fallback, thereby turning complementarity into practical gains. This work provides a principled analysis-to-mechanism pipeline from representation isomorphism (RQ1) to trajectory-level selection (RQ3), enabling efficient, robust deployment of hybrid VLA driving systems.
Abstract
Vision-Language-Action (VLA) driving augments end-to-end (E2E) planning with language-enabled backbones, yet it remains unclear what changes beyond the usual accuracy--cost trade-off. We revisit this question with 3--RQ analysis in RecogDrive by instantiating the system with a full VLM and vision-only backbones, all under an identical diffusion Transformer planner. RQ1: At the backbone level, the VLM can introduce additional subspaces upon the vision-only backbones. RQ2: This unique subspace leads to a different behavioral in some long-tail scenario: the VLM tends to be more aggressive whereas ViT is more conservative, and each decisively wins on about 2--3% of test scenarios; With an oracle that selects, per scenario, the better trajectory between the VLM and ViT branches, we obtain an upper bound of 93.58 PDMS. RQ3: To fully harness this observation, we propose HybridDriveVLA, which runs both ViT and VLM branches and selects between their endpoint trajectories using a learned scorer, improving PDMS to 92.10. Finally, DualDriveVLA implements a practical fast--slow policy: it runs ViT by default and invokes the VLM only when the scorer's confidence falls below a threshold; calling the VLM on 15% of scenarios achieves 91.00 PDMS while improving throughput by 3.2x. Code will be released.
