- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
ForcingBooster trains a small router to stop denoising selected patches while keeping the video generator frozen. Stopped patches retain their clean-latent estimates and cached context; other patches continue. The training loss balances error against the full-step output with denoising cost. Tests cover Causal Forcing 1.3B, Wan2.1 14B, LingBot-World-V2, and LongLive. On Causal Forcing, patch-NFE drops by 50.19% and end-to-end speed improves by 1.30x, while VBench Total falls from 82.08 to 81.55. Random and chunk-wise allocation perform worse at similar runtimes. The practical benefit is plausible, but comparisons with closer adaptive methods are missing.
Critical strengths
-
Only the small router needs training. Clean-latent exits and cached context let patches stop early without changing the generator’s weights, making the approach practical for existing few-step checkpoints.
-
Tests cover four generators and include routing, caching, and decoding in runtime measurements. The random-allocation and chunk-wise controls show that spatial placement matters. Reporting both patch-NFE and end-to-end time also makes the actual speed benefit clear.
Critical weaknesses
-
The closest alternatives are discussed but not tested. HSA already uses token-level budgets and preserves KV context; Patch Forcing learns patch-wise difficulty. Learned stopping on a frozen few-step generator differs from these methods, but the current controls do not show whether that difference is beneficial.
-
The advantage over uniform two-step sampling is small or mixed on some models. On Wan2.1, two steps give 83.35 Total at 1.29x speedup, versus 83.32 at 1.31x for ForcingBooster. On LingBot, two steps are faster with a similar Total score. There is no uncertainty analysis or direct test of camera/action adherence and long-horizon drift. Section 3.3 also leaves unclear whether replay states come from the full-step or routed trajectory, which matters for the on-policy training claim.
Questions for authors
- How does the method compare with adapted HSA and token-caching or adaptive-step baselines on the same checkpoints at matched runtime?
- Please give training pseudocode showing the source of replay states, continuation-cost estimation, and the complete weighted loss.
- Are the quality differences reliable under paired sampling? How does the method perform on action/camera adherence and longer rollouts, especially given the near-tie with two-step sampling?