- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper addresses the high inference latency of interactive video world models with a training-free framework that jointly conditions computation allocation on perceived visual evidence and action cues. The central insight—that visual history reveals redundancy while the action signal indicates whether it remains exploitable—is sound and well-articulated. The three components (block-wise context compression, action-conditioned attention sparsity, interruption-aware cache reuse) are clearly motivated against concrete limitations of prior work. Results (2.77×/1.74× DiT-core speedups with improved fidelity and revisit consistency) are convincing on two backbones. Concerns include reliance on offline calibration that may not transfer across models, and the gap between DiT-core and end-to-end speedup (2.77× vs 2.15×) due to fixed VAE overhead. The absence of released code is a minor reproducibility concern. A solid, clearly-scoped contribution to efficient world-model inference.
Critical strengths
1.Visual history reveals the redundancy, while the upcoming action reveals where the model is heading. PACE provides a causally valid look-ahead signal for interactive world model that generic autoregressive accelerators do not have.
2.The paper cleanly separates DiT inference cost into sequence length n, attention interactions A, and number of forward passes S, and assigns exactly one mechanism to each (BCC, ACSA, ICR). This makes the speedup interpretable rather than a bag of tricks, and the training-free design lets it plug into existing backbones without retraining.
3.Evaluation covers two architecturally different backbones with 400 generations, reports wall-clock latency (not just FLOPs) alongside an end-to-end component breakdown, and the ablations isolate both each module and each internal design choice. Notably, PACE improves PSNR over Light Interaction at comparable latency (26.21 vs. 24.81 dB) .
Critical weaknesses
1.More evaluations on longer or shorter memory trunks are needed. All latency and memory numbers are averaged over fixed-length rollouts of roughly 15–16 chunks, so it is unknown whether the 2.77× speedup holds as the interaction history keeps accumulating. Since long-horizon interaction is the central use case of interactive world models, like in Longbot-World [1] and other long-horizon models.
2.The action signal is limited to camera geometry and is only tested on preset trajectories. Actions is injected solely as target camera pose and FoV, reduced to a binary exploration/revisitation state, leaving keyboard, object-interaction, and physics actions uncovered. Moreover, experiments uses only two fixed camera trajectories and the appendix states the exploration/revisitation schedule is precomputed offline, so robustness to more free-form user input is unverified.
3.The advertised 2.77× is DiT-core latency excluding VAE decoding, while the full end-to-end speedup is only 2.15×; the paper should make this distinction more prominent. Also, SVG and BSA become dramatically slower than Original on Matrix-Game 3.0 (0.22× and 0.15×), and the result is counterintuitive and unexplained.
[1] Advancing open-source world models. arXiv preprint arXiv:2601.20540
Questions for authors
What is the performance of the proposed method on different memory size? What is the behavior of the method on other types of user inputs, like object-interactions or so?
3 comments
(2/2) W3: On Inference Speedup Results and Performance Degradation of Baselines.
1) Distinction between DiT-core and end-to-end speedups.
We agree that the distinction between the DiT-core speedup and the end-to-end speedup should be made more prominent. Therefore, we have reported both the 2.77× DiT-core speedup and the 2.15× end-to-end speedup on HY-WorldPlay in the abstract of the revised manuscript, making the statement of PACE's practical inference efficiency gains clearer.
2) Analysis of the slowdown of SVG and BSA on Matrix-Game 3.0.
Thanks for pointing this out. The slowdown stems from the limited room for attention sparsification on Matrix-Game 3.0, together with the layout-adaptation overhead of existing sparse-attention implementations. Firstly, attention sparsification alone has a low speedup ceiling on Matrix-Game 3.0. With a wide backbone (hidden dimension 5120) and short attention sequences, attention accounts for only 31%–36% of the DiT FLOPs. Under the 31% retention ratio, even a zero-overhead sparse attention is bounded at 1.27×–1.33× DiT speedup, whereas PACE reaches 1.74× by additionally compressing the context and reusing denoising computation. In contrast, attention accounts for 37%–76% of the DiT FLOPs on HY-WorldPlay, where BSA does achieve a 1.29× speedup. Secondly, the block layouts of SVG and BSA do not match Matrix-Game 3.0. Its latent grid cannot be directly partitioned into the blocks of BSA, requiring padding, valid-token extraction, and layout restoration; SVG similarly requires token extraction, QKV layout conversion, and per-head pattern selection. Our profiling shows that these operations add about 206 ms (BSA) and 124 ms (SVG) per attention call, far exceeding the theoretical saving of about 8 ms per call. Therefore, the slowdown reflects the strong dependence of kernel-level sparse attention on model-specific layouts and FLOP composition, whereas PACE operates at the context and cache levels and transfers across backbones more readily. We have added this analysis to the revised manuscript.
Thanks for replies from the authors. My concerns are largely solved, in terms of memory-sized inference stability and acceleration stability. No need to change the rating.
Dear Reviewer, we sincerely thank you for the valuable comments. We organize our responses into 2 sections to address your concerns regarding robustness under different interaction history lengths and diverse user inputs (W1–W2 & Q1–Q2), as well as the inference speedup results and the performance degradation of baselines (W3).
(1/2) W1–W2 & Q1–Q2: On Robustness under Different Interaction Lengths and Diverse Actions.
1) Performance under different interaction history lengths (W1 & Q1).
Thanks for the concern regarding PACE’s behavior under growing interaction history. We would like to first clarify that the original experiments adopt fixed-length rollouts to exactly follow the evaluation protocol of Light Interaction, ensuring fair comparisons with existing acceleration methods. Structurally, PACE’s speedup does not diminish as the history accumulates. Both backbones maintain a bounded historical context (sink, selected history, and recent frames) rather than an ever-growing KV cache, so the per-chunk cost of Original, and hence the per-chunk savings of PACE, remain stable as the rollout extends. To verify this, we conduct additional experiments on WBench [1], whose cases contain 2–6 interaction rounds, corresponding to 12–36 generated chunks on HY-WorldPlay and 14–42 on Matrix-Game 3.0, i.e., more than twice the length of the original rollouts. As shown in Tab. R4, PACE achieves 3.11× and 1.76× DiT-core speedups, even higher than the 2.77× and 1.74× under the original fixed-length protocol, while outperforming Original in WBench overall scores (76.08 v.s. 75.84 and 55.02 v.s. 53.79). Moreover, compared with Light Interaction, PACE achieves lower latency and higher agreement with Original on both models.
Table R4: Comparison on the WBench navigation split. PSNR, SSIM, and LPIPS measure agreement with Original outputs. The best results within each backbone are shown in bold.
2) Diverse actions and flexible user inputs (W2 & Q2).
Firstly, for more diverse camera actions, we evaluate PACE on the full navigation split of WBench [1]. This split contains 158 multi-turn navigation cases, covering six trajectory types: round-trip, progressive, repeat, L-shape, loop, and zigzag. Among them, the L-shape, loop, and zigzag trajectories involve continuous direction changes and scene revisits, enabling the evaluation of PACE's applicability under more complex camera motion patterns. As shown in Tab. R4 above, PACE achieves 3.11× and 1.76× DiT-core speedups on HY-WorldPlay and Matrix-Game 3.0, respectively, while maintaining good generation quality.
Secondly, for interaction scenarios beyond camera navigation, we adapt PACE to Zing-0.5 [2], which supports joint control with keyboard actions and online text instructions. As shown in Fig. 5, we further conduct a case study that generates a 60-second multi-turn interaction sequence, which involves object state changes (a stone statue opening its eyes and glowing) and character behaviors (moving forward, moving left, moving right, kneeling, standing up, jumping, and floating).
PACE successfully renders these object state changes and character actions, while, as shown in Tab. R5, reducing the DiT-core latency from 101.89 s to 43.83 s, achieving a 2.325× speedup. Notably, in the final stage of this case, Original generates an extra statue face and fails to render the character floating, whereas PACE avoids this visual artifact and successfully renders the floating action. This qualitative case demonstrates the feasibility of applying PACE to non-camera interaction scenarios. Detailed results are provided in Fig. 5, Tab. 9, and Appendix E.
Table R5: DiT-core latency and speedup on Zing-0.5 for a 60-second multi-turn interaction sequence.
Overall, these supplementary experiments extend the evaluation of PACE beyond predefined camera trajectories, further demonstrating its applicability to diverse multi-turn navigation trajectories and non-camera interaction behaviors. We have added the relevant experimental results to Fig. 5, Tab. 2, Tab. 9, and Appendix E of the revised manuscript.
[1] WBench: A Comprehensive Multi-turn Benchmark for Interactive Video World Model Evaluation. arXiv’26.
[2] Zing-0.5: Toward Playable Worlds with Real-Time Joint Action and Text Control. arXiv’26.