Long-form video question answering (LVQA) requires answering natural-language queries about videos spanning minutes to hours, demanding temporal reasoning across thousands of frames. Standard vision-language models (VLMs) struggle with this task: their fixed frame budgets force aggressive downsampling that misses the temporal structure that complex queries depend on. Neuro-symbolic approaches address this by decomposing queries into atomic propositions, translating them into temporal logic specifications, and applying formal model checking to retrieve segments satisfying the specification. This yields up to 10% higher accuracy on temporally complex benchmarks, with interpretability and formal guarantees. However, constructing the video automaton requires grounding every proposition at every frame window via VLM calls, resulting in up to 130x slower inference than standard VLM prompting. We present RT-NeuS, a framework that preserves the accuracy and formal guarantees of temporal-logic-guided LVQA while closing this latency gap. RT-NeuS introduces coarse-to-fine adaptive sampling to identify the small set of query-relevant, visually distinct frames, and batched proposition detection with KV-cache reuse to evaluate all propositions per window in a single forward pass. We derive latency upper bounds as a function of video length, proposition count, and sampling density. Experiments on LongVideoBench, Video-MME, and MLVU reduce inference latency by up to 13x on a single NVIDIA H200 GPU, while matching or exceeding prior neuro-symbolic accuracy.
Figures & tables
Figure 1: (a) NeuS-QA (Baseline) densely grounds atomic propositions, constructs temporal logic specifications, and retrieves a single logic-consistent segment through formal model checking, but incurs high sequential latency. (b) RT-NeuS (Ours) introduces Coarse-to-Fine Adaptive Sampling and Batched Proposition Detection with KV-Cache Reuse to selectively ground propositions over semantically distinct keyframes. Multi-Segment FoI Retrieval extracts multiple disjoint logic-consistent segments for final VQA. Together, RT-NeuS achieves a 13× end-to-end speedup while improving accuracy on temporally complex queries and preserving formal guarantees.
Figure 2: [Adapted from our prior work Shah et al. (2026) ] Video automaton for the running example. Top : representative frames for key events. Bottom : finite-state automaton from φ . Green states satisfy temporal constraints; red states denote violations. Incremental verification ensures that only ρ⊨φ runs are retained, and reaching the accepting state yields a segment satisfying the query.
LongVideoBench
Framework
Model
T3E
E3E
T3O
O3O
Overall
Base VLM
InternVL2_5-8B ( Chen et al., 2024a )
58.90
71.28
50.00
54.55
59.61
VideoLLaMA3-7B ( Zhang et al., 2025a )
60.27
61.70
58.11
50.0
57.98
LLaVA-Video-7B-Qwen2 ( Zhang et al., 2025c )
46.58
55.32
55.41
39.39
49.84
Qwen2.5-VL-7B-Instruct ( Bai et al., 2025 )
46.58
63.83
56.78
53.03
55.70
Structured Reasoning Frameworks
VideoTree ( Wang et al. (2025) )
56.38
50.00
50.00
43.84
50.47
Table 1: Top-1 Accuracy (%) on 4 complex-reasoning subsets of LongVideoBench. We evaluate RT-NeuS against the NeuS-QA baseline and Base VLM inference across four state-of-the-art backbones. RT-NeuS consistently achieves superior performance, notably surpassing NeuS-QA by 5.21% on LongVideoBench.
Figure 3: Top-1 Accuracy (%) on Video-MME, and MLVU. We evaluate RT-NeuS against the NeuS-QA baseline and Base VLM inference for subsets of Video-MME and MLVU. RT-NeuS consistently achieves superior performance, surpassing Base-VLM and NeuS-QA across all question subsets.
Avg. Total Frames Used
Avg. FOI % of Video
Avg. Completion Time (s)
Video Length ( T )
NeuS-QA
RT-NeuS
NeuS-QA
RT-NeuS
NeuS-QA
RT-NeuS
Speedup
15 (Short)
44
59
87.80%
77.87%
14.4
8.09
1.78 ×
60 (Medium)
71
110
77.90%
62.72%
31.39
9.93
3.16 ×
600 (Medium-Long)
422
158
37.90%
19.83%
320.27
30.45
10.52 ×
3600 (Long)
1427
281
24.51%
9.01%
935.95
64.20
14.58 ×
Global Average
824
197
42.81%
27.35%
549.83
41.67
13.19 ×
Table 2: Latency Comparison between standard VLM vs. NeuS-QA vs. RT-NeuS assuming standard VLM uses 32 frames uniform sampling.
Method
Batching
Adaptive
Multi-Seg
Avg. Windows
Avg. VLM Calls
Accuracy
Latency (s)
Baseline (NeuS-QA)
-
-
-
268
1206
61.89
549.83
+ Batched Proposition Detection + KV cache
✓
-
-
268
268
61.19
151.56
+ Adaptive Sampling
✓
✓
-
56
56
60.18
43.53
RT-NeuS (Ours)
✓
✓
✓
56
56
67.10
41.67
Table 3: Ablation Study of RT-NeuS Components. We report the global average VLM window count and latency alongside QA accuracy. Each row adds one component cumulatively.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Video Length
α
ρ
αρ
Predicted
Observed
15 (Short)
0.957
0.425
0.407
∼9.8×
1.77×
60 (Medium)
0.664
0.473
0.275
∼14.5×
3.16×
600 (Medium-Long)
0.462
0.561
0.255
∼15.7×
10.52×
3600 (Long)
0.263
0.734
0.181
∼22.1×
14.58×
Global Average
0.449
0.681
0.194
∼20.6×
13.19 ×
Appendix
Table 4: Empirical retention rates and speedup comparison. Predicted speedup is (αρ)∣P∣ with mean ∣P∣=4 . Observed speedup is end-to-end from Table 2 . The predicted-observed gap narrows for longer videos, where automaton construction dominates total latency; on shorter videos, Lfixed widens the gap.
We introduce VSeek, an agentic framework that transforms long-video question answering (LVQA) from a passive, single-pass perception task into a multi-turn retrieval process. VSeek utilizes a natural language-driven search to identify relevant context within long videos and is post-trained with reinforcement learning (RL) to jointly formulate targeted search queries and reason over retrieved clips for LVQA. While RL post-training has revolutionized reasoning in symbolic domains such as mathematics and code, its application to long-video understanding remains hindered by a lack of verified rewards. To ensure that the retrieved context is relevant, we propose a novel neuro-symbolic approach that bridges open-ended natural language with discrete visual verification. Specifically, complex user queries are compiled into formal temporal logic specifications for systematically decomposing natural language questions into a definitive checklist of required atomic visual primitives, such as key objects and activities, along with their temporal ordering. These systematically derived grounding events provide the critical feedback signal for RL post-training, enabling dense, verifiable rewards based on the successful retrieval of these specific visual elements rather than relying entirely on outcome-only answer accuracy. By explicitly optimizing for this verifiable evidence-seeking behavior, VSeek improves Pass@1 scores by up to 8% and Pass@4 scores by 15% on long-video understanding benchmarks compared to base models. We open-source our code at https://utaustin-swarmlab.github.io/VSeek.
Harsh Goel, S P Sharan, Sahil Shah +4
The University of Texas at Austin, Austin, TX, USA
Long Video Question Answering (LVQA) requires identifying sparse, query-relevant evidence within hours-long untrimmed videos. Existing approaches either process videos densely with large vision-language models (VLMs), incurring prohibitive computational cost, or rely on sparse caption-based reasoning, which often misses temporally localized and motion-centric evidence. We introduce TimeProVe, a cost-efficient hybrid framework for temporally grounded reasoning in long videos. TimeProVe first employs lightweight modules to generate action-grounded answer--evidence hypotheses and subsequently invokes an expensive VLM only for targeted verification. The core of our framework lies in the Action-based Candidate Evidence (ACE) module, which converts temporally localized actions into query-conditioned candidate answers and supporting evidence windows through lightweight LLM reasoning. We further introduce OpenTSUBench (OTB), an open-ended benchmark designed to evaluate temporally grounded reasoning in real-world Activities of Daily Living (ADL) scenarios. Experiments show that TimeProVe outperforms the strongest baseline on OTB by 7.3%, while reducing VLM calls by 75% and inference cost by 93%. Furthermore, without explicit temporal grounding training, TimeProVe achieves competitive performance on Charades-STA, and reaches state-of-the-art results when enhanced with grounding VLMs.
Vision-language models (VLMs) can ingest only a limited number of video frames, making frame selection a practical necessity. But do current Video QA benchmarks genuinely require temporal frame selection, or can most questions be answered regardless of which frames are shown? We introduce Frame Selection Sensitivity (FSS), a per-sample diagnostic that measures how much VLM accuracy changes when the most relevant frames are replaced with the least relevant ones. Across six benchmarks and eight VLMs, we find that a large majority of samples are frame-agnostic: only a minority are genuinely sensitive to frame choice. Combining FSS with a Language Independence Score (LIS) reveals that merely 5.5--31% of samples are Temporally Sensitive. We construct TempCore, compact evaluation subsets that isolate these temporal samples from existing benchmarks, and will release code and per-sample annotations upon publication.