- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how to select the look-back window for streaming video question answering. Through experiments on three benchmarks, the authors show that different question types favor substantially different temporal spans, making a single fixed window unsuitable for mixed queries. They propose Q-SPAN, a method that requires no additional training and uses the same frozen vision-language model for planning, evidence checking, and answering. A planner receives only the question text and selects among three sampling policies: the last 4 seconds, the last 32 seconds, or up to 128 frames sampled uniformly across the observed video prefix. For questions assigned to the shortest window, a visual probe checks whether the sampled frames contain sufficient evidence and expands the window to 32 seconds if needed. Experiments across three backbones show improved accuracy over fixed sampling policies, with the clearest gains on benchmarks containing a mixture of current-view and historical questions. The advantage over the best fixed window becomes small when one temporal regime dominates
Critical strengths
The paper systematically examines the relationship between look-back span and accuracy across multiple benchmarks and question subsets. The results show that aggregate performance can conceal opposing temporal requirements across question types.
Critical weaknesses
-
A local probe may mistake relevant evidence for sufficient evidence, particularly for questions such as “Is this the first time?” that require checking earlier occurrences. The paper does not provide an ablation by question type showing where the probe helps, provides no gain, or harms accuracy, leaving its reliability across these cases unclear.
-
The improvement over the best fixed window is clearest on OVO-S-Bench, while the corresponding gains on OVO-Bench and StreamingBench’s real-time subset are small or negligible in several settings.
-
Missing random frame-sampling baselines. The paper compares against shuffled window assignments, but does not evaluate randomly sampling a matched number of frames from the full prefix or a recent temporal window. These inexpensive baselines would help establish whether the proposed routing offers an advantage over simpler sampling strategies.
Questions for authors
See above