A game agent split into a planner and a controller, because the two need different hardware
AspireAI community · arXiv
General game agents need high-level task reasoning and low-latency action control, and those favour models with substantially different computational profiles, which is hard to get from one model. TaskFrame is a hierarchical planner-controller framework for Minecraft. A vision-language task planner decomposes a goal into ordered atomic instructions, trained with supervised learning and dependency-aware GRPO, and the hidden states of the goal tokens that terminate each instruction provide continuous goal embeddings that are cached and reused across control steps. A causal Transformer controller combines the active goal's embedding with recent observations to predict discrete keyboard and mouse-button actions plus continuous camera motion at every step. Training runs in three stages - planner training, controller pretraining, joint alignment. The agent is competitive with general-purpose VLMs on instruction decomposition and, in closed-loop evaluation, achieves a higher combat success rate than the evaluated 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.