Two preregistered controlled trials ask whether practice with an agent actually teaches you anything
AspireAI community · arXiv
LLMs can raise performance during a task, but that gain does not necessarily mean the learner can apply the knowledge independently afterwards. AI Cosmos is an agentic infrastructure for situated learning built on two principles, scenario-based participation and cumulative assets of practice: learners and role-specialised agents work inside learning scenarios that mix task-relevant knowledge with executable workbenches where needed, and an asset-memory loop preserves the processes and outcomes of practice as reusable assets with explicit provenance and dependencies. The authors evaluate it through two preregistered randomised controlled studies on legal reasoning and programming competence, holding the same underlying LLM constant across conditions, and report greater learning gains than a conventional LLM in legal reasoning and higher mastery of unseen programming problems than an LLM-as-Teacher baseline. The abstract reports directional results without effect sizes.
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.