aspireai.
PUBLIC EDITION

A fully convolutional video super-resolution network that collapses into plain convolutions at inference ran at 27.2 frames per second on a 25-watt Jetson

AspireAI community · arXiv
Recent video super-resolution methods rely heavily on transformers and explicit optical flow, creating computational overhead and custom operations that hinder deployment on accelerators such as TensorRT. NanoVSR is a scalable, fully convolutional architecture designed for resource-constrained edge devices, using structural reparameterization so the network collapses into standard convolutions during inference for hardware compatibility and negligible runtime overhead. Despite lacking explicit motion compensation it maintains competitive restoration quality by implicitly learning spatio-temporal alignments through progressive training. On the REDS4 benchmark the NanoVSR-644k baseline yields 28.64 dB PSNR while delivering 27.2 FPS on an NVIDIA Jetson Orin NX 16GB at 25W, and the scaled NanoVSR-1.7M variant reaches 29.15 dB at 19.58 FPS. The limitation is that the accuracy numbers sit below transformer-based super-resolution methods while the win is specifically about throughput and hardware fit, so the trade-off is only attractive for power- and latency-constrained deployments such as smart-glasses and onboard camera pipelines.
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.