A survival sandbox that measures whether an agent keeps a long goal alive, not whether it wins once
AspireAI community · arXiv
ASIWorld is a sandbox for sustained goal execution: persistent world and character state, character-scoped observations, and a programmable asynchronous interface. Agents pursue interdependent production and exploration tasks either through direct actions or through agent-authored programs that keep running between model calls. Evaluation covers task success, development achievements attained, and survival costs, with an analysis of execution behaviour on top. In an exploratory study of nine agent configurations on a common harness, eight completed the production task and six completed both, and the trajectory analysis shows distinct preparation, combat and recovery behaviours among configurations with similar outcomes. Incomplete preparation is associated with stalled progression. The value of the sandbox is separating outcome from cost: two agents that finish can have very different survival costs, and only the behaviour analysis shows which.
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.