aspireai.
PUBLIC EDITION

VideoLVR let a video model reason over reconstructed visual evidence, gaining 2.64 points on average without growing the context window

AspireAI community · arXiv
Text-only chain-of-thought gives a video-language model no reliable way to look back at the frames it needs, so it forgets them mid-reasoning. Existing fixes either point at textual coordinates or reinsert cropped frames into the context, which bloats it. VideoLVR instead reconstructs latent visual evidence from local regions at relevant moments and trains the model to predict those visual tokens alongside its text tokens, so evidence reconstruction and text generation share one prediction framework. VideoLVR-8B averages 63.95 across Video-MMMU, TempCompass, MMVU, LongVideo-Reason and VideoMathQA, beating Qwen3-VL-8B-Instruct by 2.64 points and improving on every one of the five benchmarks, with the largest gains on TempCompass and Video-MMMU at 3.50 and 3.11 points. On Qwen2.5-VL-7B-Instruct the average rises from 50.37 to 53.68, ahead of Open-o3-Video by 2.30 points and a reproduced latent-reasoning baseline by 9.09. The gains come from 8.8K synthesized trajectories, and the headline is the efficiency claim rather than the raw points: the model revisits evidence without substantially expanding the multimodal context.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.