---
title: 'Video Streaming Thinking: Online Reasoning'
url: https://www.emergentmind.com/topics/video-streaming-thinking-vst
type: topic
---

# Video Streaming Thinking: Online Reasoning

Video Streaming Thinking (VST) denotes a causal, incremental regime of video understanding in which a model observes a stream over time, updates usable internal state as new frames or segments arrive, and answers under bounded memory, compute, and latency constraints rather than after seeing a complete prerecorded clip. Across recent work, VST is characterized by strict no-future access, persistent state maintenance, asynchronous question arrival, and online response timing; in this sense it is closely aligned with “streaming video reasoning,” “streaming online question answering,” and “Watch–Think–Speak” style formulations that replace retrospective clip-level inference with continuous reasoning over partial evidence [2603.21493][2603.12938].

## 1. Historical emergence and scope

Early video-LLM work on streaming established the basic departure from offline clip reasoning. "VideoLLM-online: Online Video Large Language Model for Streaming Video" introduced the LIVE framework for temporally aligned, long-context, and real-time conversation within a continuous video stream, together with Streaming EOS prediction so the model can learn when to stay silent rather than decoding a response at every frame; on average, it supports streaming dialogue in a 5-minute video clip at over 10 FPS on an A100 GPU [2406.11816]. "Flash-VStream: Memory-Based Real-Time Understanding for Long Video Streams" then made online video QA explicitly memory-centric by splitting execution into a frame handler and a question handler connected through STAR memory, with a fixed total memory size of 681 tokens and reported real-time answering within 1 second upon user query [2406.08085]. In parallel, "Streaming Long Video Understanding with Large Language Models" proposed Memory-Propagated Streaming Encoding and Adaptive Memory Selection, arguing that long-video understanding can be made compatible with a constant downstream visual-token budget by recurrently compressing history and retrieving only question-related memories [2405.16009].

Later work expanded the scope of VST from online dialogue to explicit reasoning control. "StreamMind: Unlocking Full Frame Rate Streaming Video Dialogue through Event-Gated Cognition" reframed the problem as continuous perception with sparse, event-triggered LLM invocation, reporting ultra-FPS streaming video processing at 100 FPS on a single A100 [2503.06220]. "Thinking in Streaming Video" made incremental reasoning itself explicit by generating short `<think>` traces at every step and reusing them as memory [2603.12938]. "An Efficient Streaming Video Understanding Framework with Agentic Control" treated streaming understanding as a cascaded control problem over remembering, responding, and escalating to stronger reasoning models [2605.17921]. "What Should a Streaming Video Model Remember?" sharpened the central question from raw retention to selective evidence allocation under fixed budgets [2606.16353]. This suggests that VST has evolved from simple online inference toward a joint study of causal memory, answer timing, retrieval, and adaptive compute.

## 2. Formal models of causal streaming inference

A canonical formalization appears in "StreamingEval: A Unified Evaluation Protocol towards Realistic Streaming Video Understanding" [2603.21493]. In its streaming online question answering setting, at time \(t\) the model may access prior dialogue context \(C_t\), the newly arrived video frame \(V_t\), and a user query \(Q_t\), but when a query arrives it may condition only on frames that have already arrived and have already been encoded. When the encoded query finishes at time \(t_1\), the response is generated by maximizing
\[
p\!\left(R_{t_1}\mid C_{t_1}, V_{[0,t_1]}, Q_{t_1}\right).
\]
To make this operational, StreamingEval implements an asynchronous, time-causal pipeline with three decoupled processes: a Frame Player emitting \(\{(v_i,\tau_i)\}_{i=1}^{\infty}\), an Encoder-and-Memory Updater computing
\[
z_i = g_\theta(v_i), \qquad
M_{\tau_i^+} = \mathcal{U}\!\left(M_{\tau_i^-}, z_i;\, B, \pi\right),
\]
and a Responder that answers queries from the memory snapshot available when query encoding completes,
\[
R_{t_1} \sim p_\phi(\cdot \mid q_{t_0}, C_{t_1}, M_{t_1}).
\]
The key distinction from offline video understanding is that there is no future access, no full-video buffering for later recomputation, and no hidden offline pass.

ThinkStream turns this causal setup into an explicit online reasoning loop [2603.12938]. The stream is \(\mathcal{V}=\{v_1,v_2,\dots\}\), and at each step the model outputs
\[
\langle think \rangle ~ r_t ~ \langle/think\rangle \; a_t,
\]
with
\[
a_t \in \big\{ \langle \text{silent} \rangle,\; \langle \text{response} \rangle \oplus c_t \big\}.
\]
The generation process is
\[
p(r_t, a_t \mid \mathcal{H}_{t-1}, v_t, \mathcal{I})
= \prod_{i=1}^{|r_t \oplus a_t|}
\pi_\theta \big(y_i \mid y_{<i}, \mathcal{H}_{t-1}, v_t, \mathcal{I}\big),
\]
so perception, incremental reasoning, and response timing are unified in one autoregressive policy. "Think While Watching: Online Streaming Segment-Level Memory for Multi-Turn Video Reasoning in Multimodal Large Language Models" extends this logic to multi-turn segment streams \(\mathbf{S}_{1:T}\) and dialogue history \(\mathcal{H}_{r-1}\), enforcing strict online causality with a segment-level streaming causal mask and streaming positional encoding so that answers at turn \(r\) depend only on \(\mathbf{S}_{1:\tau_r}\), \(q_r\), and prior turns [2603.11896].

## 3. Memory as the substrate of streaming thought

VST research converges on the idea that memory is not an auxiliary module but the primary substrate of online reasoning. One line of work retains multiple granularities of visual evidence. Flash-VStream’s STAR memory contains a feature buffer, spatial memory, temporal memory, abstract memory, and retrieved memory, with total capacity
\[
\text{MAXSIZE}=(N_{\text{spa}}+N_{\text{ret}})P_{\text{spa}}^2 + N_{\text{tem}}P_{\text{tem}}^2 + N_{\text{abs}}P_{\text{abs}}^2,
\]
and the reported implementation fixes this at 681 tokens [2406.08085]. Temporal memory is updated by weighted K-means, abstract memory by semantic attention, and retrieved memory by nearest-neighbor recovery from the buffer. VideoStreaming adopts a related but recurrent formulation: for clip \(k\), the streaming encoder updates memory by
\[
\bm{H}_k,\hat{\bm{H}}_k = g([\bm{H}_{k-1}\circ\bm{F}_k\circ\bm{S}_k\circ\hat{\bm{S}}_k]),
\]
then performs question-conditioned top-\(V\) memory selection so the downstream LLM sees a constant visual token budget, 256 tokens in the default setting [2405.16009].

A second line compresses history into structured semantic units. Vista performs scene-aware segmentation, scene-aware compression, and scene-aware recall for post-hoc streaming QA [2602.08448]. Completed scenes are compressed into one GPU-resident scene token
\[
T \leftarrow \frac{1}{H \times W}\sum_{s=1,t=1}^{H,W} S_{\text{fused}^{(s,t)}},
\]
while full-resolution frames are offloaded to CPU memory or disk; when a query \(Q\) arrives, the model computes \(\mathbf{q}=\psi(Q)\), scores scenes by
\[
\alpha_i = \mathbf{q}T_i^\top,
\]
retrieves top-\(k\) scenes, and reconstructs the final visual evidence
\[
\mathcal{V}_{\text{final}} = \left(\bigcup_{j \in \mathcal{I}_k} \mathcal{F}_j \right) \cup \mathcal{L}.
\]
Event-VStream shifts the storage unit from scenes to events: it detects boundaries from semantic drift, motion intensity, and predictive error, then stores a persistent event memory bank
\[
\mathcal{M}=\{E_1,\dots,E_k\},
\]
with merge-or-append consolidation
\[
E_{\text{last}} \leftarrow
\begin{cases}
(1-\lambda)\,E_{\text{last}} + \lambda\,E_k, & \text{if } \cos(E_k, E_{\text{last}}) > \gamma_{\text{mem}},\\
E_k, & \text{otherwise.}
\end{cases}
\]
Language generation is triggered only at event boundaries, not at fixed intervals [2601.15655]. Think While Watching similarly writes one memory note \(m_t\) per segment and preserves a persistent segment-level bank \(\mathcal{M}_t=\{\langle i,m_i\rangle\}_{i=1}^t\), directly targeting multi-turn consistency [2603.11896].

A third line treats reasoning itself as memory. ThinkStream’s Reasoning-Compressed Streaming Memory retains only a recent visual KV window and all prior reasoning/action tokens:
\[
\mathcal{M}_t = \text{Concat}\Big(
\{KV(v_\tau)\}_{\tau=\max(1,t-W+1)}^{t},
\{KV(r_\tau \oplus a_\tau)\}_{\tau=1}^{t}
\Big).
\]
Old dense visual tokens are evicted, but their semantic content survives as textual reasoning traces [2603.12938]. SelectStream pushes this further into latent evidence allocation. Its memory state is a fixed-capacity latent graph
\[
G_t=(\mathcal{M}_t,E_t),
\]
with explicit budgets for active nodes \(N\), retrieved subgraph size \(B\), and injected evidence tokens \(M\). Surprise-driven adaptive windowing decides when to write, priority-preserving consolidation decides what to preserve, and query-conditioned graph reasoning decides what to expose to the frozen VLM [2606.16353]. This suggests a broad shift from raw-token retention toward structured episodic, semantic, or latent evidence memories that are query-ready without replaying the full stream.

## 4. Response timing, adaptive computation, and concurrent watching

VST requires deciding not only what to remember, but when to think, when to answer, and how much compute to spend. StreamMind isolates this problem as event-gated cognition [2503.06220]. Continuous perception runs on every frame through the Event-Preserving Feature Extractor (EPFE),
\[
\mathbf{h}_{t+1} = \mathbf{A}\mathbf{h}_t + \mathbf{B}\mathbf{x}_t, \qquad
\mathbf{y}_t = \mathbf{C}\mathbf{h}_t,
\]
while a Cognition Gate receives the prompt and current perception token and outputs either `</response>` or `</silence>`. The paper’s core systems claim is that prior per-step LLM invocation yields \(O(n^3)\) total cost over \(n\) frames, whereas event-gated invocation reserves heavyweight reasoning for query-relevant moments and reaches 100 FPS on a single A100.

R3-Streaming formulates this control problem explicitly [2605.17921]. At each step it maintains memory \(M_t\), receives query \(q_t\), and chooses from
\[
A=\{\langle \mathrm{Answer}\rangle,\ \langle \mathrm{Escalate}\rangle,\ \langle \mathrm{Routine}\rangle\}.
\]
Its Remember stage applies age-aware dual-zone compression,
\[
M_t=
\mathrm{Compress}(x_{t-W+1:t}, \tau_{\mathrm{near}})
\cup
\mathrm{Compress}(x_{1:t-W}, \tau_{\mathrm{hist}}),
\]
preserving recent context while aggressively compressing history. The Respond stage estimates readiness \(p_{\mathrm{ready}}=h(q_t,M_t)\) and emits \(\langle \mathrm{Routine}\rangle\) if \(p_{\mathrm{ready}}<0.5\). The Reason stage routes between a fast model and a stronger slow model using TB-GRPO, which stabilizes escalation around a target band and prevents mode collapse to always-escalate behavior. Reported results reach 57.92 on OVO-Bench and 76.36 on StreamingBench while reducing visual token usage by 95 to 96 percent.

Think While Watching addresses a different bottleneck: serialized watching and answering [2603.11896]. It introduces a dual-KV-cache pipeline that overlaps source ingestion and autoregressive generation, together with a segment-level streaming causal mask
\[
M^{\mathrm{seg}}[A,B]=
\begin{cases}
\mathbb{I}[v\le u], & A=R_u,\ B=R_v,\\
\mathbb{I}[v\le u], & A=C_u,\ B=R_v,\\
\mathbb{I}[k\le u], & A=C_u,\ B=C_k,\\
0, & \text{otherwise,}
\end{cases}
\]
and decoupled positional offsets for received units and generated units. In the multi-round setting it maintains accuracy while reducing output tokens by 56 percent on StreamingBench. Across these systems, VST increasingly treats response timing and compute allocation as first-class online decisions rather than byproducts of a fixed decoding schedule.

## 5. Evaluation protocols and empirical trade-offs

StreamingEval provides the most explicit benchmark definition of realistic VST [2603.21493]. It normalizes historical visual context with a fixed-capacity, byte-budgeted memory bank, feeds frames at 1 FPS, allows queries at arbitrary times, and jointly measures four aspects of deployability: question-answering accuracy, visual encoding efficiency via MaxFPS, text decoding latency via TTFT, and memory cost. These are summarized by
\[
\mathrm{StreamingScore}(\mathbf{w})=
\frac{\mathrm{MaxFPS}^{w_f}\cdot \mathrm{Acc}^{w_a}}
{\mathrm{TTFT}^{w_t}\cdot M^{w_r}},
\qquad
M \triangleq \mathrm{Mem}\cdot \ln(\mathrm{Params}),
\]
with equal weights in the main leaderboard. The protocol matters because it avoids the common offline surrogate in which a video is truncated at a query timestamp and then processed as a full clip.

Its empirical findings are central to the encyclopedia of VST. On OVO-Bench, the best offline-adapted model in overall accuracy is Qwen3-VL-8B at 58.00, whereas the best online model is StreamForest-7B at 55.57; on StreamingBench, InternVL3.5-8B reaches 77.96, Qwen3-VL-8B 77.31, and StreamForest-7B 77.26. Efficiency does not align monotonically with “online” status: many models exceed 1 FPS, but VideoChatOnline-4B reaches only 0.14 FPS, while TTFT stays under 1.5 s for most models. The composite StreamingScore further shows that a low-accuracy model can dominate under severe resource weighting: on OVO-Bench, Flash-VStream-7B attains StreamingScore 2.34 despite 33.15 accuracy, largely because its TTFT is 0.12 s and memory use is 0.35 GB, whereas Qwen3-VL-8B reaches 2.21 with much higher accuracy but slightly higher resource cost. Task-cluster analysis reinforces a characteristic VST trade-off: offline or memory-richer systems are stronger on Backward Tracing, while some native online systems are more competitive on Forward Active Responding. Memory-budget ablations show near-saturation in the 1.0–1.5 GB regime, clear degradation below 1.0 GB, and convergence under the severe 0.1 GB budget.

Newer systems report stronger benchmark numbers under their own protocols, but they do so through different memory and control strategies. ThinkStream-3B reports 59.66 on OVO-Bench and 75.00 on StreamingBench Real-Time by turning reasoning traces into memory [2603.12938]. SelectStream-Qwen3-VL-8B reaches 67.03 on OVO-Bench and 82.67 on StreamingBench through selective latent evidence retrieval [2606.16353]. R3-Streaming-7B|4B-Thinking reaches 57.92 and 76.36 with age-aware forgetting and adaptive escalation [2605.17921]. Think While Watching reports single-round gains of 2.6% on StreamingBench and 3.79% on OVO-Bench, together with large multi-round token reductions [2603.11896]. Taken together, these results indicate that VST performance depends less on a simple offline-versus-online dichotomy than on how memory quality, retrieval selectivity, throughput, and answer timing are co-designed.

## 6. Misconceptions, limitations, and research directions

A recurrent misconception is that native online architectures necessarily dominate offline ones in realistic streaming deployments. StreamingEval shows the opposite can happen: mainstream offline Video-LLMs, retrofitted with a bounded-memory adapter, often achieve better task accuracy under the same causal protocol, though usually at greater resource usage [2603.21493]. A second misconception is that more history is always better. SelectStream argues that indiscriminate history injection can dilute current-scene perception, and its evidence-budgeted retrieval is built precisely to avoid that failure mode [2606.16353]. R3-Streaming reports that over-retaining stale evidence can hurt both accuracy and efficiency, and that preserving a small high-fidelity recent window while compressing history aggressively is often preferable [2605.17921].

Another limitation is that current memory abstractions are still coarse. Vista stores one compact scene token per completed scene and performs one-shot top-\(k\) recall, but the paper notes that retrieval is one-shot, scene tokens are coarse, and complex cross-scene reasoning or subtle transitions can remain difficult [2602.08448]. ThinkStream bounds dense visual memory but not total reasoning-token growth; its RLVR stage is also limited to verifiable formats such as multiple-choice, yes/no, and counting [2603.12938]. R3-Streaming explicitly states that TB-GRPO controls average escalation ratio but does not solve worst-case latency spikes during prolonged high-information-density intervals [2605.17921]. StreamingEval itself is limited mainly to open-source 7B–8B models and warns against over-generalizing a single benchmark into a universal deployment standard [2603.21493].

VST is also a systems problem below the reasoning layer. CoStream shows that continuous video analytics can be made substantially cheaper by exploiting codec metadata already exposed by compression, applying codec-guided patch pruning before ViT encoding and selective KV-cache refresh during LLM prefilling; it reports up to \(3\times\) throughput improvement and 0–8% F1 drop at its default operating point [2604.06036]. The paper is explicit that this does not improve the underlying reasoning capability of the VLM, but it does make continuous multimodal inference far more affordable. This suggests that practical VST will depend on joint progress in causal memory design, retrieval, concurrency, and serving infrastructure.

The dominant research directions follow directly from these limitations. StreamingEval advocates streaming, incrementally updatable representations and latency–accuracy controllable computation allocation [2603.21493]. Vista implies richer scene memory and stronger online boundary detection [2602.08448]. R3-Streaming points toward relevance-aware forgetting beyond age-only zoning, stronger readiness calibration, and spike-aware compute control [2605.17921]. ThinkStream suggests further work on long-horizon memory mechanisms that keep semantic traces useful without unbounded growth [2603.12938]. In aggregate, these directions define VST less as a single architecture than as a research program centered on causality, persistent memory, selective recall, adaptive reasoning depth, and realistic resource-bounded deployment.

Source: https://www.emergentmind.com/topics/video-streaming-thinking-vst