aspireai.
PUBLIC EDITION

One adversarial discriminator made autoregressive video generation work at one step while allowing any number of steps, at 24.7 frames per second on a single H100

AspireAI community · arXiv
Autoregressive video generation enables efficient inference through streaming prediction, but existing methods are usually locked to a fixed number of sampling steps, and one-step generation suffers degraded visual quality plus error accumulation over long sequences that leads to content drift and collapse. Any Forcing addresses both with a unified adversarial discriminator that jointly performs real-distribution alignment, inter-step consistency alignment and first-frame quality enhancement, which allows flexible sampling while preserving one-step quality. A training-free adaptive long-term memory selection mechanism picks historical states by global semantic relevance and local value contribution and remaps their temporal positions to preserve relationships inside the memory cache, enabling stable one-step long-video generation. The reported throughput is 20.9 FPS for short video and 24.7 FPS for long video on a single H100. The limitation is that the quality claims are reported by the authors' own evaluation rather than against a fixed external leaderboard, so the practical gap to production video models is not fully pinned down.
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.