Writing a reusable generator once and running it many times cut articulated-asset API cost from 1.24 dollars to 0.05 dollars per asset across 402,410 assets
AspireAI community · arXiv
Building high-quality articulated assets at scale usually means either manual modelling or repeating an agent's reasoning for every new asset. This work combines the two: agents construct reusable category-level generator programs, and procedural execution then produces many variants with no further model calls or token charges. Estimated API cost of generator authoring averages 10.62 dollars, amortising to 0.05 dollars per asset over 200 assets against 1.24 dollars for a sampled per-asset agentic synthesis baseline. The release contains 402,410 articulated assets across more than 500 categories, each with explicit part structure, kinematics, estimated physical properties and reproducible generation parameters, and the authors report a 100 percent asset-level kinematic pass rate over the full release. The limitation is structural: procedural generation amortises sampling but requires category-specific generator authoring, so a new category still needs an agent to build and validate its generator.
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.