Generative world models can provide visual rollouts for embodied planning, yet their feasibility on edge devices depends not only on the learned model but also on how the execution runtime represents its operations. We introduce a cache-aware lowering that expresses supported causal Conv3D calls as batched spatial Conv2D operations while preserving pretrained weights, temporal-cache semantics, convolution parameters, bias placement, and output layout. Across the complete Cosmos3-Edge image-to-video pipeline on a 64-GB NVIDIA Jetson AGX Orin, the proposed route accelerates VAE decoding by approximately 7× and reduces complete-generation latency by more than 2×, while repeated decoder evaluations maintain complete fast-path coverage without fallbacks. The unchanged lowering also improves Cosmos3-Nano and transfers to LingBot-World's architecturally distinct Wan2.1 VAE. A clean-device comparison against fully specialized TensorRT shows that TensorRT provides a further 1.36× steady-state improvement, but requires substantially greater per-module and per-runtime-state AOT specialization. Same-latent BF16 and FP32 evaluations characterize the finite-precision differences introduced by the alternative execution order. Together, these results position cache-aware lowering as a lightweight runtime optimization that recovers most of the available decoder acceleration without modifying the learned models themselves.
Figures & tables
Model
Rank
Cin→Cout
Tin→Tout
H×W
Tc
Calls
Time / VAE share
Nano
1
256 → 256
4 → 4
360 × 640
2
15
26.08 s / 17.88%
Nano
2
512 → 512
4 → 4
180 × 320
2
15
25.59 s / 17.55%
Nano
3
1024 → 1024
2 → 2
90 × 160
2
15
12.76 s / 8.75%
LingBot
1
96 → 96
4 → 4
480 × 832
2
18
12.620 s / 27.0%
LingBot
2
192 → 192
4 → 4
240 × 416
2
18
12.343 s / 26.4%
LingBot
3
192 → 192
4 → 4
240 × 416
1
6
5.115 s / 10.9%
Table 1: Highest-cost causal Conv3D signatures. Cosmos3-Nano uses Nsight GPU time at 1280×720 ; LingBot-World uses CUDA events at 480×832 . Edge uses the byte-identical Wan2.2 VAE but is not independently profiled.
Figure 1: Cache-aware lowering of each temporal tap to one batched Conv2D.
Table 3: Cosmos3-Edge complete image-to-video latency decomposition. Values are medians over three fresh-container runs per route. Tdit+other=Te2e−Tencode−Tdecode .
Model
Frames
C3D (s)
C2D (s)
Speedup
Coverage
Cosmos3-Edge
5
18.749
2.365
7.93 ×
67/67
Cosmos3-Edge
9
33.095
4.458
7.42 ×
101/101
Cosmos3-Edge
17
61.573
8.623
7.14 ×
169/169
Cosmos3-Edge
33
118.519
16.976
6.98 ×
305/305
Cosmos3-Edge
49
175.569
25.379
6.92 ×
441/441
Cosmos3-Nano
5
20.52
3.78
5.43 ×
67/67
Table 4: VAE-decoder BF16 latency. Cosmos3-Edge values are medians of n=3 runs per route; Cosmos3-Nano and LingBot-World values have n=1 . Coverage reports fast-path hits over WanCausalConv3d invocations within the measured decoder boundary, excluding pre-target activity. Cosmos3-Nano records 1,083/1,083 fast-path executions across the sweep.
Model
Full max
Mean abs.
RMSE
Cosine
NaN/Inf
Cosmos3-Edge
4.49e−2
1.84e−3
2.75e−3
0.99998334
0/0
Cosmos3-Nano
3.3203e−2
1.8781e−3
2.8215e−3
0.99998309
0/0
LingBot-World
2.3440e−2
1.5640e−3
2.3230e−3
0.99998402
0/0
Table 5: Same-latent BF16 agreement at 17 output frames. Cosmos3-Edge and LingBot-World use synthetic decoder-compatible latents; Cosmos3-Nano uses a saved generated latent.
Method
Latency (s)
Speedup
Coverage
PyTorch eager
61.72
1.00×
native
Ours
9.23
6.69×
169/169
TensorRT
6.78
9.10×
169/169
Table 6: Clean-device 17-frame decoder comparison on Jetson AGX Orin. Latency is the median over six runs; coverage denotes accelerated WanCausalConv3d calls.
World Action Models (WAMs) generalize better than standard Vision-Language-Action (VLA) policies to novel motions and environments, because a video-modeling objective lets them learn from abundant unlabeled video rather than scarce labeled robot demonstrations. This generalization is computationally expensive. To complete a task, a WAM runs over multiple inference chunks, and each chunk requires a costly denoising process. Existing acceleration methods reduce this cost by caching and reusing computation within a single chunk's denoising trajectory. Our empirical analysis reveals a substantial source of redundancy they overlook: redundancy across chunks. When a robot executes a smooth behavior, the residuals computed at a given denoising step are strongly correlated from one chunk to the next. We introduce C3ache, a training-free method that caches and reuses these residuals across inference chunks at the same denoising step. Experiments on benchmarks with a Fast-WAM backbone show that C3ache achieves up to a 2.5× speedup in total wall-clock inference time, with negligible degradation in task success rate.
Weisen Zhao, Lam Nguyen, Zhicong Lu +1
George Mason University · University of Central Florida
Latent diffusion models enable high-quality video generation, but video VAE encoding and decoding remain computationally expensive. Existing methods use stage-specific lightweight operators, yet either constrain spatial and temporal computation jointly or remove temporal computation altogether, without distinguishing their compression sensitivities in pretrained Conv3D. To address these limitations, we present LightVAE, a compression framework that exploits redundancy in temporal modeling and network depth. LightVAE exactly reparameterizes eligible causal Conv3D layers into an aggregate spatial response and a difference-driven temporal correction. Based on their distinct compression sensitivities, temporal low-rank compression (TLR) keeps the aggregate spatial kernel dense and applies layer-specific low-rank approximation only to the temporal correction. An algebraically equivalent folded implementation converts the arithmetic savings into practical acceleration. LightVAE further uses width-preserving block pruning to reduce depth and probe-guided feature alignment, guided by feedback from a frozen teacher suffix, to recover quality after compression. The framework also extends to video encoders. Across three video VAE backbones and two GPU platforms, LightVAE consistently accelerates decoding. For the Wan VAE family, it achieves up to 2.24× and 1.11× the decoding throughput of state-of-the-art efficient VAE decoders on NVIDIA H100 and RTX~5090, respectively, with higher DAVIS PSNR and lower LPIPS. On MiniMax-H3, it achieves up to 2.97× the original decoding throughput while retaining 99.51% of the original model's overall VBench-2.0 score. Our code is available at https://github.com/ModelTC/LightVAE.
Shiqiao Gu, Yang Yong, Fengjun Zhong +5
SenseTime · Beihang University · Nanyang Technological University
Diffusion Transformers (DiTs) power high-fidelity video world models but remain computationally expensive due to sequential denoising and costly spatio-temporal attention. Training-free feature caching accelerates inference by reusing intermediate activations across denoising steps; however, existing methods largely rely on a Zero-Order Hold assumption i.e., reusing cached features as static snapshots when global drift is small. This often leads to ghosting artifacts, blur, and motion inconsistencies in dynamic scenes. We propose WorldCache, a Perception-Constrained Dynamical Caching framework that improves both when and how to reuse features. WorldCache introduces motion-adaptive thresholds, saliency-weighted drift estimation, optimal approximation via blending and warping, and phase-aware threshold scheduling across diffusion steps. Our cohesive approach enables adaptive, motion-consistent feature reuse without retraining. On Cosmos-Predict2.5-2B evaluated on PAI-Bench, WorldCache achieves \textbf{2.3×} inference speedup while preserving 99.4% of baseline quality, substantially outperforming prior training-free caching approaches. Our code can be accessed on World-Cache.
Umair Nawaz, Ahmed Heakl, Ufaq Khan +3
Mohamed bin Zayed University of Artificial Intelligence, UAE · Linköping University, Sweden