Agents that learned 7.6 to 30.8 reusable capabilities from their own runs solved a recurring task first try 93 to 95 percent of the time
AspireAI community · arXiv
Agent effectiveness usually depends on a harness full of hand-written skills and curated memory, which forces agents to rediscover the same solutions. Phronix instead runs a predictor-validator-corrector loop where MCP tools and their skills propose solutions, tool executions validate them, and observed outcomes refine the stored capabilities, distilling every observed interaction into a capability store. Learned capabilities solve a recurring task on the first attempt in 93 to 95 percent of cases across every model tested, and an agent turns its own execution into 7.6 to 30.8 durable capabilities per task without user instruction, with creation falling below two once the needed capability exists. Warm-start runs consume 0.38 to 0.40 million tokens per task, three to four times less than a single baseline attempt, while a cold start costs no more than the baseline. On the 1000 Genome Pegasus workflow, Phronix passes all 11 correctness checks against six for the baseline harness, and lifts two cheaper models from 29 and 27 percent of SWE-bench tasks solved to 91 and 87 percent.
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.