- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes ForgeLoc-R1, a reinforcement fine-tuning framework for temporal forgery localization using video multimodal large language models. It combines Anchor-Guided Advantage Pruning, a Set-Level Reward, and a Count-Balanced Objective to address weak learning signals and segment-count bias in GRPO. Experiments on ActivityForensics and DDL show improvements over reinforcement fine-tuning baselines, particularly for multi-segment localization and an unseen video generator.
Critical strengths
- Important topic.
- Well-motivated method design.
- Controlled comparisons across two benchmarks.
Critical weaknesses
-
The novelty over existing anchor-guided and rollout-selection methods is insufficiently established, with several important baselines missing.
-
Some experimental conclusions are inconsistent with the reported results, and the ablations do not fully isolate individual contributions.
-
Limited statistical validation, missing code, and insufficient evaluation under realistic deployment conditions weaken the reliability and generality of the findings.
Questions for authors
-
The novelty of ForgeLoc-R1 requires stronger differentiation from existing reinforcement fine-tuning methods. TempSamp-R1 already injects ground-truth solutions into GRPO groups, while [1] incorporates off-policy guidance into policy optimization. Moreover, the advantage-based rollout selection resembles the down-sampling strategy in [2], and the count-balanced objective adopts repeat-factor sampling from LVIS [3]. What are the fundamental technical contributions beyond combining these existing mechanisms for temporal forgery localization? In particular, how is the importance ratio handled for a ground-truth anchor that was not sampled from the behavior policy? Since Proposition 1 effectively introduces a weighted likelihood update toward the ground-truth answer, comparisons with SFT and SFT-then-GRPO under matched training budgets are also necessary to establish the benefits of the proposed reinforcement learning design.
-
The experimental comparisons are insufficient to establish the practical advantage of using a general-purpose MLLM for temporal forgery localization. Although the introduction argues that dedicated detectors are limited to specific manipulation traces, no dedicated temporal forgery localizer is evaluated. Could the authors compare ForgeLoc-R1 against representative detectors such as UMMAFormer and Feng et al. (2026b) under the same benchmark splits? The related work should also discuss "VidGuard-R1" [4], "FakeShield" [5], and the closely related "VidForensics-M1" [6], which investigates reinforcement learning with verifiable temporal grounding for video forensics. These comparisons would better establish both the novelty and practical competitiveness of the proposed approach.
-
Several experimental interpretations appear inconsistent with the reported results. Section 4.1 attributes the DDL improvements primarily to localizing more segments rather than obtaining tighter boundaries, but Table 5 shows that ForgeLoc-R1 matches fewer DDL segments than TempSamp-R1 (73.5% versus 76.1%) while achieving smaller boundary errors. Table 3 also reports a higher under-reporting rate on DDL (65.0% versus 58.3%), contradicting the explanation that the method consistently recovers more manipulated segments. Furthermore, Figure 2(a) shows almost no improvement over TempSamp-R1 for ActivityForensics segments shorter than three seconds, despite the emphasis on short-segment optimization. Could the authors reconcile these observations and clarify whether the gains mainly arise from improved segment coverage, boundary precision, or both?
-
The ablation studies and statistical validation require improvement. Table 2 removes multiple components simultaneously: removing the set-level reward also removes the count weight, while removing Anchor-Guided Advantage Pruning eliminates both the ground-truth anchor and advantage pruning. Consequently, the individual contributions of these mechanisms remain unclear. Could the authors provide separate ablations for anchor insertion, reward shaping, advantage pruning, set-level reward, and count balancing? The ablations should also be evaluated on DDL, where the segment characteristics differ substantially from ActivityForensics. In addition, the reported improvements are based on results without confidence intervals or repeated-run statistics. Reporting means and standard deviations across independent seeds would strengthen the conclusions.
-
The paper does not provide implementation code, substantially limiting reproducibility. ForgeLoc-R1 involves several implementation-sensitive components, including ground-truth anchor insertion, reward shaping, advantage selection, Sinkhorn-based matching, and count-balanced sampling. Important hyperparameters are also insufficiently specified, including the reward-shaping parameters in Eq. 5 and the GRPO optimization settings. Moreover, ForgeLoc-R1 generates seven sampled rollouts and retains four training responses per group, but the corresponding rollout counts and computational budgets of the baselines are not clearly reported. Please also provide the wall-clock training costs and clarify whether the comparisons use matched generated-rollout budgets rather than only matched optimizer settings.
-
The theoretical analysis and evaluation scope require stronger justification. The paper describes ForgeLoc-R1 as theoretically grounded, but several propositions rely on simplified assumptions, and the advantage-pruning rule is explicitly described as a heuristic that does not inherit the corresponding theoretical guarantee. Direct measurements of reward variance and the frequency of uninformative GRPO groups would better support the proposed mechanism. Furthermore, the evaluation considers only forged videos, and the prompt explicitly assumes that at least one manipulated segment exists, leaving false-positive behavior on authentic videos unexplored. Could the authors evaluate mixed authentic-forged test sets and report false-alarm rates? Generalization is also assessed using only one held-out generator, which is insufficient to establish robustness across diverse unseen manipulation methods.
-
Several methodological, presentation, and bibliographic details require correction. The timestamp-aware IoU from "Time-R1" is used without a corresponding reference. The Cuturi (2013) citation has an incorrect paper title (should be "Sinkhorn Distances: Lightspeed Computation of Optimal Transport"), and several entries retain outdated preprint information despite formal publication. Additionally, multiple mathematical symbols are reused for different quantities, including the reward-shaping and KL coefficients, which makes the derivations harder to follow. Figure 1 contains minor labeling errors ("Hig h"), the delta row of Table 1 mixes one decimal for ActivityForensics with two decimals for the DDL mIoU column, and the qualitative examples primarily highlight successful cases without showing representative failures.
[1] Yan, Jianhao, et al. "Learning to Reason under Off-Policy Guidance." NeurIPS. 2026.
[2] Xu, Yixuan Even, et al. "Not All Rollouts are Useful: Down-Sampling Rollouts in LLM Reinforcement Learning." TMLR. 2026.
[3] Gupta, Agrim, Piotr Dollar, and Ross Girshick. "LVIS: A Dataset for Large Vocabulary Instance Segmentation." CVPR. 2019.
[4] Park, Kyoungjun, et al. "VidGuard-R1: AI-Generated Video Detection and Explanation via Reasoning MLLMs and RL." ICLR. 2026.
[5] Xu, Zhipei, et al. "FakeShield: Explainable Image Forgery Detection and Localization via Multi-modal Large Language Models." ICLR. 2025.
[6] Liu, Bowei, et al. "VidForensics-M1: Meta-Detection Reinforcement Learning with Verifiable Temporal Grounding for AI-Generated Video Forensics." arXiv preprint arXiv:2608.11201. 2026.