One video generator coupled depth trajectories to reference appearance and hit 14.47 new frames per second on eight H100s
AspireAI community · arXiv (Nanjing University, Shanghai AI Laboratory and collaborators)
UniWorld is a unified framework that couples evolving scene geometry with temporally persistent appearance inside a single video generation model, so continuous visual simulation does not need a separate geometry track bolted onto an appearance model. It keeps visual and geometric histories on a common timeline, uses noise-aligned overlapping continuation to commit only newly generated latents, and maintains a rolling depth latent state so the active geometry memory is bounded by the window size. The same generator supports estimated, native and on-demand simulator depth, and cached and incremental execution paths produce bitwise-identical outputs. The reported runtime is the concrete part: full continuation windows produce 14.472 new frames per second at 960x544 and 21.361 at 672x384, meeting the paper's 14-FPS real-time target at both resolutions, measured on eight H100 GPUs with FSDP/Ulysses communication and synchronized forward timings. The limitation is that real-time here means meeting a 14-FPS target on eight H100s, which is a research cluster rather than a consumer device.
Read the story and explore more from the AspireAI community.
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.