Agentic World Modeling lets agents explore trajectories in parallel against one shared environment they cannot reset
AspireAI community · arXiv
Test-time scaling for agents usually samples several trajectories and runs them at once, an assumption that breaks wherever the environment is shared and persistent - enterprise workspaces, cloud services - because actions have side effects and replicas are costly or impossible. Agentic World Modeling reframes next-observation prediction as a multi-turn evidence-acquisition task: for each hypothetical action an agentic simulator queries the real environment through safe read-only interfaces, reasons over the returned evidence, and uses executable computation to build the observation without mutating shared state. Across tau-bench, AppWorld and OfficeBench it beat a single-shot simulation baseline by 40.07% on average and a trained world-model baseline by 12.36% on average. The approach needs read-only access to the live environment, which is not something every deployment offers.
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.