- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
Robust-TO studies robust video reasoning under visual corruptions, including motion blur, noise, glare, occlusion, and low light. It is a tool-augmented framework that selects video frames based on visual reliability and query relevance. A host VLM decomposes the original question into atomic sub-queries and routes them to specialized perception tools according to the estimated corruption profile. Tool outputs are assigned confidence scores based on intrinsic tool confidence and input-frame reliability, followed by a three-tier evidence synthesis process. The host VLM is trained with GRPO using rewards for answer correctness, confidence-cost trade-offs, sub-query efficiency, and output formatting. Experiments on UrbanVideo-Bench and VSI-Bench report 56.4% average accuracy on clean videos and 54.3% accuracy on corrupted UrbanVideo-Bench.
Critical strengths
-
Practical motivation. Robust-TO addresses a meaningful problem, as motion blur, glare, occlusion, and low-light conditions are common in real-world video capture. Explicitly considering evidence reliability is valuable for robust video reasoning.
-
Unified confidence-aware framework. Robust-TO integrates frame quality assessment, adaptive tool routing, and confidence-aware evidence aggregation.
Critical weaknesses
- Unclear backbone. The main experiments rely on Qwen3-VL-7B-Instruct, but this model does not exist.(Maybe 4B or 8B?)
- Limited realism and generalization of robustness evaluation. The evaluation relies on synthetic corruptions applied to randomly selected frames, which may not reflect real-world degradation patterns. Experiments on naturally degraded videos and broader video understanding benchmarks (e.g., Video-MME and Video-MME-v2) are missing.
- Insufficient isolation of learned tool-routing contributions. Although several ablations are provided, they do not clearly distinguish the effects of predefined corruption-specific routing rules from those of GRPO learning. This makes the contribution of learned corruption-aware tool orchestration unclear.
- Inconsistent experimental tables. Several ablation results conflict with the main experiments. For example, Table 21 reports 54.3% corrupted accuracy for the Qwen2.5-VL-7B variant, while Table 2 reports 47.1% for the same model.
- Inconsistent efficiency claims. Appendix A claims less than 5% inference overhead on clean videos, but Table 14 reports 2,308 ms for Robust-TO versus 1,826 ms for the base VLM, corresponding to approximately 26.4% additional latency. The authors should clarify the measurement settings and overhead definition.
- Potential loss of critical temporal evidence. The reliability-based frame selector may discard degraded frames that contain essential events. The paper does not evaluate whether the method preserves critical evidence when no clean alternative frames are available.
Questions for authors
-
Why are only four tasks selected from each benchmark, and what criteria determine this selection? Can the authors report full-benchmark results on clean and corrupted videos?
-
Other questions: see weaknesses.
12 comments
response for Reviewer oQYu (2/6)
W3 : “Insufficient isolation of learned tool-routing contributions. Although several ablations are provided, they do not clearly distinguish the effects of predefined corruption-specific routing rules from those of GRPO learning. This makes the contribution of learned corruption-aware tool orchestration unclear.”
A : Thanks for the helpful comment. We agree that the current ablations don’t yet cleanly separate the effect of predefined corruption-specific routing rules from that of GRPO learning. To address this directly, we’ve added Table R2 and a definition of the agreement rate to the revision. We compare four variants on held-out corrupted UV-Bench with Qwen3-VL-8B: (a) hard-coded rules, (b) prompt-only routing without GRPO, (c) GRPO training without the routing guidelines in the prompt, i.e., the model must learn corruption-aware routing purely from the GRPO reward rather than being guided by the hand-written blur/occlusion/brightness preferences in Sec. 3.3 and Prompt F.2, and (d) full Robust-TO. We also report a learned-vs-rule agreement rate: for each sub-query, we check whether the full model selects the same tool as the hard-coded rule prescribes, and then average this over all sub-queries.
Design of (a) Hard coded rules. The hard coded baseline is a deterministic lookup table built from the two stage routing protocol in Sec. 3.3 and Prompt F.2. It is not free form prompting, and it is not a learned policy. It takes two inputs: (i) the subquery semantic type (spatial, temporal, attribute, action, text) and (ii) the dominant corruption from the averaged disturbance profile over selected frames. Stage 1 maps the type to a candidate tool set (e.g., spatial to detect_objects or caption_frame; temporal to track_temporal, recognize_action, or caption_frame; text to read_text or caption_frame; action to recognize_action or caption_frame; attribute to detect_objects or caption_frame). Stage 2 applies fixed corruption preferences: under blur, prefer caption_frame over tools that depend on boundaries, such as detect_objects and read_text; under occlusion, prefer recognize_action over track_temporal; under brightness distortion, prefer tools that are robust to illumination; under clean input, use the default tool for that semantic type. Ties go to the lower cost tool in Tab. 8. These rules are fixed before training, are not updated by GRPO, and do not use frame level learned representations. Full Robust-TO instead selects tools via in context reasoning over the disturbance profile and is trained end to end with GRPO. So (a) is a true predefined rule baseline, distinct from the fixed tool and query only baselines in Fig. 4.
Table R2: Routing ablation on held-out corrupted UV-Bench with Qwen3-VL-8B, evaluated at inference after training. All variants use the same selected frames, tool library, and evaluation protocol; only the routing policy differs. Agreement is the percentage of sub-queries on which a variant selects the same tool as the hard-coded rule in (a).
| Routing variant | Corrupted Acc. (%) | Avg. tool calls | Latency (ms) | Agreement with (a) (%) |
|---|---|---|---|---|
| (a) Hard-coded rules | 48.7 | 7.10 | 2,441 | 100.0 |
| (b) Prompt-only, no GRPO | 49.9 | 6.80 | 2,398 | 74.2 |
| (c) GRPO, guidelines removed | 51.6 | 6.50 | 2,352 | 63.8 |
| (d) Full Robust-TO | 54.3 | 6.22 | 2,308 | 58.9 |
response for Reviewer oQYu (3/6)
Table R2 separates rule-based from learned routing. The hard-coded baseline reaches 48.7%, while full Robust-TO reaches 54.3% (+5.6 points) even though it agrees with the hard-coded rule on only 58.9% of sub-queries. This gap shows that full Robust-TO does not merely reproduce the predefined rules; GRPO training leads it to a substantially different, non-trivial routing policy. Prompt-only without GRPO reaches 49.9%, and GRPO without the guidelines reaches 51.6%, both below full Robust-TO. This pattern indicates that GRPO contributes beyond both hard-coded rules and prompt-level guidance (+1.7 over prompt-only), while the guidelines add a further +2.7 points on top of GRPO (51.6 to 54.3). Full Robust-TO also uses fewer tool calls (6.22 vs. 7.10) and lower latency (2,308 vs. 2,441 ms) than the hard-coded baseline.
The agreement trend is also informative: agreement decreases monotonically from (a) 100.0 to (b) 74.2, (c) 63.8, and (d) 58.9. This ordering is consistent with increasing policy specialization. The hard-coded rule is a deterministic lookup table by construction, so (a) agrees with itself by definition. Prompt-only routing follows the guidelines but lacks reward-driven adaptation. GRPO without guidelines falls back to simpler semantic-type defaults, which happen to align more often with Stage 1 of the lookup table. Full Robust-TO, trained end-to-end with both guidelines and reward, deviates most from the deterministic table, yet achieves the highest accuracy and lowest cost. This makes the agreement rate a measure of policy divergence from the predefined rule, not a measure of correctness.
These results complement Fig. 4, which compares fixed, query-only, and confidence-guided routing, and Tab. 31, which summarizes learned preferences: Table R2 directly quantifies rule-vs-learning agreement, accuracy, and cost. We include the table and the agreement-rate definition in the revised Sec. 4.3 and Appendix D.8.
The full model agrees with the hard-coded rule on 58.9% of sub-query routing decisions, indicating that the learned policy does not simply reproduce the predefined rule. More directly, GRPO (d) improves corrupted accuracy from 49.9% for prompt-only routing (b) to 54.3% for the full model, a gain of 4.4 percentage points. Compared with hard-coded routing (a), the full model (d) improves accuracy by 5.6 points while reducing average tool calls from 7.10 to 6.22. Its 58.9% agreement with the hard-coded rule further shows that the learned policy does not simply reproduce that rule. Together, these results support the additional benefit of GRPO-trained routing under the evaluated corruption conditions.
response for Reviewer oQYu (1/6)
A : We sincerely thank you for catching this naming error. We confirm that the backbone used in our experiments is Qwen3-VL-8B-Instruct, not the non-existent Qwen3-VL-7B-Instruct. This is a model-naming error rather than an issue with the backbone used in our experiments. In the revision, we have corrected all references to the backbone.
A: Thank you again for highlighting two distinct questions: generalization beyond our primary benchmarks, and robustness to naturally occurring degradation.
For broader benchmark generalization, we have additionally evaluated Robust-TO on Video-MME and Video-MME-v2 using Qwen3-VL-8B. Under the same Corruption protocol, averaged over five corruption masks at medium severity, Robust-TO improves performance from 58.2 to 62.8 on Video-MME and from 41.5 to 45.2 on Video-MME-v2. Clean performance also improves from 68.4 to 69.6 and from 49.3 to 50.4, respectively. These results extend the evaluation beyond UrbanVideo-Bench and VSI-Bench and support generalization across video content and tasks under the evaluated corruption protocol.
Table R1: Video-MME and Video-MME-v2 generalization (Qwen3-VL-8B).
Existing external-benchmark evaluation. We agree that evaluating robustness under naturally degraded videos is important. We believe that collecting and constructing a large-scale benchmark with naturally occurring degradations would itself constitute a valuable and independent research direction, beyond the scope of this work.
Nevertheless, to assess the broader generalizability of our method beyond the our current corruption protocol, we have additionally evaluated Robust-TO on MVTamperBench, as already reported in Appendix D.1 and Table 11. While MVTamperBench uses an externally defined synthetic tampering protocol rather than naturally occurring degradations, it provides a complementary evaluation under a different corruption setting. Robust-TO achieves an F1 of 0.322 compared to 0.351 for the base VLM, suggesting that its robustness gains do not necessarily transfer to all types of video perturbations.