- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes TAPE, a training-free token-pruning framework for accelerating video diffusion transformers. Rather than permanently removing tokens, it skips computation for selected tokens while retaining their representations for reconstruction. The method combines temporal averaging of attention-based importance scores, periodic token reselection across layers, and a denoising schedule that gradually reduces pruning. Experiments on HunyuanVideo and Wan2.1 compare the speed–quality trade-off against EViT, ToMe, and STA-ViT using VBench, with additional FVD comparisons on HunyuanVideo.
Critical strengths
The reported low-pruning operating point is practically useful. At 20% token reduction, TAPE achieves a reported 1.3× speedup while changing the VBench total score from 83.24 to 83.16 on HunyuanVideo (Table 4), with a similar trend on Wan2.1 (Table 8). Obtaining this trade-off without retraining is an advantage for applying the method to existing checkpoints. The dimension-level results in Table 10 also support improvements in background consistency and temporal flickering relative to the evaluated pruning baselines.
Critical weaknesses
- The methodological contribution is incremental, and the evaluation does not sufficiently establish its significance for video-generation acceleration. The method consists of a two-frame average of importance scores, periodic re-ranking, and a manually specified decreasing pruning schedule (§4). These are reasonable design choices, but the demonstrated advance is limited to improving three token-reduction baselines. There is no comparison with generation-specific sparse-attention or caching approaches, nor with simply reducing denoising steps at matched inference time. For a method whose main contribution is a better speed–quality trade-off, these comparisons are important: outperforming the selected pruning adaptations does not establish that TAPE offers a competitive allocation of inference computation. The second-model evaluation is useful, but it repeats the same restricted comparison.
- The evidence does not adequately isolate or validate the central temporal-coherence mechanism. Equation (1) averages scores at the same spatial index in adjacent frames, without establishing correspondence between their contents. Under object motion, camera motion, or occlusion, changing token importance may be appropriate rather than undesirable selection jitter. The paper explains why explicit motion estimation would be costly, but this does not establish when fixed-coordinate smoothing preserves the right computation. Figure 5 provides an illustrative mask comparison, and Table 6 shows a smoothing-weight trade-off, but neither resolves this distinction. Moreover, Table 5 evaluates each component individually and all three together, but omits reselection plus timestep scheduling without smoothing. It therefore does not establish the additional benefit of temporal smoothing within the complete framework. This leaves an important gap between the paper’s central explanation and the evidence supporting it.
Questions for authors
- At a matched inference-time budget, how does TAPE compare with reducing the number of denoising steps and with a relevant generation-specific accelerator? Please report absolute inference times and clarify whether importance scoring, token selection, and reselection overhead are included in the reported speedups.
- What happens when temporal smoothing is disabled while retaining both token reselection and timestep scheduling? Please report the temporal-quality dimensions as well as the total score at comparable computational cost. Within the evaluated videos, is its benefit maintained for substantial object or camera motion, where identical spatial indices need not correspond to the same content?