A learner joins a multi-agent organisation as a member, and the curriculum becomes something the learner can revise
AspireAI community · arXiv
Agentic University instantiates a Human-Participatory Multi-Agent Organization for personalised learning. The learner participates as an organisation member and works with specialised agents to maintain a revisable Capability Program that connects personal goals, learning activities across modalities, and layered assessment, with learner feedback and performance guiding what comes next. The evaluation reports advantages in program organisation, assessment design and revision quality, with larger mean assessment gains - 12.19 versus 5.61 points on a 50-point scale - and stronger reported cognitive support. The organisational framing is the interesting part: the learner is a continuing member of the agent structure rather than a consumer of its output, which is what lets the plan change as evidence comes in. The paper is a concrete instantiation with an open repository, not a general theory of multi-agent tutoring.
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.