- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a framework for AI-generated video detection that leverages velocity responses from a pretrained Flow Matching video DiT rather than relying exclusively on appearance based artifacts. The method extracts representations at multiple noise timesteps, incorporates temporal consistency information through velocity differences, and introduces a real-centered optimization objective to improve generalization to unseen generators. Experiments on various dataset demonstrate substantial improvements over existing methods.
Critical strengths
- Using the velocity response of pretrained generative video models as forensic representations is novel and provides a valid alternative to conventional appearance and artifact based detection.
- TRACE achieves SOTA performance in various setting and benchmarks.
- Combining noise-conditioned velocity representations with frame to frame differences is a reasonable way to incorporate both generative model responses and temporal consistency.
- The paper includes multiple ablations to support the method.
Critical weaknesses
Although, I like the idea and simplicity of the method, I have few questions and concerns.
- The choice of S is not sufficiently justified, particularly given the appendix results showing that velocity representation remain informative at larger noise timesteps. It is unclear whether the selected timesteps contribute complementary information or whether a single well-chosen timestep could achieve comparable performance.
- Extracting velocity features at every selected prove point increases computational overhead and feature dimensionality. The paper does not provide a sufficiently detailed accuracy efficienty analysis.
Questions for authors
See Weaknesses
5 comments
W2. Computational Efficiency and Accuracy-Efficiency Trade-off
We thank the reviewer for highlighting the importance of computational efficiency. We provide additional evaluations of TRACE in terms of computational complexity, inference latency, GPU memory consumption, and model parameters. We also clarify the distinction between the training and inference costs of our framework.
First, TRACE has a lightweight training process despite using a large pretrained video DiT. Specifically, we keep the pretrained DiT backbone completely frozen and optimize only the lightweight detection components. As shown in Table 2, the number of trainable parameters in TRACE is only 0.0008M for the single-timestep variant and 0.0041M for the five-timestep variant, compared with 14.415B total parameters in the Wan2.2-A14B-based model. This substantially reduces the number of parameters requiring optimization and avoids the substantial training cost of fine-tuning large-scale video generation models. Therefore, although TRACE leverages a large pretrained backbone, its task-specific training remains highly parameter-efficient.
Second, we acknowledge the inference overhead introduced by the large pretrained DiT. To provide a comprehensive assessment, we report the FLOPs, end-to-end inference latency, peak GPU memory consumption, total parameters, and trainable parameters of different methods and TRACE configurations in Table 2. All computational costs are measured for the complete detection pipeline, including velocity extraction and subsequent feature processing. The results show that the five-timestep TRACE configuration incurs considerable inference overhead, primarily due to repeated DiT forward passes. To explore a more efficient configuration, we evaluate a single-timestep variant using . This reduces the number of DiT forward passes and substantially lowers computational complexity and inference latency, while achieving 96.71% AUC on open-source and 92.38% AUC on closed-source generator settings. Notably, it achieves the best performance among the single-timestep configurations, providing a more favorable accuracy-efficiency trade-off.
Finally, we explore the feasibility of reducing inference costs through smaller backbones. As shown in Table 2, TRACE can also operate with the Wan2.1-T2V-1.3B backbone, demonstrating that our framework is not inherently restricted to the 14B model. Although the smaller backbone offers a substantially more compact alternative, further reducing its inference cost remains an important direction. In future work, we will investigate knowledge distillation to transfer the forensic representations and discriminative capabilities of the large DiT into lightweight video models, together with model pruning and quantization to further reduce computational complexity, memory consumption, and energy usage. These techniques could enable TRACE to retain its forensic effectiveness while operating with smaller, more efficient backbones, facilitating low-power inference and deployment in resource-constrained environments.
We have incorporated these additional efficiency evaluations and discussions into Appendix G of the revised manuscript.
Table 2. Computational efficiency comparison of different methods and TRACE configurations.
| Method | FLOPs (G) | Latency (s/video) | Peak GPU Memory (GB) | Total Params (B) | Trainable Params (M) |
|---|---|---|---|---|---|
| Effort | 1,296.4 | 0.022 | 1.97 | 0.505 | 0.199 |
| ForgeLens | 169.7 | 0.020 | 1.69 | 0.444 | 7.097 |
| V-PVP | 361.0 | 0.015 | 0.39 | 0.087 | 0.493 |
| Qwen2.5-ViT | 13,878.8 | 0.292 | 1.73 | 0.669 | 668.686 |
| TRACE (Wan2.1-T2V-1.3B, ) | 67,500.0 | 0.890 | 3.49 | 1.546 | 0.0008 |
| TRACE (Wan2.2-A14B, ) | 438,200.0 | 3.052 | 29.24 | 14.415 | 0.0008 |
| TRACE (Wan2.2-A14B, ) | 2,191,000.0 | 13.699 | 29.24 | 14.415 | 0.0041 |
Thank you for your response.
First Concern
Resolved. Given the differences between the two methods and the improved performance.
Second Concern
Remains unresolved. Although the number of trainable parameters is small, the substantially higher inference latency of TRACE, particularly as the number of timesteps increases (which is an important factor in achieving better performance), may significantly limit its practical applicability.
As another reviewer JYDM also raised a similar concern, I would be interested in hearing their perspective on this issue before finalizing my rating.
We thank the reviewer for raising this important question regarding timestep selection and the complementary benefits of multi-timestep representations. Our choice of S={0,25,50,75,100} is primarily motivated by the empirical analysis in Appendix D, which shows that the discriminability of velocity representations reaches its peak around timestep 100. This observation suggests that the selected range covers the most informative stages of the flow-matching trajectory. Furthermore, the original manuscript already includes timestep ablations in Sec. 4.4.1, comparing timesteps 0, 100, and 200, to investigate the effectiveness of extending the timestep to larger noise levels.
To further examine whether different timesteps provide complementary information or whether a single well-chosen timestep is sufficient, we conduct additional experiments comparing individual timesteps with multi-timestep configurations. Specifically, we evaluate five single-timestep variants, each using velocity features extracted at one of s∈{0,25,50,75,100}, as well as two multi-timestep variants: the selected configuration {0,25,50,75,100} and an extended configuration {0,50,100,150,200}. All variants are evaluated under otherwise identical experimental settings. We report AUC on both open-source and closed-source generator settings, as summarized in Table 1.
Table 1. AUC (%) of different timestep configurations on open-source and closed-source generator settings.
As shown in Table 1, the individual timesteps exhibit different detection performance, suggesting that velocity responses at different stages of the flow-matching trajectory capture distinct forensic characteristics. More importantly, fusing the five selected timesteps achieves the best performance in both settings, reaching 97.95% AUC on open-source generators and 95.11% AUC on closed-source generators. Compared with the best single-timestep variant (i.e., s=100), multi-timestep fusion improves AUC by 0.07 and 1.22 percentage points, respectively. This improvement is particularly evident in the closed-source setting, suggesting that aggregating velocity responses across different trajectory stages provides complementary forensic information, especially for generalization to unseen generators.
We also compare the selected configuration with the extended configuration {0,50,100,150,200}, which incorporates larger noise timesteps. The selected configuration achieves higher AUC by 0.74 and 1.25 percentage points on open-source and closed-source settings, respectively. These results are consistent with the discriminability analysis in Appendix D, further supporting our choice to focus on timesteps up to 100 rather than extending the representation to larger noise levels.
The analysis in Appendix D, the existing timestep ablations in Sec. 4.4.1, and our additional single- versus multi-timestep comparisons consistently support the effectiveness of the selected timestep configuration. In particular, the results demonstrate that the selected five timesteps capture complementary forensic information and provide better overall performance than either individual timesteps or configurations extending to larger noise levels. We have incorporated these additional results and the corresponding discussion into Appendix H of the revised manuscript.