KERV: Kinematic-Rectified Speculative Decoding for Embodied VLA Models
Authors: Zihao Zheng, Zhihao Mao, Maoliang Li, Jiayu Chen, Xinhao Sun, Zhaobo Zhang, Donggang Cao, Hong Mei, +1 more
Organizations: School of Computer Science, Peking University, Beijing, China · School of Computer Science, China University of Geosciences (Wuhan), Wuhan, China
Vision-Language-Action (VLA) models build a token-domain robot control paradigm, yet suffer from low speed. Speculative Decoding (SD) is an optimization strategy that can boost inference speed. Two key issues emerge when integrating VLA and SD: first, SD relies on re-inference to address token errors, which is computationally expensive; second, to mitigate token errors, the acceptance threshold in SD requires careful adjustment. Existing works fail to address the above two issues effectively. Meanwhile, as the bridge between AI and the physical world, existing embodied intelligence has overlooked the application of robotic kinematics. To address these issues, we innovatively combine token-domain VLA models with kinematic-domain prediction for SD, proposing a kinematic-rectified SD framework named KERV. We employ a kinematics-based Kalman Filter to predict actions and compensate for SD errors, avoiding costly re-inference. Moreover, we design a kinematics-based adjustment strategy to dynamically rectify the acceptance threshold, addressing the difficulty of threshold determination. Experimental results across diverse tasks and environments demonstrate that KERV achieves 27%~37% acceleration with nearly no Success Rate loss.
Figures & tables
Figure 1. (a) Naive VLA+SD vs. (b) SpecVLA vs. (c) The Proposed KERV fig1
Env.
AR
Naive VLA+SD
SR
Speed
Step
T(s)
SR
Speed
Step
T (s)
AFEP
Goal
77.0%
1 ×
157.6
0.188
76.2%
0.86 ×
159.2
0.217
2.04
Object
71.2%
1 ×
191.7
0.197
68.6%
0.96 ×
195.9
0.200
1.75
Spatial
82.8%
1 ×
126.9
0.198
82.8%
0.98 ×
127.3
0.201
1.59
Long
54.4%
1 ×
393.2
0.190
50.2%
0.91 ×
400.7
0.217
1.67
Table 1. Case Studies on Naive Integration of VLA and SD
Figure 2. Discrepancy about Errors fig2
Figure 3. Discrepancy about Acceptance Threshold fig3
Figure 4. KF-Based Compensation Mechanism in KERV fig4
Figure 5. Kinematic-Based Threshold Adjustment in KERV fig5
Figure 6. System Implementation of KERV fig6
Figure 7. An Experimental Example of KERV on LIBERO-Goal Environment fig7
Env.
Method
SR
Speed
AFEP
Steps
Hardware
Goal
Naive VLA+SD
76.2%
1.00 ×
2.04
159.2
GPU
SpecVLA ( r =9)
75.4%
1.19 ×
2.97
157.3
GPU
SpecVLA ( r =15)
71.0%
1.23 ×
3.63
166.8
GPU
SpecVLA ( r =20)
64.2%
1.21 ×
4.23
176.3
GPU
KERV
75.6%
1.54 ×
4.73
153.5
CPU+GPU
Object
Naive VLA+SD
68.6%
1.00 ×
1.75
195.9
GPU
Table 2. End-to-End Results of KERV and Baselines
KERV
Goal
Object
Spatial
Long
CM
TA
SR
Speed
SR
Speed
SR
Speed
SR
Speed
✔
✗
72.6%
1.57 ×
68.1%
1.48 ×
80.9%
1.59 ×
46.9%
1.48 ×
✗
✔
77.0%
1.17 ×
72.9%
1.07 ×
85.0%
1.21 ×
49.6%
1.11 ×
✔
✔
75.6%
1.54 ×
72.3%
1.49 ×
83.7%
1.57 ×
48.8%
1.48 ×
Table 3. Ablation Studies of KERV
Figure 8. Experiments of Hyper-Parameters in KERV fig8
Vision-Language-Action (VLA) Models have become the mainstream solution for robot control, but suffer from slow inference speeds. Speculative Decoding (SD) is a promising acceleration method which can be divided into two categories: drafter-based SD and retrieval-based SD. Each of the two methods demonstrates complementary advantages and limitations when applied to VLA models, leading to the hypothesis that a hybrid approach integrating these two methods will yield better performance. In this paper, we first conduct a series of detailed analyses to reveal the advantages and feasibility of hybrid utilization. However, even with the aforementioned key insights, implementing hybrid SD in VLA models presents several challenges: (1) draft rejection and persistent errors in retrieval-based SD; (2) difficulty in determining the hybrid boundary. To address these, we propose the HeiSD framework. We propose a retrieval-based SD optimization method in HeiSD, which contains a verify-skip mechanism and a sequence-wise relaxed acceptance strategy. Moreover, we proposed a kinematic-based fused metric in HeiSD to automatically determine the hybrid boundary. Experimental results demonstrate that HeiSD attains a speedup of up to 2.45x in simulation benchmarks and 2.06x~2.41x in real-world scenarios, while sustaining a high task success rate.
Zihao Zheng, Zhihao Mao, Sicheng Tian +8
School of Computer Science, Peking University · School of Computer Science, China University of Geosciences (Wuhan) · School of Artificial Intelligence, Beijing Normal University +1
Vision-Language-Action (VLA) models exhibit strong generalization for robotic manipulation, yet their high inference latency limits real time deployment. We identify two primary sources of temporal redundancy in existing VLA pipelines: repeated visual encoding of highly similar consecutive frames and multi step iterative sampling in diffusion based policies. To address this, we propose a system level acceleration strategy that reduces computation in both perception and action generation. On the perception side, we incrementally update only tokens corresponding to dynamic scene regions instead of re-encoding entire frames. On the policy side, we compress diffusion sampling into a compact 2-step schedule through efficiency oriented training while preserving action precision. Experiments on Libero, RobotWin, and Real Robot Platforms demonstrate over 2 times speedup while maintaining high performance, achieving up to 98% success rate on general manipulation benchmarks. Our codes will be released on Github.
Yuzhou Wu, Yuxin Zheng, Muchun Niu +6
1Tianji KernalMind co ltd · 2Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, China · 3Shanghai Jiao Tong University, Shanghai, China +2
Vision-language-action (VLA) policies generate robot controls autoregressively, making closed-loop latency dominated by repeated target-model forward passes. Speculative decoding reduces this cost by verifying blocks of draft action tokens in parallel, and recent VLA methods further relax token-level acceptance because small differences in action-token space often map to similar continuous controls. However, this relaxation remains scene-agnostic. A fixed token-distance tolerance treats the same action-token deviation as equally safe across states, although deviations that are harmless in free space can cause collisions or grasp failures near contact. We propose WA-SpecDec, a world-aware speculative decoding framework that injects world-model-derived physical scene awareness during the VLA prefill stage, producing shared world-aware prefill states for draft proposal and target verification without changing the relaxed acceptance rule. Across three state-of-the-art relaxed acceptance schemes, WA-SpecDec preserves higher task success under looser relaxation and enables longer accepted prefixes. At comparable-success operating points, WA-SpecDec achieves a 1.5x matched-success speedup over VLA speculative decoding alone and reduces near-contact failure (NCF) by 18.6% on average relative to the corresponding speculative baselines.