DepthCache: Depth-Guided Training-Free Visual Token Merging for Vision-Language-Action Model Inference
Authors: Yuquan Li, Lianjie Ma, Han Ding, Lijun Zhu
Organizations: School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China. · School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, China.
Vision-Language-Action (VLA) models enable generalist robotic manipulation but suffer from high inference latency. This bottleneck stems from the massive number of visual tokens processed by large language backbones. Existing methods either prune or merge tokens uniformly, degrading the spatial reasoning essential for robotic control. We present DepthCache, a training-free framework that leverages depth as a structural prior for visual token compression. It partitions observations into depth-based regions and applies spatially differentiated merge ratios, preserving the near-field workspace while compressing the distant background. To exploit temporal redundancy, DepthCache distributes the merging process across consecutive frames, ensuring consistent representations while reducing per-step computation. A motion-adaptive pipeline further optimizes auxiliary view compression based on end-effector dynamics. The framework requires no model modification, generalizing across diverse VLA architectures. On the LIBERO benchmark, DepthCache achieves up to 1.28x inference speedup with less than 1% average success rate degradation across three VLA models (pi_0.5, OpenVLA, GR00T), whereas pruning and merging baselines incur 4--24% degradation at comparable compression. Real-world experiments on a physical manipulator demonstrate that DepthCache enables faster task throughput and more responsive closed-loop control in latency-sensitive scenarios.
Figures & tables
Fig. 1 : DepthCache enables training-free inference acceleration for VLA models with negligible performance loss. Top: speedup and success rate on LIBERO across three VLA architectures. Bottom: directly transplanting token merging (ToSA, left) causes hesitation during grasping; DepthCache (right) maintains fluid execution with reduced latency.
Fig. 2 : Overview of DepthCache. The primary view pipeline (top) forms a cyclic process: initialization computes dual protection sets, depth-based partitioning assigns differentiated merge ratios, and progressive merging reduces tokens across frames until scene change triggers re-initialization. The auxiliary view pipeline (bottom) employs a two-state machine to gate wrist camera compression by end-effector motion.
Success Rate (%)
Efficiency
Method
Spatial
Object
Goal
Long
Avg.
Speedup
ρ
OpenVLA
83.3
91.2
78.6
53.7
76.7
1.00 ×
100
OpenVLA + FastV
75.8
70.3
67.3
42.5
64.0 -12.7
1.39 ×
75.0
OpenVLA + SP-VLA †
80.0
82.4
73.6
51.6
71.9 -4.8
1.50 ×
dyn. ‡
OpenVLA + DepthCache
83.1
90.7
77.8
51.2
75.7 -1.0
1.21 ×
78.9
π0.5
99.0
97.0
99.0
96.5
97.9
1.00 ×
100
TABLE I : Main results on LIBERO simulation benchmark.
Task
Successes / 20
Baseline
+ Ours
Pick & Place
20 / 20
20 / 20
Stack Blocks
18 / 20
17 / 20
Drawer & Place
17 / 20
15 / 20
Total
55 / 60
52 / 60
Avg. Latency (ms)
191
143
TABLE II : Real-world core task results with π0.5 .
Fig. 3 : Real-world core task execution with DepthCache-augmented π0.5 . Perturbation recovery is shown in Fig. 1 .
Fig. 4 : Sequential multi-object sorting comparison. Top: baseline π0.5 . Bottom: π0.5 + DepthCache. The time gap accumulates across successive pick-and-place cycles.
Scenario
Successes / 15
Time (s)
Baseline
+ Ours
Baseline
+ Ours
Multi-Object Sorting
15 / 15
13 / 15
28.6
22.1
Perturbation Recovery
11 / 15
12 / 15
17.4
13.7
TABLE III : Extended scenario results (15 trials each).
Fig. 5 : Parameter sensitivity analysis on π0.5 (LIBERO). (a) Effect of maximum merge ratio rmax on success rate and speedup. (b) Effect of progressive merge step ratio η on success rate (log-scale x -axis). Default values ( rmax=0.7 , η=0.2 ) are highlighted.
Configuration
Success Rate (%)
Efficiency
Spatial
Object
Goal
Long
Avg.
Δ
Speedup
ρ
Full DepthCache
98.9
97.1
98.3
96.1
97.6
—
1.28 ×
68.2
w/o Depth Partitioning
92.9
75.1
78.4
71.1
79.4
-18.2
1.34 ×
67.5
w/o Dual Protection
96.0
85.7
92.1
87.2
90.3
-7.3
1.48 ×
55.6
w/o Progressive Merge
94.7
68.1
82.5
78.6
81.0
-16.6
1.32 ×
65.4
w/o Re-initialization
91.8
97.2
92.6
89.4
92.8
-4.8
1.25 ×
72.5
TABLE IV : Ablation study on DepthCache components using π0.5 .
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) models enable generalizable robotic control but remain computationally expensive. Token caching provides a training-free, plug-and-play acceleration alternative. However, existing VLA caching does not fully exploit a key inductive bias of VLA models: text-vision synergy, wherein textual semantics guide the precise visual grounding of task-relevant regions. In particular, existing designs insufficiently account for head-wise reliability in attention aggregation and layer-wise stability in cache reuse. To address this, we propose Text-Vision Synergistic Token Caching (TVCache), a training-free framework for efficient VLA inference. TVCache filters attention heads based on text-vision information focus to improve task-relevant and physically consistent visual grounding. Concurrently, we introduce a reuse-layer selection mechanism guided by text-vision entropy differences to avoid caching unstable representations and improve cache resource allocation. Extensive experiments across four representative VLA models, two simulation benchmarks, and real-world robotic tasks demonstrate the effectiveness and generality of TVCache. At matched token-retention ratios, TVCache consistently improves task success over existing VLA caching with comparable computational cost. On OpenVLA-OFT, it improves average success by up to 14.5 percentage points over VLA-Cache at 12.5% retention while reducing FLOPs by 2.45x relative to full-token inference.
Qianer Li, Chengjie Zhang, Jingwen Chen +3
College of Engineering, Southern University of Science and Technology (SUSTech), Shenzhen 518055, China · Master of Science in Data Science and Machine Learning, Department of Mathematics, Faculty of Science, National University of Singapore, Singapore
Vision-Language-Action (VLA) models have emerged as a promising approach for generalizable robotic manipulations. In particular, flow matching-based VLA models have shown remarkable success due to their capability to generate precise and smooth action sequences and capture multimodal distributions. However, the iterative denoising process in the action head acts as a major computational bottleneck, posing a critical challenge for real-time deployment. To address this challenge, we propose ActionCache, a plug-and-play external cache that opportunistically reuses past intermediate actions to warm-start generations from the vicinity of target actions, thereby drastically reducing the inference latency. Specifically, ActionCache stores the intermediate actions with compact multimodal keys, which enables retrieval from similar past contexts across different episodes or even different tasks. Experimental results in simulation and real-world environments demonstrate that ActionCache maintains high task success rates in a low-latency regime, achieving inference acceleration of up to 11.75× and 34.43× for representative flow-based VLA models, π0.5 and GR00T-N1.6, respectively.