The paper introduces the concept of Information Capacity (IC) to quantify how much bandwidth savings a unit of decoder compute can achieve in generative video compression (GVC). By modeling reconstruction quality as a two‑factor power law in data rate and compute, the authors fit measured DISTS of two GVC decoders with high accuracy and define IC as the negative logarithmic slope along an iso‑quality contour. IC is dimensionless, enabling architecture‑agnostic comparisons and revealing that a 14B decoder trades compute for rate far more efficiently than a 1.3B decoder, with significant variation across datasets.
By Cheng Yuan, Jiawei Shao, Xuelong Li
arXiv:2607. 14898v1 Announce Type: cross Abstract: Real-time video generation demands fast decoding as much as fast denoising, yet current latent video diffusion models rely on 3D convolutional decoders that are slow and memory-intensive at high resolutions or for long video.
By Minguk Kang, Suha Kwak
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...
By Xijun Wang, Xin Li, Suhang Yao, Zirui Lang, Bingchen Li, Zhibo Chen
arXiv:2608.22866v1 Announce Type: new
Abstract: Storing face images under a hard sub-kilobyte budget, as required for identity documents, smart-card biometrics and bandwidth-constrained verification,...
By Petr Hurtik, Jakub Sochor
Tetra introduces a new Leech‑lattice based codebook that reduces the memory footprint of quantized LLMs to about 2.15 bits per weight, enabling efficient 2‑bit quantization without a massive lookup table. The method employs a 64‑state Golay trellis and a shared 16 KiB table, decoding each 24‑weight block with only six table loads and two small lookups. When applied to Qwen3 models (4B, 8B, 14B), Tetra achieves 2.70–2.73 bits per parameter, scoring 63–75 on MMLU and generating 57–114 tokens per second, while maintaining close performance to 4‑bit AWQ and outperforming llama.cpp’s IQ2_XXS on 4B.
The study investigates how long‑video language models decide which frames to keep, compress, and reuse, testing each decision in isolation across six selection rules, three benchmarks, and two answering models. It finds that selecting frames based on queries yields the biggest performance boost, that halving spatial resolution costs little, and that reallocating saved tokens to more compressed frames can further improve accuracy. The work also highlights the importance of a unified evaluation harness to avoid misleading comparisons.
By Prakhar Khatri
ScoutNeRV introduces a content‑adaptive initialization framework that speeds up the training of hierarchical grid‑based video implicit neural representations (INRs). By using a lightweight scout network to select a pre‑trained expert from a memory bank, the method transfers the expert’s grid and decoder parameters to a target HiNeRV model, achieving a 21.25 dB PSNR boost before fine‑tuning and reaching near‑baseline performance after only 37 epochs. The approach delivers a 9.25× wall‑clock speedup while maintaining competitive rate–distortion performance.
By Naser Alizada, Farhang Baghban, Hashem Pishkar, Ali Mousavi
arXiv:2609.18602v1 Announce Type: new
Abstract: Despite recent progress in learned image compression, existing methods remain computationally expensive on resource-constrained hardware, particularly...
By Zhaoyang Jia, Tianyu Zhang, Zihan Zheng, Wenxuan Xie, Jiahao Li, Bin Li, Houqiang Li, Yan Lu
arXiv:2606. 03940v1 Announce Type: cross Abstract: In robotics systems, vast amounts of visual data are easily captured at high resolution using low-cost, low-power hardware.
By Dan Jacobellis, Neeraja J. Yadwadkar
The paper introduces a multi‑shell decoder for Leech‑lattice vector quantization, achieving the best reported 2‑bit quality under its evaluation protocol. It presents a GPU‑friendly layout that fuses dequantization with matrix‑vector multiplication, demonstrating significant speed and memory advantages over traditional one‑hot masks and other 4‑bit methods. Experiments show the new kernel outperforms baseline approaches across multiple model sizes, with measurable gains in throughput and reduced byte traffic.
By Pier-Jean Malandrino (Scub)
arXiv:2608.28429v1 Announce Type: new
Abstract: Event cameras generate asynchronous, sparse data streams with microsecond temporal resolution, but in moderate-to-high motion scenes they can produce a...
By Zahra Rezaee, Catarina Brites, Jo\~ao Ascenso
arXiv:2609.17652v1 Announce Type: new
Abstract: When agentic sessions run to a million tokens with many sessions resident at once, the KV cache and the index that ranks it live in host memory, and th...
By Vivek Kalyanarangan