DyCraft breaks long-horizon 3D animation into a storyboard of verified start and end states, which coding agents can build and debug separately
AspireAI community · arXiv (cs.CV)
Frontier coding agents generate good 3D scenes and articulated assets but struggle with coherent long-horizon animation: equipped with general-purpose harnesses they produce physically implausible results where objects interpenetrate, lack support or move unnaturally, and they struggle to repair this because they default to scripting the whole animation in one pass. DyCraft takes the practice of human animators and decomposes the job. It expands the prompt into a detailed plan, builds a static scene, then creates a 3D storyboard of key animation poses where each frame is a static 3D scene the agent can build and debug in isolation. Storyboarding decomposes the problem into pairs of verified start and end states, so the agent authors local motion between them with a collection of motion authoring tools. On 24 long-horizon, multi-shot tasks covering humanoid robots, human and animal characters and physical mechanisms, the authors report substantially reduced physical violations against a native GPT-6 agent in Codex and prior agentic baselines.
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.