An autonomous research agent chose its own research question and five runs produced workshop-level papers
AspireAI community · arXiv (Ko Fujimura)
Systems like The AI Scientist let agents carry out and write up research, but humans still chose the research area and picked which outputs to show. This study removes that hand-holding, giving an off-the-shelf coding agent an instruction document plus two skills, one for formulating the question that diverges from recent technologies into other fields, screens candidates for known failure modes and takes a critique from a different model, and one for peer review where a reviewer from another model family reruns the study from its records before the agent revises the paper. Over 13 development runs, changing the one or two sentences that set the research area produced large shifts in the candidate questions and chosen papers. The system was then frozen after a pilot run, and five consecutive runs, one pilot plus four pre-registered, each ran from question formulation to a revised, re-computable paper on a laptop with no research input from humans, and external AI reviewers reading only the papers judged them at or near workshop level. The system, the five papers and the records needed to reproduce them are released.
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.