TimeProVe: A 'Detective' for Finding the Right Second in Hours of Video
> *"Time is a river, and we are the people standing on the bank looking for one particular ripple."*
The Problem: Long Video QA in Daily Life
The post opens with a real-world scenario: a security guard must search dozens of hours of apartment surveillance footage to find the few seconds when a thief entered a room. This is a concrete instance of Long Video Question Answering (LVQA). In Activities of Daily Living (ADL) videos, evidence is sparse: a question like "who used the oven last night?" may concern only 0.3% of an 8-hour recording.
Existing approaches sit at two extremes:
- Dense processing (the "elephant"): feeding the entire multi-hour video to a large vision-language model (VLM). Accurate but prohibitively expensive for real deployment.
- Sparse caption-based reasoning (the "ants"): lightweight caption models scan the video and produce sparse descriptions, which are then used for reasoning. Fast, but captions "often miss temporally localized and motion-centric evidence" — who did it, when, and how.
- Medical monitoring: locating symptom onset in ICU footage without reviewing hours of video
- Industrial safety: flagging safety-violation windows in factory surveillance
- Elder care: extracting medication-related segments from a full day of home monitoring
The TimeProVe Approach: Propose, then Verify
TimeProVe (2026, University of Central Florida: Arkaprava Sinha, Dominick Reilly, Siddharth Krishnan) follows a Sherlock-Holmes-style philosophy:
1. Propose: lightweight modules quickly generate answer-evidence hypotheses. 2. Verify: the expensive VLM is invoked only on specific temporal windows to confirm or refute each hypothesis.
ACE: Action-based Candidate Evidence
The core module, ACE, works in four steps (illustrated with a "who broke the vase" example):
1. Action detection — a lightweight model scans the video and detects action events (e.g., "Person A picked up the vase at 2:47"). 2. Query conditioning — the question is converted into query conditions (keywords, relevant actions, time windows). 3. Candidate generation — ACE outputs candidate answers with supporting evidence windows and confidence levels. 4. VLM verification — the VLM examines only the narrow evidence window (e.g., 2:45–2:50) to produce the final grounded answer.
Results
A new benchmark, OpenTSUBench (OTB), evaluates temporally localized reasoning in ADL scenarios:
| Metric | Result vs. strongest baseline | |---|---| | Accuracy | +7.3% | | VLM invocations | -75% | | Inference cost | -93% |
TimeProVe also achieves competitive zero-shot temporal grounding on Charades-STA without explicit localization training — the propose/verify pipeline is itself a general temporal localization mechanism. With an added Grounding VLM, it reaches state-of-the-art on related tasks.
Why 'Propose, then Verify' Works
The post connects the architecture to Kahneman's two systems of cognition (from *Thinking, Fast and Slow*): ACE acts as fast, low-cost System 1; the VLM verification stage acts as deliberate, high-cost System 2. The deeper contribution is bridging sparse and dense methods — sparse modules do first-pass filtering; dense VLM analysis does fine-grained inspection.
Future Applications
References
[1] Sinha, A., Reilly, D., & Krishnan, S. (2026). *TimeProVe: Propose, then Verify for Efficient Long Video Temporal Reasoning in Activities of Daily Living*. arXiv preprint. https://arxiv.org/abs/2606.XXXXX
[2] Gao, J., et al. (2018). CTAP: Complementary temporal action proposal. *AAAI*.
[3] Zhang, H., et al. (2020). Span-based localizing network for natural language video localization. *CVPR*.
[4] Mun, J., et al. (2020). Local-Global Context-Aware Transformer for Language-Guided Video Segmentation. *arXiv*.
[5] Kahneman, D. (2011). *Thinking, Fast and Slow*. Farrar, Straus and Giroux.
*Auto-collected 2026-06-22*