Survey

Series guide. This article is the bounded-memory thematic survey. Start with the development-history hub for the six-path map, read the ReKV note for the exact-archive baseline, and use the pipeline survey for the stage-by-stage architecture. A streaming Video-LMM has to make decisions before it knows which detail a future user will care about. ReKV avoids write-time eviction or compression by storing every generated visual KV block, then retrieves a small subset after the question is known. This does not recover unsampled pixels or information absent from those model states. Fixed-state methods make the opposite trade: they evict, merge, or summarize history during the stream so that memory no longer grows with video duration. ...

Series guide. This is the development-history hub for my streaming Video-LMM notes. For a stage-by-stage systems view, see the pipeline survey. For dataset and protocol details, see the benchmark index. The complete reading map is at the end of this article. Calling a model streaming no longer identifies one technical problem. One paper may process a causal video prefix but retain every historical KV block. Another may keep a fixed cache but permanently forget old evidence. A proactive assistant may know the user’s request before the stream begins, while a delayed question-answering system must decide what to preserve before any question is known. A benchmark may measure the age of remembered evidence without measuring whether the implementation can keep up with a live camera. ...

Series guide. This article is the evaluation-protocol index. Start with the development-history hub for the six research paths, and use the pipeline survey for the stage-by-stage architecture view. This post is a small index for the benchmarks that appear repeatedly in recent streaming video / long-video VLM papers. The main split is simple: online streaming benchmarks test whether the model can answer while the video is still coming in; offline long-video benchmarks test long-context video understanding, but usually assume the whole video is already available; standard video QA benchmarks are useful for comparability, but they are not the real target of streaming-memory papers. The tables below are copied or compacted from the corresponding method papers. They should not be read as one unified leaderboard: backbones, frame rates, memory budgets, judge versions, subtitle settings, and dataset splits often differ. ...

Series guide. This article is the stage-by-stage architecture map. Start with the development-history hub for the six research paths, and use the benchmark index for evaluation settings and protocols. Related papers: ReKV: Paper / Code StreamKV: Paper / Code InfiniPot-V: Paper / Code StreamMem: Paper LiveVLM: Paper / Code StreamingTOM: Paper / Code rLiVS: Paper / Code Core Question All of these papers are trying to solve the same systems problem: When a video stream keeps arriving, the user question is not known yet, and GPU memory is limited, how should a Video-LLM process the stream, compress memory, retrieve evidence, and generate an answer with low latency? ...