arXiv:2610. 11746v1 Announce Type: new Abstract: Real-time video super-resolution requires high spatio-temporal fidelity under strict latency constraints, challenging diffusion models due to their iterative sampling cost and limited temporal coordination.
arXiv:2610.08772v1 Announce Type: new Abstract: Diffusion Transformers (DiTs) have achieved strong performance in image and video generation, but the quadratic complexity of full attention makes high...
arXiv:2602. 01801v2 Announce Type: replace-cross Abstract: Autoregressive video diffusion models enable streaming generation, opening the door to long-form synthesis, video world models, and interactive neural game engines.
Real-time video restoration (VR) for live streams requires high-resolution outputs under strict per-frame latency constraints. Existing one-step diffusion-based VR models remain difficult to deploy on consumer-grade GPUs due to two main bottlenecks: quadratic spatial attention at high resolutions and the latency-memory overhead of large video autoencoders.
Large generative models can recover realistic detail in real-world video super-resolution (VSR), but processing an entire video with them is computationally expensive. In this work, we present RelayVS...
RelayVSR introduces a streaming video super‑resolution framework that combines a large generative model, which produces reference latents for sparse keyframes, with a lightweight Dual‑Memory Video Transformer that super‑resolves every frame using these references and low‑resolution input. The method employs Video‑Aware Reference Optimization (VARO), a reinforcement‑learning strategy that optimizes both system‑level video quality and reference‑level keyframe fidelity, outperforming direct joint training. On 1080p video, RelayVSR achieves 29.29 FPS with modest GPU memory usage, significantly faster and more efficient than the FlashVSR‑Tiny baseline.
arXiv:2510. 09608v2 Announce Type: replace-cross Abstract: Vision-language models (VLMs) could power real-time assistants and autonomous agents, but they face a critical challenge: understanding near-infinite video streams without escalating latency and memory usage.
arXiv:2609.37831v1 Announce Type: new Abstract: Real-time diffusion-based video super-resolution (VSR) is in high demand for online streaming, yet stringent latency requirements often compromise gene...
arXiv:2609.24788v1 Announce Type: new Abstract: In this paper, we propose SVEET, a framework that requires merely training on a pretrained bidirectional video diffusion model but supports high-qualit...
Video DeltaNet (VDN) introduces a hybrid attention mechanism for livestream video generation, combining local Softmax attention with a bidirectional linear memory branch called Video Delta Attention (VDA). VDA updates memory once per frame, integrating spatial tokens, while separate output projections and learnable gates balance the two branches. Applied to MiniMax H3, VDN achieves a 14.5× speedup over the dense baseline, completing 14.3‑second, 768p video denoising in 6.70 seconds on eight NVIDIA B200 GPUs.
ActDiff-VC is a diffusion-based video compression framework designed for ultra‑low‑bitrate scenarios. It partitions videos into variable‑length segments, transmits keyframes only when necessary, and encodes temporal dynamics with a compact set of tracked point trajectories. Conditioned on these sparse signals, a conditional diffusion decoder reconstructs the remaining frames, achieving significant bitrate reductions and perceptual quality gains compared to strong learned codecs.
High-Fidelity Video Quality Assessment (HFVQA) is a new framework that uses fixed-size spatio‑temporal patches across multiple scales, including the original resolution, to preserve low‑level quality cues and semantic context. It incorporates a lightweight auxiliary network that learns VQA‑specific saliency directly from quality supervision, enabling the model to focus on the most important spatio‑temporal regions. By combining high‑fidelity cues with task‑specific saliency, HFVQA achieves state‑of‑the‑art performance on standard no‑reference VQA benchmarks while processing only about 12% of the candidate patches, making it computationally efficient.